oj.uz

답안 #69747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69747 2018-08-21T12:36:30 Z khohko Homecoming (BOI18_homecoming) C++17
0 / 100
 315 ms 59508 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)(6e6+100))
#define MAX ((ll)(1e16+100))


ll a[ARRS];
ll b[ARRS];
ll s[ARRS];
ll sm[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);

	pair<ll,ll> mn={MAX,MAX};
	ll es=0,l=1;
	vector<pair<ll,ll> > g;
	multiset<ll > st;
	for(int i=1; i<=2*n; i++){
		sm[i]=sm[i-1]+b[i]-a[i];
	}
	ll s=0;
	st.insert(0);
	for(int i=1; i<=2*n; i++){
		if(st.size()>K)st.erase(st.find(sm[i-K-1]));
		st.insert(sm[i]);
		ll es=-(sm[i]-*st.begin());
		g.pb({es,i-1});
	}
	sort(g.begin(),g.end());
	//for(int i=0; i<5; i++){
		s=g[0].sc;
		s++;
		s%=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:47:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(st.size()>K)st.erase(st.find(sm[i-K-1]));
      ~~~~~~~~~^~
homecoming.cpp:37:14: warning: variable 'mn' set but not used [-Wunused-but-set-variable]
  pair<ll,ll> mn={MAX,MAX};
              ^~
homecoming.cpp:38:5: warning: unused variable 'es' [-Wunused-variable]
  ll es=0,l=1;
     ^~
homecoming.cpp:38:10: warning: unused variable 'l' [-Wunused-variable]
  ll es=0,l=1;
          ^

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Incorrect 3 ms 612 KB Output isn't correct

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Incorrect 3 ms 612 KB Output isn't correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 315 ms 59508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Incorrect 3 ms 612 KB Output isn't correct