oj.uz

Submission #958718

# Submission time Handle Problem Language Result Execution time Memory
958718 2024-04-06T12:51:18 Z aeg Homecoming (BOI18_homecoming) C++17
0 / 100
 22 ms 4188 KB 
#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;
	cost = accumulate(b, b + k, 0ll);
	maxi = 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);
	maxi = max(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 = b[k + i - 1 - n];
		cur = max(cur + a[i] - nextcost, maxi + a[i] - (cost + nextcost));
		maxi = max(maxi, cur);
		cost += nextcost;
	}
	return maxi;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 4188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -