Submission #101863
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <cstring> #include <queue> #include <map> #include <set> #include <algorithm> using namespace std; #define rep(i,n) for(int i=0;i<(int)n;++i) #define pb(a) push_back(a) #define mp(a,b) make_pair(a,b) #define ALL(a) a.begin(),a.end() #define SZ(a) (int)((a).size()) #define F first #define S second typedef pair<int,int> PI; typedef long long ll; ll sum[400000]; ll in[400000]; int main(int argc, char *argv[]) { int n,m; cin >> n >> m; rep(i,n){ cin >> in[i]; in[i+n]=in[i]; in[i+2*n]=in[i]; } rep(i,3*n) sum[i+1]=sum[i]+in[i]; ll ans=sum[n/2]-sum[n/2-n/2]; ll s=n/2; rep(i,m){ ll k; cin >> k; s += k-1; s %= n; if(s<n/2) s+=n; ans=max(sum[s]-sum[s-n/2],ans); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | J - Very Intellectual Card Game |
User | plusplusw |
Language | C++ (GCC 4.4.7) |
Score | 100 |
Code Size | 856 Byte |
Status | AC |
Exec Time | 144 ms |
Memory | 5496 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | 804 KB |
10 | AC | 21 ms | 804 KB |
11 | AC | 21 ms | 804 KB |
12 | AC | 20 ms | 792 KB |
13 | AC | 99 ms | 4508 KB |
14 | AC | 70 ms | 2036 KB |
15 | AC | 142 ms | 5424 KB |
16 | AC | 140 ms | 5496 KB |
17 | AC | 142 ms | 5416 KB |
18 | AC | 144 ms | 5404 KB |
2 | AC | 23 ms | 808 KB |
3 | AC | 22 ms | 812 KB |
4 | AC | 22 ms | 808 KB |
5 | AC | 21 ms | 796 KB |
6 | AC | 22 ms | 796 KB |
7 | AC | 21 ms | 928 KB |
8 | AC | 22 ms | 928 KB |
9 | AC | 20 ms | 788 KB |