Submission #63412

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
63412	2018-08-01 18:18:23	ksun48	Homecoming (BOI18_homecoming)	C++14	44 / 100	1072 ms	47692 KiB

homecoming

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL reallybad = -10000000000000000LL;
LL test(int n, int k, vector<LL> a, vector<LL> b, int x){
  LL ans = reallybad;
  vector<LL> newa;
  vector<LL> newb;
  vector<LL> bpsums(1,0);
  for(int i = 0; i < n; i++){
    newa.push_back(a[(i+x) % n]);
    newb.push_back(b[(i+x) % n]);
  }
  for(int i = 0; i < n; i++){
    bpsums.push_back(bpsums[i] + newb[i]);
  }
  for(int y = 0; y < 2; y++){
    vector<LL> dp0(n+1, reallybad);
    vector<LL> dp1(n+1, reallybad);
    if(y == 0) dp0[0] = 0;
    if(y == 1) dp1[0] = 0;
    for(int i = 0; i <= n; i++){
      dp1[i] = max(dp1[i], dp0[i]);
      if(i + 1 <= n){
        dp0[i+1] = max(dp0[i+1], dp0[i]);
        dp1[i+1] = max(dp1[i+1], dp1[i] + newa[i] - newb[i]);
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 0 / 18
• Subtask 3: 31 / 31
• Subtask 4: 0 / 38