oj.uz

Submission #596504

# Submission time Handle Problem Language Result Execution time Memory
596504 2022-07-14T19:26:28 Z kshitij_sodani Uplifting Excursion (BOI22_vault) C++14
25 / 100
 5000 ms 45496 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 cc[601];
llo dp[2000001];
deque<pair<llo,llo>> zz[301];
llo ans=-1;
llo su3=0;
llo su5=0;
void apply(int l,int r){

	for(int j=l;j<=r;j++){
		if(j==n){
			continue;
		}
		//cout<<j<<",,"<<endl;
		if(j<n){
			su5-=abs(j-n)*min(cc[j],n);
		}
		else{
			su3+=abs(j-n)*min(cc[j],n);
		}
		//cout<<j<<","<<su5<<endl;
		llo ax=(j-n)*min(cc[j],n);
		//su3=max(su3,su3+ax);
		//su5=min(su5,su3+ax);
		
		//llo su3=n*n*n;
		for(int i=0;i<abs(j-n);i++){
			zz[i].clear();
		}
		if(j<n){
			for(llo ii=su3;ii>=su5;ii--){
				llo y=ii%abs(j-n);
				llo z=ii/abs(j-n);
				if(dp[ii]>=0){
					pair<llo,llo> 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+abs(ax)){
						zz[y].pop_front();
					}
					else{
						break;
					}
				}
				if(zz[y].size()){
					llo 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++;
				}*/
			}
		}
		else{
			//llo y=0;
			//llo z=0;
			for(llo ii=su5;ii<=su3;ii++){
				llo y=ii%abs(j-n);
				llo z=ii/abs(j-n);

				if(dp[ii]>=0){
					
					pair<llo,llo> 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()){
					
					llo xx=zz[y].front().a+z;
					if(dp[ii]==-1){
						dp[ii]=xx;
					}
					dp[ii]=min(dp[ii],xx);
				}
				
			}
		}
		//cout<<j<<",,"<<endl;
	}
}
void remove(int l,int r){
	for(int j=l;j<=r;j++){

		if(j<n){
			su5+=abs(j-n)*min(cc[j],n);
		}
		else if(j>n){
			su3-=abs(j-n)*min(cc[j],n);
		}
	}
}
llo pp;
void solve(int l,int r){
	if(l==r){
	
		llo ac=0;
		llo ac2=0;
		if(l>0){
			for(int j=r+1;j<=2*n;j++){
				ac+=((cc[j]-min(cc[j],n)))*(j-n);
				ac2+=(cc[j]-min(cc[j],n));
			}
			for(int j=0;j<n;j++){
				ac+=((cc[j]-min(cc[j],n)))*(j-n);
				ac2+=(cc[j]-min(cc[j],n));
			}
		}
		else{
			for(int j=0;j<l;j++){
				ac+=((cc[j]-min(cc[j],n)))*(j-n);
				ac2+=(cc[j]-min(cc[j],n));
			}
			for(int j=n+1;j<=2*n;j++){
				ac+=((cc[j]-min(cc[j],n)))*(j-n);
				ac2+=(cc[j]-min(cc[j],n));
			}
		}


		/*if(ac>pp){
			return;
		}*/
		llo cur2=pp-ac;
		int i=l;
	/*	if(r==4){
			cout<<ac<<":"<<pp<<endl;
		}*/
		//cout<<i<<"::"<<l<<endl;
		//cout<<cur2<<",,"<<ac<<","<<pp<<endl;
		//cout<<dp[n*n*n]<<","<<endl;
		for(llo j=su5;j<=su3;j++){
			if(i==n){
				continue;
			}
	//	for(llo j=cur2%i;j<=su3 and j<=cur2;j+=i){
			if(dp[j]>=0){
				/*if(r==4){
					cout<<(j-n*n*n)<<"::"<<endl;
				}*/
				/*if(r==6){
					cout<<(j-n*n*n)<<","<<endl;
				}*/
				//if(l-n==1){
				//cout<<(j-n*n*n)<<":::"<<endl;
				//}
				int ok=1;
				if(i<n){
					ok=-1;
				}
				if(abs(cur2-j)%abs(i-n)==0){
					llo x=abs(cur2-j)/abs(i-n);
					x*=ok;
					if(cur2-j<0){
						x=-x;
					}
					if(x<=cc[i] and x>=0){
						llo y=dp[j]+x;
						y+=ac2;
						if(ans==-1){
							ans=y;
						}
					//	cout<<(j-n*n*n)<<":"<<r<<":"<<pp<<":"<<cur2<<",,"<<x<<endl;
						//cout<<cur2-j<<",,,"<<(i-n)<<",,"<<cc[4]<<endl;
						ans=min(ans,y);
					}
				}
			}
		}
		/*ac=0;
		ac2=0;
		for(int j=0;j<l;j++){
			ac+=((cc[j]-min(cc[j],n)))*(j-n);
			ac2+=(cc[j]-min(cc[j],n));
		}
		cur2=pp-ac;
		for(llo j=su5;j<=su3;j++){
			if(i==n){
				continue;
			}
	//	for(llo j=cur2%i;j<=su3 and j<=cur2;j+=i){
			if(dp[j]>=0){
				//if(l-n==1){
				//cout<<(j-n*n*n)<<":::"<<endl;
				//}
				int ok=1;
				if(i<n){
					ok=-1;
				}
				if(abs(cur2-j)%abs(i-n)==0){
					llo x=(cur2-j)/abs(i-n);
					x*=ok;
					if(cur2-j<0){
						x=-x;
					}
					if(x<=cc[i] and x>=0){
						llo y=dp[j]+x;
						y+=ac2;
						if(ans==-1){
							ans=y;
						}
						ans=min(ans,y);
					}
				}
			}
		}*/

	}
	else{
		int mid=(l+r)/2;
		vector<llo> dp2;

		for(int ii=su5;ii<=su3;ii++){
			dp2.pb(dp[ii]);
		}
		pair<llo,llo> cur={su5,su3};
		apply(l,mid);
		solve(mid+1,r);
		
		for(int ii=su5;ii<=su3;ii++){
			dp[ii]=-1;
		}
		for(int ii=cur.a;ii<=cur.b;ii++){
			dp[ii]=dp2[ii-cur.a];
		}

		remove(l,mid);
		dp2.clear();
		for(int ii=su5;ii<=su3;ii++){
			dp2.pb(dp[ii]);
		}
		cur={su5,su3};

		apply(mid+1,r);
		solve(l,mid);
		
		for(int ii=su5;ii<=su3;ii++){
			dp[ii]=-1;
		}
		for(int ii=cur.a;ii<=cur.b;ii++){
			dp[ii]=dp2[ii-cur.a];
		}
		remove(mid+1,r);
	}



}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>dd;

	llo cot=0;
	llo ma=0;
	llo acc=0;
	llo su=0;
	for(llo i=0;i<n;i++){
		llo aa;
		cin>>aa;
		su+=aa*(i-n);
		cot+=aa;
		cc[i]=aa;
		acc+=aa;
	}
	
	for(llo i=0;i<=n;i++){
		cin>>it[i];
		su+=it[i]*i;
		cot+=it[i];
		cc[n+i]=it[i];
	}
	for(llo i=0;i<=2*n;i++){
		ma=max(ma,cc[i]);
	}
	for(int i=1;i<=n;i++){

	}
	//cout<<cc[4]<<":"<<endl;
	//su3=0;
/*	if(su<dd){
		cout<<"impossible"<<endl;
		return 0;
	}*/
	llo cur=su-dd;
	pp=cur;
	pp+=n*n*n;
	su3+=n*n*n;
	su5+=n*n*n;
	it[0]=0;
		for(int i=0;i<=2e6;i++){
			dp[i]=-1;
		}
		dp[(n*n*n)]=0;
	solve(0,2*n);
	/*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(llo jj=0;jj<j;jj++){
				zz[jj].clear();
			}
			llo ax=j*min(it[j],n);
			llo y=0;
			llo z=0;
			for(llo ii=0;ii<=su3;ii++){
			//	llo y=ii%j;
				if(dp[ii]>=0){
					pair<llo,llo> 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()){
					llo 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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 8 ms 16160 KB Output is correct
5 Correct 733 ms 19544 KB Output is correct
6 Correct 756 ms 20624 KB Output is correct
7 Correct 314 ms 17840 KB Output is correct
8 Correct 665 ms 19656 KB Output is correct
9 Correct 1363 ms 22424 KB Output is correct
10 Correct 49 ms 16480 KB Output is correct
11 Correct 57 ms 16360 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 8 ms 16160 KB Output is correct
5 Correct 733 ms 19544 KB Output is correct
6 Correct 756 ms 20624 KB Output is correct
7 Correct 314 ms 17840 KB Output is correct
8 Correct 665 ms 19656 KB Output is correct
9 Correct 1363 ms 22424 KB Output is correct
10 Correct 49 ms 16480 KB Output is correct
11 Correct 57 ms 16360 KB Output is correct
12 Correct 9 ms 16084 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 9 ms 16152 KB Output is correct
15 Correct 6 ms 16084 KB Output is correct
16 Correct 785 ms 19828 KB Output is correct
17 Correct 787 ms 20452 KB Output is correct
18 Correct 318 ms 17696 KB Output is correct
19 Correct 699 ms 19552 KB Output is correct
20 Correct 1416 ms 22536 KB Output is correct
21 Correct 43 ms 16472 KB Output is correct
22 Correct 42 ms 16372 KB Output is correct
23 Execution timed out 5063 ms 45496 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16176 KB Output is correct
2 Correct 57 ms 16652 KB Output is correct
3 Correct 25 ms 16352 KB Output is correct
4 Correct 60 ms 16732 KB Output is correct
5 Correct 80 ms 16800 KB Output is correct
6 Correct 48 ms 16552 KB Output is correct
7 Correct 18 ms 16172 KB Output is correct
8 Correct 13 ms 16224 KB Output is correct
9 Correct 22 ms 16328 KB Output is correct
10 Correct 39 ms 16468 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16176 KB Output is correct
2 Correct 57 ms 16652 KB Output is correct
3 Correct 25 ms 16352 KB Output is correct
4 Correct 60 ms 16732 KB Output is correct
5 Correct 80 ms 16800 KB Output is correct
6 Correct 48 ms 16552 KB Output is correct
7 Correct 18 ms 16172 KB Output is correct
8 Correct 13 ms 16224 KB Output is correct
9 Correct 22 ms 16328 KB Output is correct
10 Correct 39 ms 16468 KB Output is correct
11 Correct 9 ms 16100 KB Output is correct
12 Correct 8 ms 16176 KB Output is correct
13 Correct 7 ms 16084 KB Output is correct
14 Correct 9 ms 16084 KB Output is correct
15 Correct 62 ms 16636 KB Output is correct
16 Correct 30 ms 16360 KB Output is correct
17 Correct 61 ms 16736 KB Output is correct
18 Correct 82 ms 16840 KB Output is correct
19 Correct 57 ms 16512 KB Output is correct
20 Correct 15 ms 16264 KB Output is correct
21 Correct 13 ms 16212 KB Output is correct
22 Correct 25 ms 16340 KB Output is correct
23 Correct 41 ms 16476 KB Output is correct
24 Incorrect 118 ms 17360 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 7 ms 16176 KB Output is correct
2 Correct 57 ms 16652 KB Output is correct
3 Correct 25 ms 16352 KB Output is correct
4 Correct 60 ms 16732 KB Output is correct
5 Correct 80 ms 16800 KB Output is correct
6 Correct 48 ms 16552 KB Output is correct
7 Correct 18 ms 16172 KB Output is correct
8 Correct 13 ms 16224 KB Output is correct
9 Correct 22 ms 16328 KB Output is correct
10 Correct 39 ms 16468 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 58 ms 16644 KB Output is correct
13 Correct 30 ms 16340 KB Output is correct
14 Correct 64 ms 16756 KB Output is correct
15 Correct 87 ms 16840 KB Output is correct
16 Correct 48 ms 16608 KB Output is correct
17 Correct 16 ms 16212 KB Output is correct
18 Correct 12 ms 16264 KB Output is correct
19 Correct 28 ms 16364 KB Output is correct
20 Correct 41 ms 16496 KB Output is correct
21 Correct 44 ms 16480 KB Output is correct
22 Correct 41 ms 16340 KB Output is correct
23 Correct 479 ms 18660 KB Output is correct
24 Correct 310 ms 17676 KB Output is correct
25 Correct 520 ms 18680 KB Output is correct
26 Correct 692 ms 19636 KB Output is correct
27 Correct 501 ms 18976 KB Output is correct
28 Correct 314 ms 17808 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 8 ms 16160 KB Output is correct
5 Correct 733 ms 19544 KB Output is correct
6 Correct 756 ms 20624 KB Output is correct
7 Correct 314 ms 17840 KB Output is correct
8 Correct 665 ms 19656 KB Output is correct
9 Correct 1363 ms 22424 KB Output is correct
10 Correct 49 ms 16480 KB Output is correct
11 Correct 57 ms 16360 KB Output is correct
12 Correct 7 ms 16176 KB Output is correct
13 Correct 57 ms 16652 KB Output is correct
14 Correct 25 ms 16352 KB Output is correct
15 Correct 60 ms 16732 KB Output is correct
16 Correct 80 ms 16800 KB Output is correct
17 Correct 48 ms 16552 KB Output is correct
18 Correct 18 ms 16172 KB Output is correct
19 Correct 13 ms 16224 KB Output is correct
20 Correct 22 ms 16328 KB Output is correct
21 Correct 39 ms 16468 KB Output is correct
22 Correct 9 ms 16100 KB Output is correct
23 Correct 8 ms 16176 KB Output is correct
24 Correct 7 ms 16084 KB Output is correct
25 Correct 9 ms 16084 KB Output is correct
26 Correct 62 ms 16636 KB Output is correct
27 Correct 30 ms 16360 KB Output is correct
28 Correct 61 ms 16736 KB Output is correct
29 Correct 82 ms 16840 KB Output is correct
30 Correct 57 ms 16512 KB Output is correct
31 Correct 15 ms 16264 KB Output is correct
32 Correct 13 ms 16212 KB Output is correct
33 Correct 25 ms 16340 KB Output is correct
34 Correct 41 ms 16476 KB Output is correct
35 Incorrect 118 ms 17360 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16176 KB Output is correct
2 Correct 57 ms 16652 KB Output is correct
3 Correct 25 ms 16352 KB Output is correct
4 Correct 60 ms 16732 KB Output is correct
5 Correct 80 ms 16800 KB Output is correct
6 Correct 48 ms 16552 KB Output is correct
7 Correct 18 ms 16172 KB Output is correct
8 Correct 13 ms 16224 KB Output is correct
9 Correct 22 ms 16328 KB Output is correct
10 Correct 39 ms 16468 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 58 ms 16644 KB Output is correct
13 Correct 30 ms 16340 KB Output is correct
14 Correct 64 ms 16756 KB Output is correct
15 Correct 87 ms 16840 KB Output is correct
16 Correct 48 ms 16608 KB Output is correct
17 Correct 16 ms 16212 KB Output is correct
18 Correct 12 ms 16264 KB Output is correct
19 Correct 28 ms 16364 KB Output is correct
20 Correct 41 ms 16496 KB Output is correct
21 Correct 44 ms 16480 KB Output is correct
22 Correct 41 ms 16340 KB Output is correct
23 Correct 479 ms 18660 KB Output is correct
24 Correct 310 ms 17676 KB Output is correct
25 Correct 520 ms 18680 KB Output is correct
26 Correct 692 ms 19636 KB Output is correct
27 Correct 501 ms 18976 KB Output is correct
28 Correct 314 ms 17808 KB Output is correct
29 Correct 7 ms 16084 KB Output is correct
30 Correct 64 ms 16672 KB Output is correct
31 Correct 30 ms 16340 KB Output is correct
32 Correct 70 ms 16724 KB Output is correct
33 Correct 80 ms 16832 KB Output is correct
34 Correct 48 ms 16648 KB Output is correct
35 Correct 14 ms 16212 KB Output is correct
36 Correct 12 ms 16252 KB Output is correct
37 Correct 27 ms 16340 KB Output is correct
38 Correct 46 ms 16480 KB Output is correct
39 Correct 41 ms 16444 KB Output is correct
40 Correct 40 ms 16388 KB Output is correct
41 Correct 448 ms 18656 KB Output is correct
42 Correct 294 ms 17696 KB Output is correct
43 Correct 453 ms 18668 KB Output is correct
44 Correct 681 ms 19824 KB Output is correct
45 Correct 516 ms 18928 KB Output is correct
46 Correct 303 ms 17812 KB Output is correct
47 Correct 372 ms 17632 KB Output is correct
48 Correct 340 ms 17512 KB Output is correct
49 Execution timed out 5062 ms 37928 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 8 ms 16160 KB Output is correct
5 Correct 733 ms 19544 KB Output is correct
6 Correct 756 ms 20624 KB Output is correct
7 Correct 314 ms 17840 KB Output is correct
8 Correct 665 ms 19656 KB Output is correct
9 Correct 1363 ms 22424 KB Output is correct
10 Correct 49 ms 16480 KB Output is correct
11 Correct 57 ms 16360 KB Output is correct
12 Correct 9 ms 16084 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 9 ms 16152 KB Output is correct
15 Correct 6 ms 16084 KB Output is correct
16 Correct 785 ms 19828 KB Output is correct
17 Correct 787 ms 20452 KB Output is correct
18 Correct 318 ms 17696 KB Output is correct
19 Correct 699 ms 19552 KB Output is correct
20 Correct 1416 ms 22536 KB Output is correct
21 Correct 43 ms 16472 KB Output is correct
22 Correct 42 ms 16372 KB Output is correct
23 Execution timed out 5063 ms 45496 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16176 KB Output is correct
2 Correct 57 ms 16652 KB Output is correct
3 Correct 25 ms 16352 KB Output is correct
4 Correct 60 ms 16732 KB Output is correct
5 Correct 80 ms 16800 KB Output is correct
6 Correct 48 ms 16552 KB Output is correct
7 Correct 18 ms 16172 KB Output is correct
8 Correct 13 ms 16224 KB Output is correct
9 Correct 22 ms 16328 KB Output is correct
10 Correct 39 ms 16468 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 58 ms 16644 KB Output is correct
13 Correct 30 ms 16340 KB Output is correct
14 Correct 64 ms 16756 KB Output is correct
15 Correct 87 ms 16840 KB Output is correct
16 Correct 48 ms 16608 KB Output is correct
17 Correct 16 ms 16212 KB Output is correct
18 Correct 12 ms 16264 KB Output is correct
19 Correct 28 ms 16364 KB Output is correct
20 Correct 41 ms 16496 KB Output is correct
21 Correct 44 ms 16480 KB Output is correct
22 Correct 41 ms 16340 KB Output is correct
23 Correct 479 ms 18660 KB Output is correct
24 Correct 310 ms 17676 KB Output is correct
25 Correct 520 ms 18680 KB Output is correct
26 Correct 692 ms 19636 KB Output is correct
27 Correct 501 ms 18976 KB Output is correct
28 Correct 314 ms 17808 KB Output is correct
29 Correct 7 ms 16084 KB Output is correct
30 Correct 64 ms 16672 KB Output is correct
31 Correct 30 ms 16340 KB Output is correct
32 Correct 70 ms 16724 KB Output is correct
33 Correct 80 ms 16832 KB Output is correct
34 Correct 48 ms 16648 KB Output is correct
35 Correct 14 ms 16212 KB Output is correct
36 Correct 12 ms 16252 KB Output is correct
37 Correct 27 ms 16340 KB Output is correct
38 Correct 46 ms 16480 KB Output is correct
39 Correct 41 ms 16444 KB Output is correct
40 Correct 40 ms 16388 KB Output is correct
41 Correct 448 ms 18656 KB Output is correct
42 Correct 294 ms 17696 KB Output is correct
43 Correct 453 ms 18668 KB Output is correct
44 Correct 681 ms 19824 KB Output is correct
45 Correct 516 ms 18928 KB Output is correct
46 Correct 303 ms 17812 KB Output is correct
47 Correct 372 ms 17632 KB Output is correct
48 Correct 340 ms 17512 KB Output is correct
49 Execution timed out 5062 ms 37928 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 8 ms 16160 KB Output is correct
5 Correct 733 ms 19544 KB Output is correct
6 Correct 756 ms 20624 KB Output is correct
7 Correct 314 ms 17840 KB Output is correct
8 Correct 665 ms 19656 KB Output is correct
9 Correct 1363 ms 22424 KB Output is correct
10 Correct 49 ms 16480 KB Output is correct
11 Correct 57 ms 16360 KB Output is correct
12 Correct 9 ms 16084 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 9 ms 16152 KB Output is correct
15 Correct 6 ms 16084 KB Output is correct
16 Correct 785 ms 19828 KB Output is correct
17 Correct 787 ms 20452 KB Output is correct
18 Correct 318 ms 17696 KB Output is correct
19 Correct 699 ms 19552 KB Output is correct
20 Correct 1416 ms 22536 KB Output is correct
21 Correct 43 ms 16472 KB Output is correct
22 Correct 42 ms 16372 KB Output is correct
23 Execution timed out 5063 ms 45496 KB Time limit exceeded
24 Halted 0 ms 0 KB -