Submission #102992
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <map> using namespace std; #define FOR(i, a, n) for(int i = (a); i < (n); i++) #define REP(i, n) FOR(i, 0, n) #define RFOR(i, a, n) for(int i = (n) - 1; i >= (a); i--) #define RREP(i, n) RFOR(i, 0, n) #define ALL(v) (v).begin(), (v).end() #define fst first #define snd second const int MAX_N = 110000; int n, m; int a[MAX_N]; int s[MAX_N]; int main(){ cin >> n >> m; REP(i, n){ cin >> a[i]; s[i + 1] = s[i] + a[i]; } int p = 0, r = s[n / 2]; REP(i, m){ int k; cin >> k; k--; p = (p + k) % n; int v = 0; if(p + n / 2 > n){ v = s[n] - s[p]; v += s[n / 2 - (n - p)]; }else{ v = s[p + n / 2] - s[p]; } r = max(r, v); } cout << r << endl; }
Submission Info
Submission Time | |
---|---|
Task | J - Very Intellectual Card Game |
User | torimal |
Language | C++ (GCC 4.4.7) |
Score | 0 |
Code Size | 787 Byte |
Status | WA |
Exec Time | 133 ms |
Memory | 1584 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 2, 3, 4, 5, 6, 7, 8, 9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1 | AC | 21 ms | 680 KB |
10 | WA | 22 ms | 808 KB |
11 | WA | 20 ms | 808 KB |
12 | WA | 20 ms | 796 KB |
13 | WA | 94 ms | 1320 KB |
14 | WA | 67 ms | 932 KB |
15 | WA | 132 ms | 1584 KB |
16 | WA | 133 ms | 1572 KB |
17 | WA | 133 ms | 1564 KB |
18 | WA | 133 ms | 1576 KB |
2 | WA | 21 ms | 808 KB |
3 | AC | 21 ms | 680 KB |
4 | AC | 21 ms | 740 KB |
5 | AC | 21 ms | 932 KB |
6 | AC | 21 ms | 932 KB |
7 | AC | 22 ms | 736 KB |
8 | AC | 20 ms | 804 KB |
9 | WA | 21 ms | 804 KB |