oj.uz

Submission #117081

# Submission time Handle Problem Language Result Execution time Memory
117081 2019-06-14T16:22:02 Z Bruteforceman Homecoming (BOI18_homecoming) C++11
31 / 100
 1000 ms 25564 KB 
#include "bits/stdc++.h"
#include "homecoming.h"
using namespace std;
const long long inf = 1e17;
long long S[2000010];
long long dp[2][2000010];

long long solve(int N, int K, int *A, int *B) {
	long long all = 0;
	for(int i = 0; i < N; i++) {
		all += A[i] - B[i];
	}
	long long ans = all;
	long long sum = 0;
	for(int i = 0; i < K; i++) {
		sum += B[i];
	}
	for(int i = 0; i < N; i++) {
		S[i] = sum;
		sum += B[(i + K) % N] - B[i];
	}
	for(int i = 0; i < N; i++) {
		dp[0][i] = 0;
		dp[1][i] = -inf;
		for(int j = 1; j < N; j++) {
			int id = (i + j) % N;
			int prev = (id + N - 1) % N;
			dp[0][id] = max(dp[0][prev], dp[1][prev]);
			dp[1][id] = max(dp[0][prev] + A[id] - S[id], dp[1][prev] + A[id] - B[(id + K - 1) % N]);
		}
		ans = max(ans, dp[0][(i + N - 1) % N]);
		ans = max(ans, dp[1][(i + N - 1) % N]);
	}
	return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 354 ms 692 KB Output is correct
7 Correct 351 ms 688 KB Output is correct
8 Correct 99 ms 640 KB Output is correct
9 Correct 361 ms 732 KB Output is correct
10 Correct 3 ms 512 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 25564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 354 ms 692 KB Output is correct
7 Correct 351 ms 688 KB Output is correct
8 Correct 99 ms 640 KB Output is correct
9 Correct 361 ms 732 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Execution timed out 1060 ms 25564 KB Time limit exceeded
12 Halted 0 ms 0 KB -