oj.uz

Submission #596356

# Submission time Handle Problem Language Result Execution time Memory
596356 2022-07-14T15:54:13 Z kshitij_sodani Uplifting Excursion (BOI22_vault) C++14
20 / 100
 5000 ms 2512 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'


llo n,dd;
llo it[350];

int cc[601];
int dp[2000001];
deque<pair<llo,llo>> zz[301];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>dd;

	llo cot=0;
	int ma=0;
	for(llo i=0;i<n;i++){
		llo aa;
		cin>>aa;
		cot+=aa;
		cc[i]=aa;

	}
	llo su=0;
	for(llo i=0;i<=n;i++){
		cin>>it[i];
		su+=it[i]*i;
		cot+=it[i];
		cc[n+i]=i;
	}
	for(int i=0;i<=2*n;i++){
		ma=max(ma,cc[i]);
	}
	if(false){//ma<=100 and n<=100){

		int xx=n*n*100;
		for(int i=0;i<=2*xx;i++){
			dp[i]=-1;
		}
		dp[xx]=0;
		for(int j=1;j<=n;j++){
			for(int jj=0;jj<j;jj++){
				zz[jj].clear();
			}
			llo ax=j*cc[n-j];
			int y=0;
			int z=0;
			for(int ii=0;ii<=2*xx;ii++){
			//	int y=ii%j;
				if(dp[ii]>=0){
					pair<int,int> cur={dp[ii]-z,ii};
					while(zz[y].size()){
						if(zz[y].back().a<=cur.a){
							zz[y].pop_back();
						}
						else{
							break;
						}
					}
					zz[y].pb(cur);
				}
				while(zz[y].size()){
					if(zz[y].front().b<ii-ax){
						zz[y].pop_front();
					}
					else{
						break;
					}
				}
				if(zz[y].size()){
					int xx=zz[y].front().a+z;
					dp[ii]=max(dp[ii],xx);
				}
				y++;
				if(y==j){
					y=0;
					z++;
				}
			}

		}
		/*for(int i=0;i<=2*xx;i++){
			if(dp[i]>=0){
				cout<<i-xx<<","<<dp[i]<<endl;
			}
		}*/
		for(int i=0;i<=xx;i++){
			swap(dp[xx+i],dp[xx-i]);
		}
		for(int j=1;j<=n;j++){
			for(int jj=0;jj<j;jj++){
				zz[jj].clear();
			}
			llo ax=j*it[j];
			int y=0;
			int z=0;
			for(int ii=0;ii<=2*xx;ii++){
			//	int y=ii%j;
				if(dp[ii]>=0){
					pair<int,int> cur={dp[ii]-z,ii};
					while(zz[y].size()){
						if(zz[y].back().a<=cur.a){
							zz[y].pop_back();
						}
						else{
							break;
						}
					}
					zz[y].pb(cur);
				}
				while(zz[y].size()){
					if(zz[y].front().b<ii-ax){
						zz[y].pop_front();
					}
					else{
						break;
					}
				}
				if(zz[y].size()){
					int xx=zz[y].front().a+z;
					dp[ii]=max(dp[ii],xx);
				}
				y++;
				if(y==j){
					y=0;
					z++;
				}
			}
		}

		if(dd>xx or dd<-xx){
			cout<<"impossible"<<endl;
			return 0;
		}
		if(dp[xx+dd]==-1){
			cout<<"impossible"<<endl;
			return 0;
		}
		llo ans=dp[xx+dd];
		ans+=it[0];
		cout<<ans<<endl;

		return 0;
	}
	if(su<dd){
		cout<<"impossible"<<endl;
		return 0;
	}
	llo cur=su-dd;
	it[0]=0;
	llo ans=-1;
	for(llo i=1;i<=n;i++){
		llo su2=0;
		llo ac=0;
		for(llo j=i+1;j<=n;j++){
			llo xx=it[j]-n;
			if(xx<0){
				xx=0;
			}
			ac+=xx;
			su2+=xx*j;
		}
		if(su2>cur){
			continue;
		}
		llo su3=0;//n*n*n;
		for(llo j=1;j<i;j++){
			su3+=j*min(it[j],i);
		}
		for(llo j=i+1;j<=n;j++){
			su3+=j*min(it[j],n);
		}

		for(llo j=0;j<=su3;j++){
			dp[j]=-1;
		}
		dp[0]=0;
		su3=0;
		for(int j=1;j<=n;j++){
			if(j==i){
				continue;
			}
			if(j<i){
				su3+=j*min(it[j],i);
			}
			else{
				su3+=j*min(it[j],n);
			}
			for(int jj=0;jj<j;jj++){
				zz[jj].clear();
			}
			llo ax=j*min(it[j],n);
			int y=0;
			int z=0;
			for(int ii=0;ii<=su3;ii++){
			//	int y=ii%j;
				if(dp[ii]>=0){
					pair<int,int> cur={dp[ii]-z,ii};
					while(zz[y].size()){
						if(zz[y].back().a>=cur.a){
							zz[y].pop_back();
						}
						else{
							break;
						}
					}
					zz[y].pb(cur);
				}
				while(zz[y].size()){
					if(zz[y].front().b<ii-ax){
						zz[y].pop_front();
					}
					else{
						break;
					}
				}
				if(zz[y].size()){
					int xx=zz[y].front().a+z;
					if(dp[ii]==-1){
						dp[ii]=xx;
					}
					dp[ii]=min(dp[ii],xx);
				}
				y++;
				if(y==j){
					y=0;
					z++;
				}
			}

		}

		llo cur2=cur-su2;

		for(llo j=cur2%i;j<=su3 and j<=cur2;j+=i){
			if(dp[j]>=0){
				//if((cur2-j)%i==0){
					llo x=(cur2-j)/i;
					if(x<=it[i]){
						llo y=dp[j]+x;
						y+=ac;
						if(ans==-1){
							ans=y;
						}
						ans=min(ans,y);
					}
				//}
			}
		}

	}
	if(ans==-1){
		cout<<"impossible"<<endl;
	}
	else{
		//cout<<ans<<endl;
		cout<<cot-ans<<endl;
	}

	//else find minimum number of elements with sum su-dd










	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 331 ms 688 KB Output is correct
6 Incorrect 391 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 331 ms 688 KB Output is correct
6 Incorrect 391 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 576 KB Output is correct
5 Correct 8 ms 596 KB Output is correct
6 Correct 31 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 10 ms 552 KB Output is correct
10 Correct 12 ms 468 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 576 KB Output is correct
5 Correct 8 ms 596 KB Output is correct
6 Correct 31 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 10 ms 552 KB Output is correct
10 Correct 12 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 484 KB Output is correct
15 Correct 7 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 22 ms 572 KB Output is correct
18 Correct 10 ms 596 KB Output is correct
19 Correct 33 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 11 ms 548 KB Output is correct
23 Correct 12 ms 468 KB Output is correct
24 Incorrect 21 ms 468 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 576 KB Output is correct
5 Correct 8 ms 596 KB Output is correct
6 Correct 31 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 10 ms 552 KB Output is correct
10 Correct 12 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 25 ms 584 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 31 ms 552 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 11 ms 468 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 19 ms 724 KB Output is correct
24 Correct 6 ms 656 KB Output is correct
25 Correct 37 ms 712 KB Output is correct
26 Correct 288 ms 764 KB Output is correct
27 Correct 460 ms 988 KB Output is correct
28 Correct 154 ms 660 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 331 ms 688 KB Output is correct
6 Incorrect 391 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 576 KB Output is correct
5 Correct 8 ms 596 KB Output is correct
6 Correct 31 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 10 ms 552 KB Output is correct
10 Correct 12 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 25 ms 584 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 31 ms 552 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 11 ms 468 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 19 ms 724 KB Output is correct
24 Correct 6 ms 656 KB Output is correct
25 Correct 37 ms 712 KB Output is correct
26 Correct 288 ms 764 KB Output is correct
27 Correct 460 ms 988 KB Output is correct
28 Correct 154 ms 660 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 7 ms 576 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 23 ms 576 KB Output is correct
33 Correct 8 ms 596 KB Output is correct
34 Correct 31 ms 552 KB Output is correct
35 Correct 1 ms 552 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 11 ms 468 KB Output is correct
38 Correct 13 ms 564 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 5 ms 468 KB Output is correct
41 Correct 18 ms 724 KB Output is correct
42 Correct 6 ms 596 KB Output is correct
43 Correct 37 ms 724 KB Output is correct
44 Correct 297 ms 904 KB Output is correct
45 Correct 452 ms 736 KB Output is correct
46 Correct 154 ms 656 KB Output is correct
47 Correct 28 ms 596 KB Output is correct
48 Correct 28 ms 596 KB Output is correct
49 Correct 148 ms 1924 KB Output is correct
50 Correct 442 ms 1436 KB Output is correct
51 Correct 4342 ms 2056 KB Output is correct
52 Execution timed out 5067 ms 2512 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 331 ms 688 KB Output is correct
6 Incorrect 391 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 23 ms 576 KB Output is correct
5 Correct 8 ms 596 KB Output is correct
6 Correct 31 ms 576 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 10 ms 552 KB Output is correct
10 Correct 12 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 7 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 25 ms 584 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 31 ms 552 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 11 ms 468 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 4 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 19 ms 724 KB Output is correct
24 Correct 6 ms 656 KB Output is correct
25 Correct 37 ms 712 KB Output is correct
26 Correct 288 ms 764 KB Output is correct
27 Correct 460 ms 988 KB Output is correct
28 Correct 154 ms 660 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 7 ms 576 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 23 ms 576 KB Output is correct
33 Correct 8 ms 596 KB Output is correct
34 Correct 31 ms 552 KB Output is correct
35 Correct 1 ms 552 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 11 ms 468 KB Output is correct
38 Correct 13 ms 564 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 5 ms 468 KB Output is correct
41 Correct 18 ms 724 KB Output is correct
42 Correct 6 ms 596 KB Output is correct
43 Correct 37 ms 724 KB Output is correct
44 Correct 297 ms 904 KB Output is correct
45 Correct 452 ms 736 KB Output is correct
46 Correct 154 ms 656 KB Output is correct
47 Correct 28 ms 596 KB Output is correct
48 Correct 28 ms 596 KB Output is correct
49 Correct 148 ms 1924 KB Output is correct
50 Correct 442 ms 1436 KB Output is correct
51 Correct 4342 ms 2056 KB Output is correct
52 Execution timed out 5067 ms 2512 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 331 ms 688 KB Output is correct
6 Incorrect 391 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -