oj.uz

Submission #69611

# Submission time Handle Problem Language Result Execution time Memory
69611 2018-08-21T10:01:09 Z khohko Homecoming (BOI18_homecoming) C++17
13 / 100
 936 ms 141544 KB 
#include<bits/stdc++.h>
#include "homecoming.h"
using namespace std;
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define ARRS ((ll)(4e6+100))
#define MAX ((ll)(1e17+100))


ll a[ARRS];
ll b[ARRS];
ll s[ARRS];
ll dp[ARRS][2];

ll sum(ll l,ll r){
	return s[r]-s[l-1];
}

long long solve(int n, int K, int *B, int *A){
	ll pas=0,p=0;
	for(int i=1; i<=n; i++){
		a[i]=A[i-1];
		a[i+n]=A[i-1];

		b[i]=B[i-1];
		b[i+n]=B[i-1];

		p-=a[i];
		p+=b[i];
	}
	for(int i=1; i<=2*n; i++)s[i]=s[i-1]+a[i];
	pas=max(pas,p);

	ll ct=50;
	while(ct--){
		ll s=abs(rand()<<16ll+rand())%n;
		dp[0][0]=0;
		dp[0][1]=-MAX;
		for(int i=1; i<=n; i++){
			dp[i][0]=dp[i-1][0];
			dp[i][1]=-MAX;
			if(i>=K){
				dp[i][1]=max(dp[i][1],dp[i-K][0]+b[i-K+1+s]-sum(i-K+1+s,i+s));
				dp[i][1]=max(dp[i][1],dp[i-1][1]+b[i-K+1+s]-a[i+s]);
			}
			dp[i][0]=max(dp[i][0],dp[i][1]);
			//cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
		}
		pas=max(pas,dp[n][0]);
		//cout<<endl;
	}
	return pas;
}

Compilation message

homecoming.cpp: In function 'long long int solve(int, int, int*, int*)':
homecoming.cpp:38:24: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   ll s=abs(rand()<<16ll+rand())%n;
                    ~~~~^~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 4 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 4 ms 1004 KB Output is correct
10 Incorrect 7 ms 1004 KB Output isn't correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 35884 KB Output is correct
2 Correct 12 ms 35884 KB Output is correct
3 Correct 936 ms 141544 KB Output is correct
4 Correct 13 ms 141544 KB Output is correct
5 Incorrect 41 ms 141544 KB Output isn't correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 4 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 4 ms 1004 KB Output is correct
10 Incorrect 7 ms 1004 KB Output isn't correct