oj.uz

Submission #596309

# Submission time Handle Problem Language Result Execution time Memory
596309 2022-07-14T15:06:45 Z kshitij_sodani Uplifting Excursion (BOI22_vault) C++14
20 / 100
 5000 ms 3364 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];
llo dp[1000001];
deque<pair<llo,llo>> zz[301];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>dd;
	llo cot=0;
	for(llo i=0;i<n;i++){
		llo aa;
		cin>>aa;
		cot+=aa;
	}
	llo su=0;
	for(llo i=0;i<=n;i++){
		cin>>it[i];
		su+=it[i]*i;
		cot+=it[i];
	}
	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(llo 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();
			}
			for(int ii=0;ii<=su3;ii++){
				int y=ii%j;
				if(dp[ii]>=0){
					pair<int,int> cur={dp[ii]-(ii/j),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-j*min(it[j],n)){
						zz[y].pop_front();
					}
					else{
						break;
					}
				}
				if(zz[y].size()){
					llo xx=zz[y].front().a+(ii/j) ;
					if(dp[ii]==-1){
						dp[ii]=xx;
					}
					dp[ii]=min(dp[ii],xx);
				}
			}
		/*	for(llo ii=su3;ii>=0;ii--){
				llo co=0;
				for(llo jj=ii;jj>=0 and jj>=ii-j*n;jj-=j){
					if(dp[jj]>=0){
						llo xx=dp[jj]+co;
						if(co>it[j]){
							continue;
						}
						if(dp[ii]==-1){
							dp[ii]=xx;
						}
						dp[ii]=min(dp[ii],xx);
					}
					co++;
				}
			}*/
		}
	/*	for(llo j=i+1;j<=n;j++){
			for(llo ii=su3;ii>=0;ii--){
				llo co=0;
				for(llo jj=ii;jj>=0 and jj>=ii-j*min(it[j],n);jj-=j){
					if(dp[jj]>=0){
						llo xx=dp[jj]+co;

						if(dp[ii]==-1){
							dp[ii]=xx;
						}
						dp[ii]=min(dp[ii],xx);
					}
					co++;
				}
			}
		}*/
		llo cur2=cur-su2;

		for(llo j=0;j<=su3;j++){
			if(cur2>=j and 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 620 ms 928 KB Output is correct
6 Incorrect 673 ms 832 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 620 ms 928 KB Output is correct
6 Incorrect 673 ms 832 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 12 ms 600 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 41 ms 608 KB Output is correct
5 Correct 13 ms 644 KB Output is correct
6 Correct 53 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 18 ms 468 KB Output is correct
10 Correct 21 ms 584 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 12 ms 600 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 41 ms 608 KB Output is correct
5 Correct 13 ms 644 KB Output is correct
6 Correct 53 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 18 ms 468 KB Output is correct
10 Correct 21 ms 584 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 11 ms 596 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 43 ms 596 KB Output is correct
18 Correct 14 ms 652 KB Output is correct
19 Correct 53 ms 596 KB Output is correct
20 Correct 2 ms 464 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 18 ms 468 KB Output is correct
23 Correct 22 ms 468 KB Output is correct
24 Incorrect 35 ms 596 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 12 ms 600 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 41 ms 608 KB Output is correct
5 Correct 13 ms 644 KB Output is correct
6 Correct 53 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 18 ms 468 KB Output is correct
10 Correct 21 ms 584 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 12 ms 604 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 40 ms 604 KB Output is correct
15 Correct 14 ms 596 KB Output is correct
16 Correct 53 ms 596 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 18 ms 468 KB Output is correct
20 Correct 21 ms 572 KB Output is correct
21 Correct 6 ms 580 KB Output is correct
22 Correct 7 ms 580 KB Output is correct
23 Correct 35 ms 852 KB Output is correct
24 Correct 8 ms 768 KB Output is correct
25 Correct 69 ms 1000 KB Output is correct
26 Correct 524 ms 980 KB Output is correct
27 Correct 822 ms 932 KB Output is correct
28 Correct 278 ms 852 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 620 ms 928 KB Output is correct
6 Incorrect 673 ms 832 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 12 ms 600 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 41 ms 608 KB Output is correct
5 Correct 13 ms 644 KB Output is correct
6 Correct 53 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 18 ms 468 KB Output is correct
10 Correct 21 ms 584 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 12 ms 604 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 40 ms 604 KB Output is correct
15 Correct 14 ms 596 KB Output is correct
16 Correct 53 ms 596 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 18 ms 468 KB Output is correct
20 Correct 21 ms 572 KB Output is correct
21 Correct 6 ms 580 KB Output is correct
22 Correct 7 ms 580 KB Output is correct
23 Correct 35 ms 852 KB Output is correct
24 Correct 8 ms 768 KB Output is correct
25 Correct 69 ms 1000 KB Output is correct
26 Correct 524 ms 980 KB Output is correct
27 Correct 822 ms 932 KB Output is correct
28 Correct 278 ms 852 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 11 ms 596 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 40 ms 612 KB Output is correct
33 Correct 15 ms 596 KB Output is correct
34 Correct 60 ms 596 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 18 ms 468 KB Output is correct
38 Correct 22 ms 596 KB Output is correct
39 Correct 7 ms 580 KB Output is correct
40 Correct 7 ms 572 KB Output is correct
41 Correct 31 ms 852 KB Output is correct
42 Correct 8 ms 724 KB Output is correct
43 Correct 68 ms 864 KB Output is correct
44 Correct 540 ms 1116 KB Output is correct
45 Correct 821 ms 1056 KB Output is correct
46 Correct 269 ms 892 KB Output is correct
47 Correct 55 ms 712 KB Output is correct
48 Correct 51 ms 596 KB Output is correct
49 Correct 269 ms 3164 KB Output is correct
50 Correct 779 ms 1940 KB Output is correct
51 Execution timed out 5044 ms 3364 KB Time limit exceeded
52 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 620 ms 928 KB Output is correct
6 Incorrect 673 ms 832 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 12 ms 600 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 41 ms 608 KB Output is correct
5 Correct 13 ms 644 KB Output is correct
6 Correct 53 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 18 ms 468 KB Output is correct
10 Correct 21 ms 584 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 12 ms 604 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 40 ms 604 KB Output is correct
15 Correct 14 ms 596 KB Output is correct
16 Correct 53 ms 596 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 18 ms 468 KB Output is correct
20 Correct 21 ms 572 KB Output is correct
21 Correct 6 ms 580 KB Output is correct
22 Correct 7 ms 580 KB Output is correct
23 Correct 35 ms 852 KB Output is correct
24 Correct 8 ms 768 KB Output is correct
25 Correct 69 ms 1000 KB Output is correct
26 Correct 524 ms 980 KB Output is correct
27 Correct 822 ms 932 KB Output is correct
28 Correct 278 ms 852 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 11 ms 596 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 40 ms 612 KB Output is correct
33 Correct 15 ms 596 KB Output is correct
34 Correct 60 ms 596 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 18 ms 468 KB Output is correct
38 Correct 22 ms 596 KB Output is correct
39 Correct 7 ms 580 KB Output is correct
40 Correct 7 ms 572 KB Output is correct
41 Correct 31 ms 852 KB Output is correct
42 Correct 8 ms 724 KB Output is correct
43 Correct 68 ms 864 KB Output is correct
44 Correct 540 ms 1116 KB Output is correct
45 Correct 821 ms 1056 KB Output is correct
46 Correct 269 ms 892 KB Output is correct
47 Correct 55 ms 712 KB Output is correct
48 Correct 51 ms 596 KB Output is correct
49 Correct 269 ms 3164 KB Output is correct
50 Correct 779 ms 1940 KB Output is correct
51 Execution timed out 5044 ms 3364 KB Time limit exceeded
52 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 620 ms 928 KB Output is correct
6 Incorrect 673 ms 832 KB Output isn't correct
7 Halted 0 ms 0 KB -