oj.uz

답안 #596320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596320 2022-07-14T15:17:56 Z kshitij_sodani Uplifting Excursion (BOI22_vault) C++14
20 / 100
 5000 ms 2416 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 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(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++;
				}
			}
		/*	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=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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Incorrect 467 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Incorrect 467 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 576 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 36 ms 564 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 14 ms 564 KB Output is correct

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 576 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 36 ms 564 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 14 ms 564 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 7 ms 580 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 23 ms 576 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 36 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 12 ms 552 KB Output is correct
23 Correct 12 ms 468 KB Output is correct
24 Incorrect 24 ms 580 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 576 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 36 ms 564 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 14 ms 564 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 8 ms 572 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 24 ms 576 KB Output is correct
15 Correct 8 ms 600 KB Output is correct
16 Correct 32 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 12 ms 552 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 25 ms 596 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 37 ms 716 KB Output is correct
26 Correct 312 ms 788 KB Output is correct
27 Correct 496 ms 736 KB Output is correct
28 Correct 153 ms 716 KB Output is correct

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Incorrect 467 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 576 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 36 ms 564 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 14 ms 564 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 8 ms 572 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 24 ms 576 KB Output is correct
15 Correct 8 ms 600 KB Output is correct
16 Correct 32 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 12 ms 552 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 25 ms 596 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 37 ms 716 KB Output is correct
26 Correct 312 ms 788 KB Output is correct
27 Correct 496 ms 736 KB Output is correct
28 Correct 153 ms 716 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 7 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 27 ms 568 KB Output is correct
33 Correct 8 ms 592 KB Output is correct
34 Correct 44 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 11 ms 468 KB Output is correct
38 Correct 12 ms 560 KB Output is correct
39 Correct 4 ms 564 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 18 ms 724 KB Output is correct
42 Correct 5 ms 596 KB Output is correct
43 Correct 37 ms 720 KB Output is correct
44 Correct 293 ms 784 KB Output is correct
45 Correct 512 ms 748 KB Output is correct
46 Correct 151 ms 652 KB Output is correct
47 Correct 31 ms 632 KB Output is correct
48 Correct 38 ms 628 KB Output is correct
49 Correct 151 ms 1844 KB Output is correct
50 Correct 423 ms 1420 KB Output is correct
51 Correct 4502 ms 2172 KB Output is correct
52 Execution timed out 5056 ms 2416 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Incorrect 467 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 6 ms 576 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 36 ms 564 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 14 ms 564 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 8 ms 572 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 24 ms 576 KB Output is correct
15 Correct 8 ms 600 KB Output is correct
16 Correct 32 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 12 ms 552 KB Output is correct
20 Correct 12 ms 468 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 25 ms 596 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 37 ms 716 KB Output is correct
26 Correct 312 ms 788 KB Output is correct
27 Correct 496 ms 736 KB Output is correct
28 Correct 153 ms 716 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 7 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 27 ms 568 KB Output is correct
33 Correct 8 ms 592 KB Output is correct
34 Correct 44 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 11 ms 468 KB Output is correct
38 Correct 12 ms 560 KB Output is correct
39 Correct 4 ms 564 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 18 ms 724 KB Output is correct
42 Correct 5 ms 596 KB Output is correct
43 Correct 37 ms 720 KB Output is correct
44 Correct 293 ms 784 KB Output is correct
45 Correct 512 ms 748 KB Output is correct
46 Correct 151 ms 652 KB Output is correct
47 Correct 31 ms 632 KB Output is correct
48 Correct 38 ms 628 KB Output is correct
49 Correct 151 ms 1844 KB Output is correct
50 Correct 423 ms 1420 KB Output is correct
51 Correct 4502 ms 2172 KB Output is correct
52 Execution timed out 5056 ms 2416 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 344 ms 684 KB Output is correct
6 Incorrect 467 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -