Submission #638857


Source Code Expand

#include<iostream>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

int n,m;
ll a[100100], sum[100100];
ll k[100100];

int main(){
  cin >> n >> m;
  rep(i,n)cin >> a[i];
  rep(i,m)cin >> k[i];

  int med = n/2;
  sum[0] = 0;
  rep(i,med)sum[0] += a[i];
  rep(i,n-1)sum[i+1] = sum[i] + a[(i+med)%n] - a[i];

  ll head = 0, maxv = sum[0];
  rep(i,m){
    (head += k[i]-1) %= n;
    maxv = max(maxv, sum[head]);
  }
  cout << maxv << endl;
}

Submission Info

Submission Time
Task J - Very Intellectual Card Game
User Darsein
Language C++11 (GCC 4.8.1)
Score 100
Code Size 501 Byte
Status AC
Exec Time 160 ms
Memory 3184 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 18
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 27 ms 876 KB
10 AC 27 ms 884 KB
11 AC 26 ms 872 KB
12 AC 26 ms 928 KB
13 AC 116 ms 2412 KB
14 AC 81 ms 1736 KB
15 AC 159 ms 3140 KB
16 AC 160 ms 3140 KB
17 AC 160 ms 3184 KB
18 AC 160 ms 3172 KB
2 AC 23 ms 928 KB
3 AC 24 ms 920 KB
4 AC 23 ms 924 KB
5 AC 26 ms 928 KB
6 AC 29 ms 796 KB
7 AC 26 ms 924 KB
8 AC 27 ms 804 KB
9 AC 27 ms 932 KB