QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#560044#8220. 众生之门ccccccyd23 37ms25752kbC++142.0kb2024-09-12 11:38:122024-09-12 11:38:12

Judging History

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

  • [2024-09-12 11:38:12]
  • 评测
  • 测评结果：23
  • 用时：37ms
  • 内存：25752kb
查看
  • [2024-09-12 11:38:12]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ph push_back
#define rep(i,l,r) for(int i(l),i##end(r);i<=i##end;++i)
#define per(i,r,l) for(int i(r),i##end(l);i>=i##end;--i)
using namespace std;
mt19937 rnd(19937);
const int N=4e5+20; const ll inf=1e18;
int n,de[N],tn,id[N],f[N<<1][17],g[N<<1][17],lg[N<<1],p[N],ans[N]; vector<int> e[N];
void dfs(int u,int fr){
	de[u]=de[fr]+1;
	id[u]=++tn,f[tn][0]=g[tn][0]=u;
	for(int v:e[u]) if(v!=fr){
		dfs(v,u),++tn,f[tn][0]=g[tn][0]=u;
	}
}
int cmp(int i,int j){
	return de[i]<de[j]?i:j;
}
int dis(int x,int y){
	x=id[x],y=id[y]; if(x>y) swap(x,y);
//	printf("%d %d %d   %d %d  %d\n",x,f[x][0],f[x][lg[y-x+1]],y,f[y][0],g[y][lg[y-x+1]]);
	return de[f[x][0]]+de[f[y][0]]-2*de[cmp(f[x][lg[y-x+1]],g[y][lg[y-x+1]])];
}
void solve(){
	rep(i,1,n) e[i].clear();
	int s,t; 
	scanf("%d%d%d",&n,&s,&t);
	rep(i,2,n) {
		int u,v;
		scanf("%d%d",&u,&v);
		e[u].ph(v),e[v].ph(u);
	}
	tn=0,dfs(1,0);
//	rep(i,1,tn) printf("%d ",f[i][0]); puts("");
	rep(i,2,tn) lg[i]=lg[i>>1]+1;
	//tn=2n <= 1e5 < 2^17
	rep(j,1,16) rep(i,1,tn) {
		if(i+(1<<j-1)<=tn) f[i][j]=cmp(f[i+(1<<j-1)][j-1],f[i][j-1]);//<=tn!!!
		if(i-(1<<j-1)>=1) g[i][j]=cmp(g[i-(1<<j-1)][j-1],g[i][j-1]);
	}
//	rep(i,1,n) rep(j,i+1,n) printf("%d %d  %d\n",i,j,dis(i,j));
	int cur=1; p[1]=s,p[n]=t;
	rep(i,1,n) if(i!=s&&i!=t) p[++cur]=i; 
	
	int kw,w=0;
	rep(i,2,n) w^=dis(p[i-1],p[i]);
	kw=w; rep(i,1,n) ans[i]=p[i];
	
	if(n<=3) return ;
	
	rep(T,1,50*n){
		//[2,n-1]
		int x=rnd()%(n-2)+2,y=rnd()%(n-3)+2;
		if(y==x) y++;
		w^=dis(p[x-1],p[x])^dis(p[x],p[x+1])^dis(p[y-1],p[y])^dis(p[y],p[y+1]);
		swap(p[x],p[y]);
		w^=dis(p[x-1],p[x])^dis(p[x],p[x+1])^dis(p[y-1],p[y])^dis(p[y],p[y+1]);
		
		if(w<kw){
			kw=w; rep(i,1,n) ans[i]=p[i];
		}
	}
	cerr<<kw<<'\n';
}
signed main(){
	int T; scanf("%d",&T);
	while(T--){
		solve();
		rep(i,1,n) printf("%d ",ans[i]); puts("");
//		rep(i,2,n) printf("%d\n",dis(ans[i-1],ans[i])); puts("\n");
	}
	return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 5
Accepted

Test #1:

score: 5
Accepted
time: 3ms
memory: 23328kb

input:

114
6 5 6
2 6
1 6
4 5
3 1
6 4
6 3 6
2 4
4 1
6 4
1 5
5 3
6 6 1
5 2
1 2
4 6
2 4
3 2
6 6 1
3 6
5 3
1 6
4 2
2 5
6 3 1
5 3
2 4
1 5
4 3
6 3
4 3 4
2 3
1 4
4 3
6 3 1
2 3
6 3
4 3
1 6
5 1
5 3 2
1 2
4 2
2 3
5 2
6 1 4
2 1
5 2
4 1
6 2
3 6
6 5 1
4 2
6 5
1 3
2 6
3 2
4 4 1
2 4
3 4
1 4
6 2 5
3 5
4 6
1 4
6 2
5 4
6 1 ...

output:

5 1 2 3 4 6 
3 1 2 4 5 6 
6 2 3 4 5 1 
6 2 5 4 3 1 
3 2 4 5 6 1 
3 1 2 4 
3 6 2 5 4 1 
3 1 4 5 2 
1 2 3 5 6 4 
5 2 3 4 6 1 
4 2 3 1 
2 1 3 4 6 5 
1 6 5 2 4 3 
3 4 5 2 6 1 
2 5 1 3 6 4 
3 1 2 5 6 4 
5 1 6 4 2 3 
1 3 4 2 5 
4 1 3 2 
3 1 2 5 4 
1 3 2 4 
3 4 1 2 
5 1 3 4 2 
5 2 4 3 1 
5 4 2 1 6 3 
4 5 2...

result:

ok Answer correct!

Test #2:

score: 5
Accepted
time: 3ms
memory: 20492kb

input:

157
7 3 7
1 3
4 5
6 5
2 5
5 1
7 2
7 7 6
5 6
3 6
2 6
6 7
1 7
4 3
7 6 1
7 4
4 6
2 3
1 2
3 6
5 1
6 1 5
2 5
6 2
5 1
3 2
4 2
5 3 1
1 3
5 3
2 5
4 5
7 4 2
1 5
2 6
6 3
5 4
7 5
3 1
7 1 5
6 1
2 6
5 1
7 6
3 1
4 6
7 5 7
6 5
4 7
7 6
2 3
3 7
1 4
7 6 7
4 7
5 4
7 1
3 6
2 1
1 3
6 5 1
2 4
6 5
4 6
3 2
1 5
7 1 5
2 6
6 ...

output:

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

result:

ok Answer correct!

Test #3:

score: 5
Accepted
time: 7ms
memory: 20768kb

input:

136
8 2 1
3 4
6 1
1 8
7 8
4 8
5 8
8 2
7 5 4
2 4
4 5
3 6
7 5
6 1
1 5
8 7 1
5 6
6 8
8 7
2 3
4 3
1 8
3 1
6 2 3
1 5
5 3
6 5
4 5
3 2
7 5 3
6 1
1 4
4 7
2 3
3 6
7 5
8 7 2
2 3
6 2
1 7
4 1
5 4
8 4
3 8
8 7 3
6 7
5 4
4 7
8 1
3 8
1 5
2 7
7 5 2
3 4
7 3
6 4
1 5
2 5
4 2
7 2 3
3 5
1 5
5 2
7 2
4 2
6 1
8 3 7
2 8
7 8
...

output:

2 3 4 5 6 7 8 1 
5 6 7 3 2 1 4 
7 2 3 4 5 6 8 1 
2 5 4 1 6 3 
5 1 2 4 6 7 3 
7 1 4 6 5 3 8 2 
7 6 1 4 5 2 8 3 
5 3 7 6 4 1 2 
2 4 1 6 5 7 3 
3 5 6 8 2 1 4 7 
3 7 4 5 1 6 8 2 
4 2 5 8 7 3 6 1 
1 6 4 5 2 3 
8 1 3 5 6 2 7 4 
6 2 3 4 5 7 1 
6 2 3 4 5 7 1 
5 6 7 4 1 2 8 3 
1 2 3 4 5 6 
1 2 4 5 3 
2 4 1 7...

result:

ok Answer correct!

Test #4:

score: 5
Accepted
time: 3ms
memory: 20796kb

input:

204
7 6 7
1 6
2 5
7 1
2 3
5 1
4 6
2 2 1
1 2
2 1 2
2 1
4 3 4
1 2
2 3
2 4
2 2 1
2 1
3 2 1
3 1
1 2
8 4 3
5 2
5 4
1 3
8 7
1 5
6 8
5 7
3 2 3
2 3
2 1
6 3 5
1 6
4 5
1 2
3 2
2 5
8 2 1
7 6
3 5
8 6
8 4
3 4
7 2
1 3
7 5 6
3 7
4 1
6 2
5 3
7 1
7 6
3 2 1
3 1
1 2
8 3 2
4 3
2 5
2 4
1 8
1 6
1 2
5 7
4 1 2
4 3
4 2
1 4
...

output:

6 3 1 5 2 4 7 
2 1 
1 2 
3 1 2 4 
2 1 
2 3 1 
4 1 7 5 6 2 8 3 
2 1 3 
3 4 1 2 6 5 
2 4 3 5 6 7 8 1 
5 7 4 3 2 1 6 
2 3 1 
3 5 4 1 6 7 8 2 
1 3 4 2 
2 1 
4 1 5 3 2 7 6 
2 3 1 4 5 
2 1 4 3 
4 1 2 6 8 7 5 3 
6 4 1 3 2 5 7 8 
3 1 2 
6 1 2 3 5 4 
2 1 
6 1 3 4 5 7 2 
2 1 
3 1 2 
2 3 1 
2 1 
5 2 6 1 8 4 7 ...

result:

ok Answer correct!

Test #5:

score: 5
Accepted
time: 3ms
memory: 23604kb

input:

204
6 4 6
5 1
4 1
2 4
5 6
3 5
7 7 1
3 2
2 6
7 5
1 2
3 4
5 4
7 2 1
5 6
7 3
3 2
1 3
5 1
4 5
8 3 7
5 8
1 2
8 7
8 1
5 3
6 8
5 4
8 6 1
2 4
6 3
7 4
4 6
8 1
1 7
6 5
3 3 2
3 2
1 2
8 8 5
5 8
2 3
2 6
4 3
7 2
3 1
8 3
4 4 3
4 3
2 1
3 2
8 6 1
3 4
4 7
4 6
8 2
8 1
6 1
6 5
7 4 7
3 1
4 6
5 2
6 7
2 4
1 4
7 2 1
1 7
4 ...

output:

4 3 1 2 5 6 
7 2 3 6 5 4 1 
2 5 4 7 6 3 1 
3 4 6 1 2 5 8 7 
6 2 3 4 5 7 8 1 
3 1 2 
8 6 4 2 3 7 1 5 
4 2 1 3 
6 4 2 3 8 7 5 1 
4 2 5 1 3 6 7 
2 3 4 5 6 7 1 
1 3 2 
8 6 5 1 4 3 2 7 
1 3 2 
3 2 4 5 1 
2 3 1 
5 1 4 6 7 2 3 
2 1 
2 4 3 1 5 
3 2 1 4 5 6 
4 6 2 7 3 1 5 8 
2 3 1 
2 1 3 
7 1 3 4 5 8 6 2 
3 ...

result:

ok Answer correct!

Subtask #2:

score: 8
Accepted

Dependency #1:

100%
Accepted

Test #6:

score: 8
Accepted
time: 3ms
memory: 24460kb

input:

87
12 3 7
8 6
12 11
9 10
2 9
5 6
4 9
7 3
11 4
10 7
6 11
1 6
12 5 8
12 9
8 5
7 5
9 5
4 9
10 9
6 8
2 7
11 2
1 2
3 5
12 7 4
8 10
4 6
2 6
9 7
12 9
11 5
1 7
6 12
5 12
3 11
10 2
12 2 5
11 12
10 7
1 9
8 3
7 1
6 9
12 9
4 6
5 7
9 2
3 12
12 10 7
6 4
4 9
5 11
9 10
11 4
1 4
7 4
2 11
12 9
8 10
3 4
12 12 2
8 1
7 ...

output:

3 1 2 4 5 6 8 9 10 11 12 7 
5 1 7 3 4 6 2 9 10 11 12 8 
7 1 5 3 6 8 2 9 10 11 12 4 
2 1 4 3 6 7 8 9 10 11 12 5 
10 11 3 9 1 8 5 2 4 6 12 7 
12 7 3 1 6 5 4 8 9 10 11 2 
5 3 2 1 4 6 9 8 7 11 10 
2 1 4 7 8 6 11 3 9 5 12 10 
9 1 11 4 6 3 8 7 10 2 5 
5 7 2 11 1 8 12 9 6 3 10 4 
8 1 3 4 5 6 7 9 10 11 2 
1...

result:

ok Answer correct!

Test #7:

score: 8
Accepted
time: 3ms
memory: 20964kb

input:

87
9 2 6
6 2
1 6
9 2
5 9
7 5
8 5
3 5
4 6
12 9 12
3 12
12 2
10 9
8 11
1 2
11 1
5 9
7 5
2 9
4 10
6 9
12 12 11
7 11
9 10
5 6
11 12
8 11
3 10
10 11
6 1
2 10
4 5
1 2
12 6 8
8 6
3 1
2 4
7 9
11 8
1 6
9 8
5 11
4 11
12 11
10 4
11 4 2
10 6
7 2
3 4
1 2
8 9
11 4
6 4
5 6
9 10
2 10
12 5 3
2 9
1 4
12 11
7 2
11 6
3...

output:

2 8 3 1 5 4 7 9 6 
9 8 2 3 5 4 7 11 1 10 6 12 
12 1 7 10 4 8 6 2 5 9 3 11 
6 1 9 3 4 5 7 2 10 12 11 8 
4 1 3 10 6 7 8 9 5 11 2 
5 2 4 1 6 8 7 9 10 11 12 3 
2 1 3 4 5 6 7 8 9 10 11 
7 1 2 3 4 5 12 8 10 11 6 9 
9 1 2 3 4 5 6 7 8 10 11 12 
3 11 5 4 7 6 2 10 1 9 8 
3 6 7 9 10 8 5 1 2 4 
6 1 12 5 4 3 10 ...

result:

ok Answer correct!

Test #8:

score: 8
Accepted
time: 7ms
memory: 20972kb

input:

86
10 8 5
4 6
9 6
7 5
10 6
3 2
1 4
6 5
5 2
2 8
12 1 5
5 9
11 1
7 5
10 1
12 10
8 11
6 3
9 3
2 11
3 12
4 11
12 7 2
4 5
11 8
3 7
8 7
10 4
6 4
5 8
9 4
1 4
2 7
12 4
11 1 3
8 11
11 1
10 9
7 8
9 7
6 11
2 10
3 10
5 6
4 10
12 12 3
7 12
10 1
8 6
4 8
2 12
6 10
9 12
3 5
1 2
11 12
5 11
12 4 11
7 10
1 12
8 4
5 3
...

output:

8 1 9 10 3 2 4 6 7 5 
1 7 11 4 9 10 8 3 2 6 12 5 
7 1 3 4 5 6 8 9 10 11 12 2 
1 2 4 8 6 7 5 9 10 11 3 
12 1 2 8 5 6 7 4 9 10 11 3 
4 1 2 7 5 10 3 8 9 6 12 11 
2 1 5 4 7 6 8 9 10 11 3 
12 1 2 7 5 3 10 6 9 8 11 4 
8 2 1 3 5 4 7 9 11 10 6 
2 1 10 4 6 11 3 8 7 5 9 
4 8 2 3 6 7 9 1 10 11 12 5 
9 1 2 3 4 ...

result:

ok Answer correct!

Test #9:

score: 8
Accepted
time: 3ms
memory: 24088kb

input:

148
8 2 7
6 3
4 2
1 5
7 3
5 4
6 1
4 8
4 3 2
4 3
2 3
1 2
3 2 1
3 1
2 1
6 2 1
5 1
6 3
6 1
4 2
2 3
12 12 6
10 11
5 7
4 5
9 10
3 7
9 3
2 3
8 6
9 6
3 1
12 10
2 2 1
2 1
2 1 2
1 2
3 2 1
3 2
1 2
9 1 5
8 6
4 3
7 8
1 6
5 7
9 8
3 7
2 4
12 1 9
8 1
7 6
11 4
11 5
12 10
4 6
3 7
1 10
8 3
2 5
5 9
3 1 2
1 3
1 2
8 7 3...

output:

2 6 8 1 5 3 4 7 
3 1 4 2 
2 3 1 
2 4 3 6 5 1 
12 1 2 3 4 5 7 8 9 10 11 6 
2 1 
1 2 
2 3 1 
1 2 3 4 6 7 8 9 5 
1 8 3 4 5 6 11 2 10 7 12 9 
1 3 2 
7 1 2 4 5 6 8 3 
4 1 3 5 2 
5 4 2 8 1 7 3 6 
2 1 3 4 5 6 8 9 10 11 12 7 
3 2 1 
5 1 2 3 4 6 7 8 9 10 12 11 
3 2 5 4 7 6 1 
2 1 3 4 6 5 
6 2 4 3 5 1 
3 1 2 ...

result:

ok Answer correct!

Test #10:

score: 8
Accepted
time: 3ms
memory: 20844kb

input:

135
7 2 1
1 2
6 2
5 3
2 3
4 2
7 6
12 9 5
7 4
4 12
3 6
11 10
1 9
8 7
12 3
5 11
9 8
5 4
10 2
9 7 3
2 5
9 3
2 9
1 6
7 3
9 8
8 1
6 4
2 2 1
1 2
12 8 7
4 8
5 1
5 2
6 10
2 11
12 10
3 5
5 10
7 11
9 12
8 5
2 2 1
1 2
11 7 3
3 10
2 3
11 7
6 4
10 6
11 2
3 1
6 9
5 4
3 8
5 2 5
1 5
3 1
3 2
4 5
4 2 3
2 1
2 3
4 2
11...

output:

2 3 4 5 6 7 1 
9 12 2 10 11 7 8 4 6 1 3 5 
7 4 1 2 5 6 8 9 3 
2 1 
8 9 5 1 10 3 4 11 6 2 12 7 
2 1 
7 5 11 2 10 1 8 6 9 4 3 
2 1 3 4 5 
2 1 4 3 
5 7 2 3 1 8 4 6 9 10 11 
6 1 2 4 5 3 
10 1 2 3 5 4 6 7 8 11 9 
2 8 5 7 3 6 4 1 9 11 10 
11 1 3 4 5 6 7 8 9 10 2 
1 2 3 4 5 
5 4 3 1 2 
4 1 2 3 5 7 6 
3 1 2...

result:

ok Answer correct!

Subtask #3:

score: 0
Time Limit Exceeded

Test #11:

score: 0
Time Limit Exceeded

input:

14190
43 27 2
42 3
30 36
11 24
21 22
13 8
22 30
31 29
35 1
10 6
2 23
28 17
2 26
7 37
5 19
38 43
33 39
4 28
33 7
25 31
15 1
32 18
34 27
35 12
19 32
20 17
37 42
26 34
39 10
12 27
24 43
18 6
16 9
38 9
14 15
14 41
25 3
40 13
16 8
36 41
20 5
21 40
11 29
41 24 38
21 6
20 14
26 1
6 7
17 16
39 36
8 18
36 11...

output:

27 12 22 16 23 6 4 10 36 26 14 35 34 31 3 18 9 24 1 32 41 13 11 21 8 43 28 39 15 25 40 33 5 7 30 29 38 19 37 42 20 17 2 
24 1 2 33 31 26 14 25 8 5 10 11 9 41 37 7 16 29 13 35 27 21 3 32 17 23 20 18 6 30 4 19 22 34 12 36 15 39 40 28 38 
5 1 2 3 4 6 8 23 9 10 11 24 13 14 15 16 17 18 19 20 21 7 12 25 2...

result:

Subtask #4:

score: 0
Time Limit Exceeded

Test #18:

score: 0
Time Limit Exceeded

input:

32752
15 3 4
14 12
4 12
1 10
9 13
7 6
12 5
1 12
9 15
7 9
8 12
2 6
11 6
9 3
6 10
13 12 2
10 11
10 5
1 4
12 11
4 6
2 13
6 5
9 6
8 13
6 3
4 8
13 7
15 3 6
15 10
4 2
8 5
10 3
1 3
15 2
8 4
12 9
7 8
11 8
6 13
8 12
14 8
6 12
15 5 7
8 14
10 13
11 13
13 5
2 14
15 8
15 1
6 2
7 15
9 13
15 3
6 13
15 4
12 5
15 10...

output:

3 1 2 5 6 7 8 9 10 11 12 13 14 15 4 
12 5 3 4 1 6 7 8 9 10 11 13 2 
3 1 2 4 5 7 8 9 10 11 12 13 14 15 6 
5 1 2 3 4 6 10 9 8 11 12 13 14 15 7 
10 1 2 3 4 5 6 7 9 12 11 13 14 15 8 
11 1 10 4 5 7 9 2 6 8 3 
11 1 2 3 4 5 6 7 8 10 12 13 14 15 9 
14 10 2 7 13 3 9 11 4 6 8 1 5 12 
5 1 2 7 6 4 8 9 10 11 3 
...

result:

Subtask #5:

score: 0
Time Limit Exceeded

Test #25:

score: 0
Time Limit Exceeded

input:

36059
13 9 4
5 9
10 3
3 1
13 5
12 5
7 4
2 8
8 10
4 9
11 7
6 11
1 4
13 12 6
4 12
13 9
11 2
6 12
9 12
8 5
7 6
5 3
3 7
10 8
1 5
2 10
13 10 8
3 1
5 9
4 8
6 11
7 13
13 5
1 10
12 13
9 4
11 9
2 11
8 10
12 1 4
9 2
2 12
3 2
12 11
8 2
7 4
5 1
4 1
11 7
10 9
6 9
13 10 12
7 5
11 9
12 10
9 8
3 10
8 5
4 13
13 7
6 ...

output:

9 11 2 1 7 6 8 10 5 12 3 13 4 
12 2 11 8 1 7 4 9 10 3 13 5 6 
10 2 9 7 6 11 3 1 5 4 12 13 8 
1 5 3 8 6 9 12 2 10 7 11 4 
10 1 2 3 7 5 6 9 11 4 13 8 12 
6 1 5 10 7 3 4 9 2 11 12 13 8 
1 2 3 4 5 6 7 9 10 11 12 13 8 
7 2 4 10 9 6 5 1 8 3 
11 7 12 9 8 10 13 4 2 3 6 5 1 
4 1 2 3 5 7 8 9 10 11 12 13 6 
6 ...

result:

Subtask #6:

score: 10
Accepted

Test #34:

score: 10
Accepted
time: 34ms
memory: 24244kb

input:

10
1000 165 244
175 661
738 362
280 462
776 922
231 578
963 615
639 836
32 418
519 220
565 733
239 951
768 847
196 200
246 119
591 288
994 586
313 46
971 515
512 811
228 908
627 339
33 337
447 488
616 319
399 727
921 615
421 509
167 354
905 382
20 356
875 414
619 904
824 940
435 244
953 663
719 962
...

output:

165 367 2 3 4 5 69 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 901 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 900 54 55 56 57 58 59 60 61 62 63 64 65 955 67 68 6 70 71 72 73 74 75 76 77 78 79 513 81 82 970 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 1...

result:

ok Answer correct!

Test #35:

score: 10
Accepted
time: 34ms
memory: 25752kb

input:

10
1000 382 266
590 318
797 98
35 830
950 354
905 784
998 709
853 583
165 498
288 727
822 759
576 543
193 715
883 839
847 872
255 61
995 187
125 742
575 697
621 939
711 248
445 683
848 907
171 215
511 807
196 453
166 930
231 716
327 96
866 680
909 549
188 554
33 273
486 74
32 577
37 573
376 148
709 ...

output:

382 366 2 3 4 5 69 7 8 9 457 11 12 13 14 936 16 17 18 19 20 21 233 23 24 25 26 27 28 29 30 31 32 33 34 35 901 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 900 54 55 56 57 58 59 60 61 62 63 363 65 955 67 68 6 70 71 72 73 74 75 76 77 78 79 513 81 82 970 236 85 86 87 88 89 90 91 92 93 94 95 96 97 55...

result:

ok Answer correct!

Test #36:

score: 10
Accepted
time: 37ms
memory: 20516kb

input:

10
1000 252 455
479 592
266 350
335 8
117 54
580 751
999 484
73 339
97 325
96 336
629 247
947 425
374 458
666 716
498 402
859 866
361 441
627 365
372 505
456 485
376 379
422 416
72 498
489 369
211 537
909 508
12 23
523 738
714 383
556 447
548 773
521 353
76 581
555 780
565 148
672 15
570 768
888 39
...

output:

252 366 2 3 4 5 69 7 8 9 457 11 12 13 14 15 16 17 18 19 20 21 233 23 24 25 26 27 28 29 30 31 32 33 34 35 901 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 900 54 55 56 57 58 59 60 61 62 63 363 65 955 67 68 6 70 71 72 73 74 75 76 77 78 79 513 81 82 970 236 85 86 87 88 89 90 91 92 93 94 95 96 97 98 ...

result:

ok Answer correct!

Test #37:

score: 10
Accepted
time: 35ms
memory: 24368kb

input:

10
1000 304 234
651 949
290 646
953 375
867 994
71 810
114 466
924 223
583 869
947 766
627 169
100 616
847 801
20 138
886 364
320 941
866 188
408 606
762 366
842 325
934 184
122 918
736 773
348 289
876 770
913 227
274 176
727 87
18 280
305 595
774 884
441 582
328 711
829 836
891 503
45 971
804 500
6...

output:

304 367 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 10...

result:

ok Answer correct!

Test #38:

score: 10
Accepted
time: 33ms
memory: 22412kb

input:

10
1000 105 350
300 724
309 285
319 499
170 893
469 224
304 775
964 858
625 758
529 516
328 239
585 559
341 670
135 549
810 328
439 251
49 198
265 691
30 101
146 261
376 929
981 434
980 439
191 601
764 888
731 801
706 824
203 210
83 419
41 812
176 472
226 117
156 280
996 478
902 761
75 57
542 969
36...

output:

105 367 2 3 4 5 69 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 234 23 24 25 26 27 28 29 30 31 32 33 34 35 901 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 900 54 55 56 57 58 59 60 61 62 63 364 65 955 67 68 6 70 71 72 73 74 75 76 77 78 79 513 81 82 970 237 85 86 87 88 89 90 91 92 93 94 95 96 97 98 9...

result:

ok Answer correct!

Subtask #7:

score: 0
Skipped

Dependency #2:

100%
Accepted

Dependency #3:

0%
English 繁體中文 简体中文

Server Time: 2024-12-05 08:21:51 | OpenSource Project