Submission #958723

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
958723	2024-04-06 12:53:20	aeg	Homecoming (BOI18_homecoming)	C++17	100 / 100	92 ms	55612 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>
#include "homecoming.h"
using namespace std;
long long solve(int n, int k, int *a, int *b){
  long long cur, cost, nextcost, maxi = INT_MIN, maxj = INT_MIN;
  cost = accumulate(b, b + k, 0ll);
  maxi = a[0] - cost;
  cur = a[0] - cost;
  for(int i = 1; i < n; i++){
    cost -= b[i - 1];
    if(i + k - 1 < n) nextcost = b[k + i - 1];
    else nextcost = 0;
    cur = max(cur + a[i] - nextcost, maxi + a[i] - (cost + nextcost));
    maxi = max(maxi, cur);
    cost += nextcost;
  }
  cost = accumulate(b, b + k, 0ll);
  maxj = max(0ll, a[0] - cost);
  cur = a[0] - cost;
  for(int i = 1; i < n; i++){
    cost -= b[i - 1];
    if(i + k - 1 < n) nextcost = b[k + i - 1];
    else nextcost = b[k + i - 1 - n];
    cur = max(cur + a[i] - nextcost, maxj + a[i] - (cost + nextcost));
    maxj = max(maxj, cur);
    cost += nextcost;
  }
  maxi = max(maxi, maxj);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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