oj.uz

답안 #73889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73889 2018-08-29T08:23:48 Z zscoder Homecoming (BOI18_homecoming) C++17
31 / 100
 1000 ms 36460 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "homecoming.h"

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;

ll prefa[4222222];
ll prefb[4222222];

ll suma(int l, int r)
{
	if(l==0) return prefa[r];
	else return prefa[r]-prefa[l-1];
}

ll sumb(int l, int r)
{
	if(l==0) return prefb[r];
	else return prefb[r]-prefb[l-1];
}

const ll INF=ll(1e18);
ll dp[4222222][2];
ll solve(int n, int k, int *a, int *b)
{
	ll ans = 0;
	for(int i=0;i<2*n;i++)
	{
		prefa[i]=a[i%n]; prefb[i]=b[i%n];
		if(i>0) 
		{
			prefa[i]+=prefa[i-1]; prefb[i]+=prefb[i-1];
		}
		dp[i][0]=dp[i][1]=-INF;
	}
	ans = max(0LL,prefa[n-1]-prefb[n-1]);
	for(int s=0;s<n;s++)
	{
		for(int i=s;i<n+s;i++)
		{
			for(int j=0;j<2;j++)
			{
				dp[i][j]=-INF;
			}
		}
		for(int i=s;i<n+s;i++)
		{
			if(i==s)
			{
				dp[i][1] = a[i%n] - sumb(i%n, i%n+k-1);
				dp[i][0] = 0;
			}
			else
			{
				dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
				dp[i][1] = max(dp[i-1][0] + a[i%n] - sumb(i%n, i%n+k-1), dp[i-1][1] + a[i%n] - b[(i+k-1)%n]);
			}
			ans=max(ans,dp[i][1]);
			ans=max(ans,dp[i][0]);
		}
	}
	return ans;
}

/*
int aaaa[2111111];
int bbbb[2111111];
int main()
{
	int n,k;
	cin>>n>>k;
	for(int i=0;i<n;i++)
	{
		cin>>aaaa[i];
	}
	for(int i=0;i<n;i++)
	{
		cin>>bbbb[i];
	}
	cout<<solve(n,k,aaaa,bbbb)<<'\n';
}
*/

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 7 ms 508 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 9 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 7 ms 508 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 9 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 406 ms 1012 KB Output is correct
7 Correct 456 ms 1312 KB Output is correct
8 Correct 116 ms 1312 KB Output is correct
9 Correct 431 ms 1484 KB Output is correct
10 Correct 4 ms 1484 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 36460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 7 ms 508 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 9 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 406 ms 1012 KB Output is correct
7 Correct 456 ms 1312 KB Output is correct
8 Correct 116 ms 1312 KB Output is correct
9 Correct 431 ms 1484 KB Output is correct
10 Correct 4 ms 1484 KB Output is correct
11 Execution timed out 1074 ms 36460 KB Time limit exceeded
12 Halted 0 ms 0 KB -