oj.uz

답안 #596514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596514 2022-07-14T19:35:32 Z kshitij_sodani Uplifting Excursion (BOI22_vault) C++14
45 / 100
 5000 ms 45712 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){
			llo y=su3%abs(j-n);
			llo z=su3/abs(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==-1){
					y=abs(j-n)-1;
					z--;

				}
				/*y++;
				if(y==j){
					y=0;
					z++;
				}*/
			}
		}
		else{
			llo y=su5%abs(j-n);
			llo z=su5/abs(j-n);

			for(llo ii=su5;ii<=su3;ii++){
				
				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==abs(j-n)){
					y=0;
					z++;
				}
			}
		}
		//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){
		if(l==n){
			return;
		}
		llo ac=0;
		llo ac2=0;
		if(l>n){
			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;
		llo acc=((abs(cur2)))%(abs(i-n));
		llo ccc=acc-(su5%(abs(i-n)))+abs(i-n);
		ccc%=abs(i-n);
		for(llo j=su5+ccc;j<=su3;j+=abs(i-n)){
			if(i==n){
				continue;
			}
	//	for(llo j=cur2%i;j<=su3 and j<=cur2;j+=i){
			if(dp[j]>=0){

				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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16084 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 9 ms 16084 KB Output is correct
5 Correct 548 ms 19720 KB Output is correct
6 Correct 582 ms 20500 KB Output is correct
7 Correct 251 ms 17740 KB Output is correct
8 Correct 524 ms 19540 KB Output is correct
9 Correct 1014 ms 22524 KB Output is correct
10 Correct 32 ms 16488 KB Output is correct
11 Correct 31 ms 16412 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16084 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 9 ms 16084 KB Output is correct
5 Correct 548 ms 19720 KB Output is correct
6 Correct 582 ms 20500 KB Output is correct
7 Correct 251 ms 17740 KB Output is correct
8 Correct 524 ms 19540 KB Output is correct
9 Correct 1014 ms 22524 KB Output is correct
10 Correct 32 ms 16488 KB Output is correct
11 Correct 31 ms 16412 KB Output is correct
12 Correct 7 ms 16184 KB Output is correct
13 Correct 7 ms 16084 KB Output is correct
14 Correct 7 ms 16084 KB Output is correct
15 Correct 8 ms 16176 KB Output is correct
16 Correct 553 ms 19576 KB Output is correct
17 Correct 556 ms 20496 KB Output is correct
18 Correct 261 ms 17680 KB Output is correct
19 Correct 507 ms 19540 KB Output is correct
20 Correct 1030 ms 22436 KB Output is correct
21 Correct 41 ms 16468 KB Output is correct
22 Correct 32 ms 16392 KB Output is correct
23 Execution timed out 5052 ms 45712 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16076 KB Output is correct
2 Correct 42 ms 16680 KB Output is correct
3 Correct 20 ms 16340 KB Output is correct
4 Correct 51 ms 16772 KB Output is correct
5 Correct 64 ms 16844 KB Output is correct
6 Correct 38 ms 16496 KB Output is correct
7 Correct 12 ms 16212 KB Output is correct
8 Correct 11 ms 16212 KB Output is correct
9 Correct 19 ms 16316 KB Output is correct
10 Correct 29 ms 16468 KB Output is correct

Subtask #3-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16076 KB Output is correct
2 Correct 42 ms 16680 KB Output is correct
3 Correct 20 ms 16340 KB Output is correct
4 Correct 51 ms 16772 KB Output is correct
5 Correct 64 ms 16844 KB Output is correct
6 Correct 38 ms 16496 KB Output is correct
7 Correct 12 ms 16212 KB Output is correct
8 Correct 11 ms 16212 KB Output is correct
9 Correct 19 ms 16316 KB Output is correct
10 Correct 29 ms 16468 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 8 ms 16084 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 8 ms 16188 KB Output is correct
15 Correct 50 ms 16668 KB Output is correct
16 Correct 21 ms 16340 KB Output is correct
17 Correct 48 ms 16744 KB Output is correct
18 Correct 62 ms 16840 KB Output is correct
19 Correct 36 ms 16572 KB Output is correct
20 Correct 13 ms 16212 KB Output is correct
21 Correct 12 ms 16148 KB Output is correct
22 Correct 19 ms 16372 KB Output is correct
23 Correct 31 ms 16468 KB Output is correct
24 Correct 90 ms 17392 KB Output is correct
25 Correct 45 ms 16684 KB Output is correct
26 Correct 120 ms 17492 KB Output is correct
27 Correct 90 ms 17344 KB Output is correct
28 Correct 98 ms 17128 KB Output is correct

Subtask #4-1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16076 KB Output is correct
2 Correct 42 ms 16680 KB Output is correct
3 Correct 20 ms 16340 KB Output is correct
4 Correct 51 ms 16772 KB Output is correct
5 Correct 64 ms 16844 KB Output is correct
6 Correct 38 ms 16496 KB Output is correct
7 Correct 12 ms 16212 KB Output is correct
8 Correct 11 ms 16212 KB Output is correct
9 Correct 19 ms 16316 KB Output is correct
10 Correct 29 ms 16468 KB Output is correct
11 Correct 9 ms 16084 KB Output is correct
12 Correct 44 ms 16660 KB Output is correct
13 Correct 20 ms 16340 KB Output is correct
14 Correct 47 ms 16776 KB Output is correct
15 Correct 71 ms 16836 KB Output is correct
16 Correct 38 ms 16540 KB Output is correct
17 Correct 12 ms 16212 KB Output is correct
18 Correct 15 ms 16248 KB Output is correct
19 Correct 21 ms 16316 KB Output is correct
20 Correct 34 ms 16436 KB Output is correct
21 Correct 32 ms 16488 KB Output is correct
22 Correct 32 ms 16344 KB Output is correct
23 Correct 334 ms 18664 KB Output is correct
24 Correct 220 ms 17700 KB Output is correct
25 Correct 327 ms 18744 KB Output is correct
26 Correct 509 ms 19624 KB Output is correct
27 Correct 379 ms 18908 KB Output is correct
28 Correct 233 ms 17856 KB Output is correct

Subtask #4-2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16084 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 9 ms 16084 KB Output is correct
5 Correct 548 ms 19720 KB Output is correct
6 Correct 582 ms 20500 KB Output is correct
7 Correct 251 ms 17740 KB Output is correct
8 Correct 524 ms 19540 KB Output is correct
9 Correct 1014 ms 22524 KB Output is correct
10 Correct 32 ms 16488 KB Output is correct
11 Correct 31 ms 16412 KB Output is correct
12 Correct 7 ms 16076 KB Output is correct
13 Correct 42 ms 16680 KB Output is correct
14 Correct 20 ms 16340 KB Output is correct
15 Correct 51 ms 16772 KB Output is correct
16 Correct 64 ms 16844 KB Output is correct
17 Correct 38 ms 16496 KB Output is correct
18 Correct 12 ms 16212 KB Output is correct
19 Correct 11 ms 16212 KB Output is correct
20 Correct 19 ms 16316 KB Output is correct
21 Correct 29 ms 16468 KB Output is correct
22 Correct 7 ms 16084 KB Output is correct
23 Correct 8 ms 16084 KB Output is correct
24 Correct 8 ms 16084 KB Output is correct
25 Correct 8 ms 16188 KB Output is correct
26 Correct 50 ms 16668 KB Output is correct
27 Correct 21 ms 16340 KB Output is correct
28 Correct 48 ms 16744 KB Output is correct
29 Correct 62 ms 16840 KB Output is correct
30 Correct 36 ms 16572 KB Output is correct
31 Correct 13 ms 16212 KB Output is correct
32 Correct 12 ms 16148 KB Output is correct
33 Correct 19 ms 16372 KB Output is correct
34 Correct 31 ms 16468 KB Output is correct
35 Correct 90 ms 17392 KB Output is correct
36 Correct 45 ms 16684 KB Output is correct
37 Correct 120 ms 17492 KB Output is correct
38 Correct 90 ms 17344 KB Output is correct
39 Correct 98 ms 17128 KB Output is correct
40 Correct 9 ms 16084 KB Output is correct
41 Correct 44 ms 16660 KB Output is correct
42 Correct 20 ms 16340 KB Output is correct
43 Correct 47 ms 16776 KB Output is correct
44 Correct 71 ms 16836 KB Output is correct
45 Correct 38 ms 16540 KB Output is correct
46 Correct 12 ms 16212 KB Output is correct
47 Correct 15 ms 16248 KB Output is correct
48 Correct 21 ms 16316 KB Output is correct
49 Correct 34 ms 16436 KB Output is correct
50 Correct 32 ms 16488 KB Output is correct
51 Correct 32 ms 16344 KB Output is correct
52 Correct 334 ms 18664 KB Output is correct
53 Correct 220 ms 17700 KB Output is correct
54 Correct 327 ms 18744 KB Output is correct
55 Correct 509 ms 19624 KB Output is correct
56 Correct 379 ms 18908 KB Output is correct
57 Correct 233 ms 17856 KB Output is correct
58 Correct 7 ms 16084 KB Output is correct
59 Correct 9 ms 16084 KB Output is correct
60 Correct 7 ms 16084 KB Output is correct
61 Correct 9 ms 16084 KB Output is correct
62 Correct 557 ms 19580 KB Output is correct
63 Correct 591 ms 20484 KB Output is correct
64 Correct 252 ms 17788 KB Output is correct
65 Correct 551 ms 19656 KB Output is correct
66 Correct 1008 ms 22456 KB Output is correct
67 Correct 39 ms 16480 KB Output is correct
68 Correct 39 ms 16380 KB Output is correct
69 Correct 43 ms 16648 KB Output is correct
70 Correct 20 ms 16408 KB Output is correct
71 Correct 46 ms 16744 KB Output is correct
72 Correct 64 ms 16812 KB Output is correct
73 Correct 39 ms 16504 KB Output is correct
74 Correct 14 ms 16288 KB Output is correct
75 Correct 12 ms 16156 KB Output is correct
76 Correct 18 ms 16324 KB Output is correct
77 Correct 29 ms 16452 KB Output is correct
78 Correct 87 ms 17384 KB Output is correct
79 Correct 45 ms 16676 KB Output is correct
80 Correct 116 ms 17336 KB Output is correct
81 Correct 90 ms 17324 KB Output is correct
82 Correct 107 ms 17168 KB Output is correct
83 Correct 327 ms 18656 KB Output is correct
84 Correct 215 ms 17708 KB Output is correct
85 Correct 359 ms 18724 KB Output is correct
86 Correct 502 ms 19704 KB Output is correct
87 Correct 379 ms 19068 KB Output is correct
88 Correct 232 ms 17800 KB Output is correct
89 Correct 680 ms 21100 KB Output is correct
90 Correct 1045 ms 22604 KB Output is correct
91 Correct 723 ms 21304 KB Output is correct
92 Correct 771 ms 21204 KB Output is correct

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16076 KB Output is correct
2 Correct 42 ms 16680 KB Output is correct
3 Correct 20 ms 16340 KB Output is correct
4 Correct 51 ms 16772 KB Output is correct
5 Correct 64 ms 16844 KB Output is correct
6 Correct 38 ms 16496 KB Output is correct
7 Correct 12 ms 16212 KB Output is correct
8 Correct 11 ms 16212 KB Output is correct
9 Correct 19 ms 16316 KB Output is correct
10 Correct 29 ms 16468 KB Output is correct
11 Correct 9 ms 16084 KB Output is correct
12 Correct 44 ms 16660 KB Output is correct
13 Correct 20 ms 16340 KB Output is correct
14 Correct 47 ms 16776 KB Output is correct
15 Correct 71 ms 16836 KB Output is correct
16 Correct 38 ms 16540 KB Output is correct
17 Correct 12 ms 16212 KB Output is correct
18 Correct 15 ms 16248 KB Output is correct
19 Correct 21 ms 16316 KB Output is correct
20 Correct 34 ms 16436 KB Output is correct
21 Correct 32 ms 16488 KB Output is correct
22 Correct 32 ms 16344 KB Output is correct
23 Correct 334 ms 18664 KB Output is correct
24 Correct 220 ms 17700 KB Output is correct
25 Correct 327 ms 18744 KB Output is correct
26 Correct 509 ms 19624 KB Output is correct
27 Correct 379 ms 18908 KB Output is correct
28 Correct 233 ms 17856 KB Output is correct
29 Correct 7 ms 16084 KB Output is correct
30 Correct 47 ms 16660 KB Output is correct
31 Correct 20 ms 16340 KB Output is correct
32 Correct 47 ms 16740 KB Output is correct
33 Correct 68 ms 16796 KB Output is correct
34 Correct 47 ms 16620 KB Output is correct
35 Correct 12 ms 16212 KB Output is correct
36 Correct 12 ms 16192 KB Output is correct
37 Correct 19 ms 16364 KB Output is correct
38 Correct 29 ms 16500 KB Output is correct
39 Correct 32 ms 16472 KB Output is correct
40 Correct 32 ms 16340 KB Output is correct
41 Correct 339 ms 18664 KB Output is correct
42 Correct 245 ms 17924 KB Output is correct
43 Correct 348 ms 18668 KB Output is correct
44 Correct 560 ms 19620 KB Output is correct
45 Correct 508 ms 18936 KB Output is correct
46 Correct 250 ms 17860 KB Output is correct
47 Correct 315 ms 17516 KB Output is correct
48 Correct 277 ms 17444 KB Output is correct
49 Execution timed out 5027 ms 37980 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16084 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 9 ms 16084 KB Output is correct
5 Correct 548 ms 19720 KB Output is correct
6 Correct 582 ms 20500 KB Output is correct
7 Correct 251 ms 17740 KB Output is correct
8 Correct 524 ms 19540 KB Output is correct
9 Correct 1014 ms 22524 KB Output is correct
10 Correct 32 ms 16488 KB Output is correct
11 Correct 31 ms 16412 KB Output is correct
12 Correct 7 ms 16184 KB Output is correct
13 Correct 7 ms 16084 KB Output is correct
14 Correct 7 ms 16084 KB Output is correct
15 Correct 8 ms 16176 KB Output is correct
16 Correct 553 ms 19576 KB Output is correct
17 Correct 556 ms 20496 KB Output is correct
18 Correct 261 ms 17680 KB Output is correct
19 Correct 507 ms 19540 KB Output is correct
20 Correct 1030 ms 22436 KB Output is correct
21 Correct 41 ms 16468 KB Output is correct
22 Correct 32 ms 16392 KB Output is correct
23 Execution timed out 5052 ms 45712 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16076 KB Output is correct
2 Correct 42 ms 16680 KB Output is correct
3 Correct 20 ms 16340 KB Output is correct
4 Correct 51 ms 16772 KB Output is correct
5 Correct 64 ms 16844 KB Output is correct
6 Correct 38 ms 16496 KB Output is correct
7 Correct 12 ms 16212 KB Output is correct
8 Correct 11 ms 16212 KB Output is correct
9 Correct 19 ms 16316 KB Output is correct
10 Correct 29 ms 16468 KB Output is correct
11 Correct 9 ms 16084 KB Output is correct
12 Correct 44 ms 16660 KB Output is correct
13 Correct 20 ms 16340 KB Output is correct
14 Correct 47 ms 16776 KB Output is correct
15 Correct 71 ms 16836 KB Output is correct
16 Correct 38 ms 16540 KB Output is correct
17 Correct 12 ms 16212 KB Output is correct
18 Correct 15 ms 16248 KB Output is correct
19 Correct 21 ms 16316 KB Output is correct
20 Correct 34 ms 16436 KB Output is correct
21 Correct 32 ms 16488 KB Output is correct
22 Correct 32 ms 16344 KB Output is correct
23 Correct 334 ms 18664 KB Output is correct
24 Correct 220 ms 17700 KB Output is correct
25 Correct 327 ms 18744 KB Output is correct
26 Correct 509 ms 19624 KB Output is correct
27 Correct 379 ms 18908 KB Output is correct
28 Correct 233 ms 17856 KB Output is correct
29 Correct 7 ms 16084 KB Output is correct
30 Correct 47 ms 16660 KB Output is correct
31 Correct 20 ms 16340 KB Output is correct
32 Correct 47 ms 16740 KB Output is correct
33 Correct 68 ms 16796 KB Output is correct
34 Correct 47 ms 16620 KB Output is correct
35 Correct 12 ms 16212 KB Output is correct
36 Correct 12 ms 16192 KB Output is correct
37 Correct 19 ms 16364 KB Output is correct
38 Correct 29 ms 16500 KB Output is correct
39 Correct 32 ms 16472 KB Output is correct
40 Correct 32 ms 16340 KB Output is correct
41 Correct 339 ms 18664 KB Output is correct
42 Correct 245 ms 17924 KB Output is correct
43 Correct 348 ms 18668 KB Output is correct
44 Correct 560 ms 19620 KB Output is correct
45 Correct 508 ms 18936 KB Output is correct
46 Correct 250 ms 17860 KB Output is correct
47 Correct 315 ms 17516 KB Output is correct
48 Correct 277 ms 17444 KB Output is correct
49 Execution timed out 5027 ms 37980 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 7 ms 16084 KB Output is correct
3 Correct 8 ms 16084 KB Output is correct
4 Correct 9 ms 16084 KB Output is correct
5 Correct 548 ms 19720 KB Output is correct
6 Correct 582 ms 20500 KB Output is correct
7 Correct 251 ms 17740 KB Output is correct
8 Correct 524 ms 19540 KB Output is correct
9 Correct 1014 ms 22524 KB Output is correct
10 Correct 32 ms 16488 KB Output is correct
11 Correct 31 ms 16412 KB Output is correct
12 Correct 7 ms 16184 KB Output is correct
13 Correct 7 ms 16084 KB Output is correct
14 Correct 7 ms 16084 KB Output is correct
15 Correct 8 ms 16176 KB Output is correct
16 Correct 553 ms 19576 KB Output is correct
17 Correct 556 ms 20496 KB Output is correct
18 Correct 261 ms 17680 KB Output is correct
19 Correct 507 ms 19540 KB Output is correct
20 Correct 1030 ms 22436 KB Output is correct
21 Correct 41 ms 16468 KB Output is correct
22 Correct 32 ms 16392 KB Output is correct
23 Execution timed out 5052 ms 45712 KB Time limit exceeded
24 Halted 0 ms 0 KB -