QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#117077#6667. Prosjekxtqqwq#16 186ms27368kbC++1410.6kb2023-06-30 12:50:292024-05-31 18:40:56

Judging History

你现在查看的是最新测评结果

  • [2024-05-31 18:40:56]
  • 评测
  • 测评结果：16
  • 用时：186ms
  • 内存：27368kb
查看
  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-30 12:50:29]
  • 提交

answer

#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,cnt;
ll a[2000005];
bool vis[2000005];
vector<ll> b[20][10005];
vector<pll> c[4],ans;

pll merge(pll x,pll y){
	ll res=(x.fi+y.fi)/2;
	ans.pb(mp(x.fi,y.fi));
	vis[x.se]=vis[y.se]=1;
	a[++cnt]=res;
	return mp(res,cnt);
}

void init(){
	ans.clear();
	for(int i=1;i<=n+n;i++) vis[i]=0;
	for(int i=0;i<4;i++) b[2][i].clear();
	for(int i=0;i<4;i++) c[i].clear();
	cnt=n;
}

bool solve1(){
	init();
	for(int i=1;i<=n;i++) b[2][a[i]%4].pb(a[i]);
	if(!b[2][0].size()&&!b[2][2].size()){
		for(int i=1;i<n;i++){
			if(b[2][1].size()>=2){
				ll x=b[2][1].back(); b[2][1].pop_back();
				ll y=b[2][1].back(); b[2][1].pop_back();
				printf("%lld %lld\n",x,y);
				b[2][(x+y)/2%4].pb((x+y)/2);
			}
			else if(b[2][3].size()>=2){
				ll x=b[2][3].back(); b[2][3].pop_back();
				ll y=b[2][3].back(); b[2][3].pop_back();
				printf("%lld %lld\n",x,y);
				b[2][(x+y)/2%4].pb((x+y)/2);
			}
			else printf("%lld %lld\n",b[2][1][0],b[2][3][0]);
		}
		return true;
	}
	if(!b[2][0].size()||!b[2][2].size()){
		int lst=b[2][0].size()?0:2;
		vector<pll> vec;
		for(int i=1;i<=n;i++) if(a[i]&1) vec.pb(mp(a[i],i));
		if(!vec.size()) goto here;
		for(int i=2;i<=60;i++){
			vector<pll> tmp[2];
			for(auto r:vec){
				if(vis[r.se]) continue;
				tmp[(r.fi>>(i-1))&1].pb(r);
			}
			if(tmp[0].size()&&tmp[1].size()){
				if(i>2){
					vec.pb(merge(tmp[0][0],tmp[1][0]));
					i-=2;
				}
				else{
					while(1){
						if(tmp[0].size()>=2){
							pll x1=tmp[0].back(); tmp[0].pop_back();
							pll x2=tmp[0].back(); tmp[0].pop_back();
							pll y=tmp[1].back(); tmp[1].pop_back();
							if((x1.fi+y.fi)/2%4!=lst){
								merge(x1,y);
								break;
							}
							else if((x2.fi+y.fi)/2%4!=lst){
								merge(x2,y);
								break;
							}
							else{
								tmp[1].pb(y);
								tmp[0].pb(merge(x1,x2));
							}
						}
						else if(tmp[1].size()>=2){
							pll x1=tmp[1].back(); tmp[1].pop_back();
							pll x2=tmp[1].back(); tmp[1].pop_back();
							pll y=tmp[0].back(); tmp[0].pop_back();
							if((x1.fi+y.fi)/2%4!=lst){
								merge(x1,y);
								break;
							}
							else if((x2.fi+y.fi)/2%4!=lst){
								merge(x2,y);
								break;
							}
							else{
								tmp[0].pb(y);
								tmp[1].pb(merge(x1,x2));
							}
						}
						else{
							merge(tmp[0][0],tmp[1][0]);
							break;
						}
					}
					break;
				}
			}
			if(i==60) return false;
		}
	}
	here:
	// cout<<"test ";
	// for(int i=1;i<=cnt;i++) if(!vis[i]) cout<<a[i]<<' ';
	// cout<<endl;
	int rt=0;
	for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==1) rt=i;
	if(rt){
		for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==1) c[a[i]%4].pb(mp(a[i],i));
		while(1){
			if(c[1].size()+c[3].size()<=1) break;
			if(c[1].size()>=2){
				pll x=c[1].back(); c[1].pop_back();
				pll y=c[1].back(); c[1].pop_back();
				c[(x.fi+y.fi)/2%4].pb(merge(x,y));
			}
			else if(c[3].size()>=2){
				pll x=c[3].back(); c[3].pop_back();
				pll y=c[3].back(); c[3].pop_back();
				c[(x.fi+y.fi)/2%4].pb(merge(x,y));
			}
			else{
				merge(c[1][0],c[3][0]);
				break;
			}
		}
	}
	rt=0;
	for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==1) rt=i;
	if(rt){
		for(int i=0;i<4;i++) c[i].clear();
		for(int i=1;i<=cnt;i++){
			if(vis[i]) continue;
			c[a[i]%4].pb(mp(a[i],i));
		}
		int lst=c[1].size()?1:3;
		pll fin=mp(0,0),ed=mp(0,0);
		while(1){
			if(c[0].size()>=2){
				pll x1=c[0].back(); c[0].pop_back();
				pll x2=c[0].back(); c[0].pop_back();
				pll y=c[2].back(); c[2].pop_back();
				if((x1.fi+y.fi)/2%4!=lst){
					fin=merge(x1,y);
					break;
				}
				else if((x2.fi+y.fi)/2%4!=lst){
					fin=merge(x2,y);
					break;
				}
				else{
					c[2].pb(y);
					c[0].pb(merge(x1,x2));
				}
			}
			else if(c[2].size()>=2){
				pll x1=c[2].back(); c[2].pop_back();
				pll x2=c[2].back(); c[2].pop_back();
				pll y=c[0].back(); c[0].pop_back();
				if((x1.fi+y.fi)/2%4!=lst){
					fin=merge(x1,y);
					break;
				}
				else if((x2.fi+y.fi)/2%4!=lst){
					fin=merge(x2,y);
					break;
				}
				else{
					c[0].pb(y);
					c[2].pb(merge(x1,x2));
				}
			}
			else{
				ed=merge(c[0][0],c[2][0]);
				break;
			}
		}
		if(fin.se){
			if(c[1].size()) merge(c[1][0],fin);
			else merge(c[3][0],fin);
		}
		else{
			if(c[1].size()) merge(c[1][0],ed);
			else merge(c[3][0],ed);
		}
	}
	b[2][0].clear(),b[2][2].clear();
	for(int i=1;i<=cnt;i++){
		if(vis[i]) continue;
		b[2][a[i]%4].pb(a[i]);
	}
	// cout<<"test ";
	// for(int i=1;i<=cnt;i++) if(!vis[i]) cout<<a[i]<<' ';
	// cout<<endl;
	for(auto r:ans) printf("%lld %lld\n",r.fi,r.se);
	while(1){
		if(b[2][0].size()+b[2][2].size()==1) break;
		if(b[2][0].size()>=2){
			ll x=b[2][0].back(); b[2][0].pop_back();
			ll y=b[2][0].back(); b[2][0].pop_back();
			printf("%lld %lld\n",x,y);
			b[2][(x+y)/2%4].pb((x+y)/2);
		}
		else if(b[2][2].size()>=2){
			ll x=b[2][2].back(); b[2][2].pop_back();
			ll y=b[2][2].back(); b[2][2].pop_back();
			printf("%lld %lld\n",x,y);
			b[2][(x+y)/2%4].pb((x+y)/2);
		}
		else{
			printf("%lld %lld\n",b[2][0][0],b[2][2][0]);
			break;
		}
	}
	return true;
}

bool solve2(){
	init();
	for(int i=1;i<=n;i++) b[2][a[i]%4].pb(a[i]);
	if(!b[2][1].size()&&!b[2][3].size()){
		for(int i=1;i<n;i++){
			if(b[2][0].size()>=2){
				ll x=b[2][0].back(); b[2][0].pop_back();
				ll y=b[2][0].back(); b[2][0].pop_back();
				printf("%lld %lld\n",x,y);
				b[2][(x+y)/2%4].pb((x+y)/2);
			}
			else if(b[2][2].size()>=2){
				ll x=b[2][2].back(); b[2][2].pop_back();
				ll y=b[2][2].back(); b[2][2].pop_back();
				printf("%lld %lld\n",x,y);
				b[2][(x+y)/2%4].pb((x+y)/2);
			}
			else printf("%lld %lld\n",b[2][0][0],b[2][2][0]);
		}
		return true;
	}
	if(!b[2][1].size()||!b[2][3].size()){
		int lst=b[2][1].size()?1:3;
		vector<pll> vec;
		for(int i=1;i<=n;i++) if(a[i]%2==0) vec.pb(mp(a[i],i));
		if(!vec.size()) goto here2;
		for(int i=2;i<=60;i++){
			vector<pll> tmp[2];
			for(auto r:vec){
				if(vis[r.se]) continue;
				tmp[(r.fi>>(i-1))&1].pb(r);
			}
			if(tmp[0].size()&&tmp[1].size()){
				if(i>2){
					vec.pb(merge(tmp[0][0],tmp[1][0]));
					i-=2;
				}
				else{
					while(1){
						if(tmp[0].size()>=2){
							pll x1=tmp[0].back(); tmp[0].pop_back();
							pll x2=tmp[0].back(); tmp[0].pop_back();
							pll y=tmp[1].back(); tmp[1].pop_back();
							if((x1.fi+y.fi)/2%4!=lst){
								merge(x1,y);
								break;
							}
							else if((x2.fi+y.fi)/2%4!=lst){
								merge(x2,y);
								break;
							}
							else{
								tmp[1].pb(y);
								tmp[0].pb(merge(x1,x2));
							}
						}
						else if(tmp[1].size()>=2){
							pll x1=tmp[1].back(); tmp[1].pop_back();
							pll x2=tmp[1].back(); tmp[1].pop_back();
							pll y=tmp[0].back(); tmp[0].pop_back();
							if((x1.fi+y.fi)/2%4!=lst){
								merge(x1,y);
								break;
							}
							else if((x2.fi+y.fi)/2%4!=lst){
								merge(x2,y);
								break;
							}
							else{
								tmp[0].pb(y);
								tmp[1].pb(merge(x1,x2));
							}
						}
						else{
							merge(tmp[0][0],tmp[1][0]);
							break;
						}
					}
					break;
				}
			}
			if(i==60) return false;
		}
	}
	here2:
	// cout<<"test ";
	// for(int i=1;i<=cnt;i++) if(!vis[i]) cout<<a[i]<<' ';
	// cout<<endl;
	int rt=0;
	for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==0) rt=i;
	if(rt){
		for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==0) c[a[i]%4].pb(mp(a[i],i));
		while(1){
			if(c[0].size()+c[2].size()<=1) break;
			if(c[0].size()>=2){
				pll x=c[0].back(); c[0].pop_back();
				pll y=c[0].back(); c[0].pop_back();
				c[(x.fi+y.fi)/2%4].pb(merge(x,y));
			}
			else if(c[2].size()>=2){
				pll x=c[2].back(); c[2].pop_back();
				pll y=c[2].back(); c[2].pop_back();
				c[(x.fi+y.fi)/2%4].pb(merge(x,y));
			}
			else{
				merge(c[0][0],c[2][0]);
				break;
			}
		}
	}
	rt=0;
	for(int i=1;i<=cnt;i++) if(!vis[i]&&a[i]%2==0) rt=i;
	if(rt){
		for(int i=0;i<4;i++) c[i].clear();
		for(int i=1;i<=cnt;i++){
			if(vis[i]) continue;
			c[a[i]%4].pb(mp(a[i],i));
		}
		int lst=c[0].size()?0:2;
		pll fin=mp(0,0),ed=mp(0,0);
		while(1){
			if(c[1].size()>=2){
				pll x1=c[1].back(); c[1].pop_back();
				pll x2=c[1].back(); c[1].pop_back();
				pll y=c[3].back(); c[3].pop_back();
				if((x1.fi+y.fi)/2%4!=lst){
					fin=merge(x1,y);
					break;
				}
				else if((x2.fi+y.fi)/2%4!=lst){
					fin=merge(x2,y);
					break;
				}
				else{
					c[3].pb(y);
					c[1].pb(merge(x1,x2));
				}
			}
			else if(c[3].size()>=2){
				pll x1=c[3].back(); c[3].pop_back();
				pll x2=c[3].back(); c[3].pop_back();
				pll y=c[1].back(); c[1].pop_back();
				if((x1.fi+y.fi)/2%4!=lst){
					fin=merge(x1,y);
					break;
				}
				else if((x2.fi+y.fi)/2%4!=lst){
					fin=merge(x2,y);
					break;
				}
				else{
					c[1].pb(y);
					c[3].pb(merge(x1,x2));
				}
			}
			else{
				ed=merge(c[1][0],c[3][0]);
				break;
			}
		}
		if(fin.se){
			if(c[0].size()) merge(c[0][0],fin);
			else merge(c[2][0],fin);
		}
		else{
			if(c[0].size()) merge(c[0][0],ed);
			else merge(c[2][0],ed);
		}
	}
	b[2][1].clear(),b[2][3].clear();
	for(int i=1;i<=cnt;i++){
		if(vis[i]) continue;
		b[2][a[i]%4].pb(a[i]);
	}
	// cout<<"test ";
	// for(int i=1;i<=cnt;i++) if(!vis[i]) cout<<a[i]<<' ';
	// cout<<endl;
	for(auto r:ans) printf("%lld %lld\n",r.fi,r.se);
	while(1){
		if(b[2][1].size()+b[2][3].size()==1) break;
		if(b[2][1].size()>=2){
			ll x=b[2][1].back(); b[2][1].pop_back();
			ll y=b[2][1].back(); b[2][1].pop_back();
			printf("%lld %lld\n",x,y);
			b[2][(x+y)/2%4].pb((x+y)/2);
		}
		else if(b[2][3].size()>=2){
			ll x=b[2][3].back(); b[2][3].pop_back();
			ll y=b[2][3].back(); b[2][3].pop_back();
			printf("%lld %lld\n",x,y);
			b[2][(x+y)/2%4].pb((x+y)/2);
		}
		else{
			printf("%lld %lld\n",b[2][1][0],b[2][3][0]);
			break;
		}
	}
	return true;
}

int main(){
	int T=readint();
	while(T--){
		n=readint();
		for(int i=1;i<=n;i++) a[i]=readint();
		if(!solve1()){
			if(!solve2()) printf("-1\n");
		}
	}
	return 0;
}
源文件, 语言: C++14

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 3ms
memory: 12416kb

input:

99
4
739880851158065302 19206582949872932 883064254701115295 222072661880779376
7
148399819461615003 209088712310207988 53191076581680214 445068618251612752 230505279594622109 115754892157516718 804173775829453588
2
77979357045500669 41693388829622019
3
341612949433488278 609808714829036935 19994167...

output:

19206582949872932 739880851158065302
883064254701115295 379543717053969117
222072661880779376 631303985877542206
230505279594622109 148399819461615003
189452549528118556 804173775829453588
496813162678786072 445068618251612752
470940890465199412 209088712310207988
115754892157516718 5319107658168021...

result:

wrong answer there's no 199941674506573816 in the current set (test case 5)

Subtask #2:

score: 0
Wrong Answer

Test #16:

score: 0
Wrong Answer
time: 2ms
memory: 10576kb

input:

100
3
3 3 2
3
4 1 1
4
1 3 4 4
6
4 4 2 3 1 2
4
0 2 1 4
3
0 2 0
7
3 3 1 1 3 4 0
2
0 4
4
1 4 2 3
7
4 0 0 3 2 3 4
4
4 2 0 3
7
0 2 2 1 4 2 4
7
3 0 3 1 2 0 3
4
4 3 1 4
6
2 3 0 1 3 4
5
1 4 0 3 4
5
4 2 0 4 2
3
0 1 2
6
4 1 4 2 0 4
7
4 2 4 3 1 3 1
4
1 4 4 0
2
1 1
6
0 3 3 0 0 4
7
4 3 0 3 3 3 4
4
4 1 1 3
6
2 0 ...

output:

-1
-1
1 3
4 4
4 2
1 3
4 4
2 2
2 2
4 2
4 2
1 3
0 2
0 0
0 2
1 3
3 3
1 3
0 4
2 2
2 2
4 0
1 3
2 2
4 2
3 3
0 2
3 1
4 0
2 2
4 2
0 2
3 1
4 2
4 2
1 3
4 0
2 2
2 2
2 2
3 3
3 3
1 3
0 0
2 2
0 2
1 3
4 4
4 2
3 3
1 3
4 0
2 2
2 2
1 3
4 0
2 2
4 2
4 0
2 2
2 2
4 2
0 2
1 1
0 2
4 2
1 3
0 4
2 2
4 2
1 1
3 3
1 3
4 4
2 2
4 ...

result:

wrong answer there's no 2 in the current set (test case 19)

Subtask #3:

score: 16
Accepted

Test #34:

score: 16
Accepted
time: 84ms
memory: 11236kb

input:

100000
5
846784256447769304 457696478728961702 128469521648960690 597630796847754190 104256763714529164
5
658897822238868978 472135077337628566 399538027669313322 622703684108675696 425723088635325654
5
917704960887390986 140817562615382054 877934664521057998 782212806618666818 616380973421914538
8
...

output:

104256763714529164 846784256447769304
475520510081149234 597630796847754190
128469521648960690 457696478728961702
293083000188961196 536575653464451712
425723088635325654 399538027669313322
412630558152319488 622703684108675696
472135077337628566 658897822238868978
565516449788248772 517667121130497...

result:

ok correct (100000 test cases)

Test #35:

score: 0
Accepted
time: 91ms
memory: 11772kb

input:

100000
4
132941437397264810 143141501854884272 958712444844113692 341497234016264540
7
923004266892618172 15365813785503270 930609521602302292 819335542601433618 213670074288711286 150311691204302148 244405681344585926
5
371893080714371800 575829750571342010 292988012239447120 115093373296591180 268...

output:

341497234016264540 958712444844113692
650104839430189116 143141501854884272
396623170642536694 132941437397264810
150311691204302148 930609521602302292
540460606403302220 923004266892618172
244405681344585926 213670074288711286
229037877816648606 819335542601433618
524186710209041112 731732436647960...

result:

ok correct (100000 test cases)

Test #36:

score: 0
Accepted
time: 92ms
memory: 12160kb

input:

100000
4
928198344825292264 690070772109811286 244045206839989604 561025252182682906
3
627239866615848210 42470017740412280 54251562555326842
3
490057757292451598 818062735467254804 348318035919019310
2
551686081736618768 194488231774246450
3
112852023970360962 332810104058707034 451110399052627062
...

output:

244045206839989604 928198344825292264
586121775832640934 561025252182682906
573573514007661920 690070772109811286
54251562555326842 627239866615848210
42470017740412280 340745714585587526
348318035919019310 490057757292451598
818062735467254804 419187896605735454
551686081736618768 19448823177424645...

result:

ok correct (100000 test cases)

Test #37:

score: 0
Accepted
time: 138ms
memory: 11572kb

input:

50000
15
970453612553526824 403854393807928174 722892131244078370 35115189723455662 375191889860000444 915405723947874872 635574780184696680 264400470199418708 859039596531178468 27938184881043946 553805664139227226 876314307095280030 571028682295683456 30435765695090076 81051167961127742
20
7987413...

output:

30435765695090076 571028682295683456
859039596531178468 264400470199418708
561720033365298588 635574780184696680
915405723947874872 375191889860000444
645298806903937658 598647406774997634
621973106839467646 300732223995386766
461352665417427206 81051167961127742
271201916689277474 87631430709528003...

result:

ok correct (50000 test cases)

Test #38:

score: 0
Accepted
time: 122ms
memory: 11472kb

input:

50000
20
998788559176849620 191593882411529926 342711646561735406 56435783243285828 213144199738872896 552932543009462260 862655508602678778 197769932466201968 649107231900330578 606332158266321414 679519095246181928 69228654018660218 907522706303602556 706594708190768848 317996892998797510 98299001...

output:

280145788708142508 801974222113409124
541060005410775816 982990013470682716
706594708190768848 907522706303602556
679519095246181928 197769932466201968
438644513856191948 552932543009462260
495788528432827104 213144199738872896
354466364085850000 56435783243285828
205451073664567914 8070587072471857...

result:

ok correct (50000 test cases)

Test #39:

score: 0
Accepted
time: 119ms
memory: 12068kb

input:

50000
19
687533614023914694 738663892302361454 628044408557611320 475365328934162610 242048409095362442 254414508714647088 415287407545536222 333427085181162020 691789987581261114 501496830456417768 370865072857248388 610878478005084624 460491699469405256 995621599317911412 72184531803437802 5221300...

output:

435000735991149736 522130070969414520
478565403480282128 995621599317911412
460491699469405256 610878478005084624
535685088737244940 370865072857248388
453275080797246664 501496830456417768
477385955626832216 333427085181162020
254414508714647088 628044408557611320
405406520403997118 737093501399096...

result:

ok correct (50000 test cases)

Test #40:

score: 0
Accepted
time: 130ms
memory: 12004kb

input:

30000
25
701453932981408346 465306500019836282 792774089369512740 928134668660137906 489548012753296822 563069662510759842 456553328586506700 752651620972947846 610563120623014800 946872198162810216 382124190056540228 528408240467204940 156080508230960224 755279683495886594 353003950140523154 726814...

output:

759546580482469476 671093790812801428
715320185647635452 264865148139811024
331430792491044112 156080508230960224
243755650361002168 528408240467204940
382124190056540228 946872198162810216
610563120623014800 456553328586506700
533558224604760750 664498194109675222
599028209357217986 386081945414103...

result:

ok correct (30000 test cases)

Test #41:

score: 0
Accepted
time: 127ms
memory: 11140kb

input:

30000
24
802553849623129746 211707666543464912 78106851365388652 41150834245659428 824295231323480318 65220471583082028 504011063830422278 582465764474213950 653316240753155704 254391730000013712 73470169815090336 70058062306145696 320805890715812130 762434076887201766 107191591092647094 66623182252...

output:

317895789993303868 476075710640293640
713862378171374300 684143755784659968
66623182252282192 70058062306145696
68340622279213944 73470169815090336
70905396047152140 254391730000013712
653316240753155704 65220471583082028
41150834245659428 78106851365388652
59628842805524040 211707666543464912
35926...

result:

ok correct (30000 test cases)

Test #42:

score: 0
Accepted
time: 146ms
memory: 10556kb

input:

30000
27
457692759396051910 105542225399435134 28952855744712754 551775949854678384 243201017518706110 830727952675976422 770508119165800012 202072001288194376 842102259870000526 184524967708115324 636362069740656520 654459612358466674 183209892432401444 100513548134942846 72707763558771580 42597951...

output:

932151312699294980 80157746650466448
935240383379985812 154087971015879464
968793307366073360 938142428437837892
88106760930326920 425979517791387492
72707763558771580 183209892432401444
127958827995586512 636362069740656520
382160448868121516 184524967708115324
283342708288118420 202072001288194376...

result:

ok correct (30000 test cases)

Test #43:

score: 0
Accepted
time: 186ms
memory: 18648kb

input:

100
365633
240280625535601202 938026129049958522 147115906397155306 652580989323075650 725975096118295602 205776298062652394 601103849421971138 331987681752388762 840580362429635958 835259996207496842 119358021292888398 319502650126227206 963133797479057582 879470558738716974 741484002023142690 3370...

output:

780781389890772134 462546456847920258
983273217073289170 54703858887732306
518988537980510738 121007210812414874
319997874396462806 542567485305147330
431282679850805068 621663923369346196
699873189331273774 290960058824475954
495416624077874864 526473301610075632
376100996009174838 9002308395152315...

result:

ok correct (100 test cases)

Test #44:

score: 0
Accepted
time: 167ms
memory: 18072kb

input:

100
468798
784219641558971418 868193736931466770 709669653094040434 820342537947112058 551143489403660526 267279653811163658 370522601251248390 368960240455457934 377406818992348662 446571520515917398 203417725700526758 781465163407686018 793863659816666930 689102809204233742 460833182899194594 8845...

output:

812530407663751406 882679806250695874
810693562577937022 8779693935145434
409736628256541228 847605106957223640
628670867606882434 965388653482500574
170815080687607818 69534330454674702
120174705571141260 797029760544691504
458602233057916382 237228791906436414
347915512482176398 101818031440929414...

result:

ok correct (100 test cases)

Test #45:

score: 0
Accepted
time: 167ms
memory: 17780kb

input:

100
335003
576606818757903242 39138102231712338 101565358810296722 500967049719563958 60093483316193590 435418544638688670 883896893287765898 482015906798694930 208166390296394766 603169642587608970 697598340090102702 37116072285605102 692409274069565602 359039270687175358 598214522887322026 9588135...

output:

486076417769142294 37999509308599778
262037963538871036 494765326766777336
378401645152824186 747053273988117554
562727459570470870 660483425940083014
611605442755276942 898547649727091586
492361107982889110 112077483133802110
302219295558345610 400296715320192834
351258005439269222 3446980493602438...

result:

ok correct (100 test cases)

Subtask #4:

score: 0
Wrong Answer

Test #46:

score: 0
Wrong Answer
time: 171ms
memory: 27368kb

input:

100
211957
911918942087402387 344230223346742784 16289402153237664 528890583619159010 886281719684850237 865484734102017297 321851390502278959 754268375474197153 237414161302130571 135637002716682378 824412491959977735 162505521049217610 246319278060116103 666703181591704279 650875500699154233 96397...

output:

591082823267833997 750673279799819289
749387671911821385 187498294172452641
468442983042137013 879124196035748105
426735945178329817 352902446225784261
214601964646700029 915796992992417549
565199478819558789 698044824174526233
707988272077429753 702915390242122313
705451831159776033 602615437195119...

result:

wrong answer there's no 348317479223856240 in the current set (test case 46)
English 繁體中文 简体中文

服务器时间: 2024-12-12 02:04:49 | 开源项目