QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#554332	#9241. Sphinx	lgvc	43	257ms	5152kb	C++23	4.2kb	2024-09-09 10:20:05	2024-09-09 10:20:05

Judging History

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

[2024-09-09 10:20:05]
评测

测评结果：43
用时：257ms
内存：5152kb

查看

[2024-09-09 10:20:05]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#include "sphinx.h"
int n,m;
vector<int>C,G;
int fa[255],u[100005],v[100005];
int findfather(int x){
	return x==fa[x]?x:fa[x]=findfather(fa[x]);
}
int aa[255];
int findaa(int x){
	return x==aa[x]?x:aa[x]=findaa(aa[x]);
}
bool fff=0;int ct=0;
int qqq(std::vector<int> x) {
	ct++;
	if(ct>=27501) {
		fff=1;
		return 0;
	}
	int tx=perform_experiment(x);
	return tx;
}
vector<int>gg[255];
int ss[255],vist[255],tt,I;
int query(int l,int r){
	for(int i=0;i<n;++i)vist[i]=0,aa[i]=i,C[i]=n;
	for(int i=l;i<=r;++i)for(auto cu:gg[ss[i]])vist[cu]=1,C[cu]=-1;
	vist[I]=1,C[I]=-1;
	for(int i=0;i<m;++i)if(!vist[u[i]]&&!vist[v[i]]){
		int fu=findaa(u[i]),fv=findaa(v[i]);
		if(fu!=fv)aa[fu]=fv;
	}
	int cnt=0;
	for(int i=0;i<n;++i)if(!vist[i]&&aa[i]==i)++cnt;
	return r-l+1+1+cnt-qqq(C);
}
double ef=0.382;
void solve(int l,int r,int k){
	if(!k)return;
	if(l==r){
		fa[ss[l]]=I;
		return;
	}
	int mid=(l+r)>>1;
	mid=min(r+0.0,l+ef*(r-l));
	int k1=query(l,mid);
	solve(l,mid,k1);
	solve(mid+1,r,k-k1);
}
int s1[255],s2[255];
vector<int>g[255];
int dep[255];
void dfs(int x){
	vist[x]=1;
	for(auto cu:g[x])if(!vist[cu]){
		dep[cu]=dep[x]+1;
		dfs(cu);
	}
}
int p[255],v1[255],v2[255],ss1[255],ss2[255];
int query1(int l,int r,int d){
	for(int i=0;i<n;++i)vist[i]=0,aa[i]=i,C[i]=d;
	for(int i=l;i<=r;++i)for(auto cu:gg[ss1[i]])vist[cu]=1,C[cu]=-1;
	for(int i=0;i<m;++i)if(!vist[u[i]]&&!vist[v[i]]){
		int fu=findaa(u[i]),fv=findaa(v[i]);
		if(fu!=fv)aa[fu]=fv;
	}
	int cnt=0;
	for(int i=0;i<n;++i)if(!vist[i]&&aa[i]==i)++cnt;
	return r-l+1+cnt-qqq(C);
}
int query2(int l,int r,int d){
	for(int i=0;i<n;++i)vist[i]=0,aa[i]=i,C[i]=d;
	for(int i=l;i<=r;++i)for(auto cu:gg[ss2[i]])vist[cu]=1,C[cu]=-1;
	for(int i=0;i<m;++i)if(!vist[u[i]]&&!vist[v[i]]){
		int fu=findaa(u[i]),fv=findaa(v[i]);
		if(fu!=fv)aa[fu]=fv;
	}
	int cnt=0;
	for(int i=0;i<n;++i)if(!vist[i]&&aa[i]==i)++cnt;
	return r-l+1+cnt-qqq(C);
}
void solve1(int l,int r,int d){
	if(l==r){
		G[ss1[l]]=d;v1[ss1[l]]=1;
		return;
	}
	int mid=min(r+0.0,l+(r-l)*ef);
	int f1=query1(l,mid,d);
	if(!f1){
		solve1(mid+1,r,d);
	}else{
		solve1(l,mid,d);
		if(query1(mid+1,r,d))solve1(mid+1,r,d);
	}
}
void solve2(int l,int r,int d){
	if(l==r){
		G[ss2[l]]=d;v2[ss2[l]]=1;
		return;
	}
	int mid=min(r+0.0,l+(r-l)*ef);
	int f1=query2(l,mid,d);
	if(!f1){
		solve2(mid+1,r,d);
	}else{
		solve2(l,mid,d);
		if(query2(mid+1,r,d))solve2(mid+1,r,d);
	}
}
vector<int>find_colours(int N,vector<int>X,vector<int>Y){
	n=N;m=X.size();
	C.resize(n);G.resize(n);
	for(int i=0;i<m;++i){
		u[i]=X[i],v[i]=Y[i];
	}
	for(int i=0;i<n;++i)fa[i]=i;
	for(int i=0;i<n;++i)p[i]=i;
	mt19937 mt(1725848345);
	if(m>n-1) {
		shuffle(p,p+n,mt);
		for(int x=1;x<n;++x){
			int i=p[x];
			I=i;
			for(int j=0;j<x;++j)gg[p[j]].clear();
			for(int j=0;j<x;++j){
				gg[findfather(p[j])].emplace_back(p[j]);
			}
			tt=0;
			for(int j=0;j<x;++j)if(gg[p[j]].size())ss[++tt]=p[j];
			solve(1,tt,query(1,tt));
		}
	}
	for(int j=0;j<n;++j)gg[j].clear();
	for(int j=0;j<n;++j){
		gg[findfather(j)].emplace_back(j);
	}
	for(int i=0;i<n;++i)g[i].clear();
	for(int i=0;i<m;++i)if(findfather(u[i])!=findfather(v[i])){
		int fu=fa[u[i]],fv=fa[v[i]];
		g[fu].emplace_back(fv);
		g[fv].emplace_back(fu);
	}
	int r=findfather(0);
	for(int i=0;i<n;++i)vist[i]=0;
	dep[r]=0;dfs(r);
	int t1=0,t2=0;
	for(int i=0;i<n;++i)if(fa[i]==i){
		if(dep[i]%2)s1[++t1]=i;
		else s2[++t2]=i;
	}
	if(t1+t2==1){
		for(int i=0;i<n;++i){
			for(int j=0;j<n;++j)G[j]=(j==0?-1:i);
			if(qqq(G)==1){
				for(int j=0;j<n;++j)G[j]=i;
				break;
			}
		}
		return G;
	}
	for(int i=0;i<n;++i)v1[i]=v2[i]=0;
	for(int i=0;i<n;++i)p[i]=i;
	shuffle(p,p+n,mt);
	for(int dd=0;dd<n;++dd){
		int d=p[dd];
		int tt1=0,tt2=0;
		for(int i=1;i<=t1;++i)if(!v1[s1[i]]){
			ss1[++tt1]=s1[i];
		}
		for(int i=1;i<=t2;++i)if(!v2[s2[i]]){
			ss2[++tt2]=s2[i];
		}
		shuffle(ss1+1,ss1+tt1+1,mt);
		shuffle(ss2+1,ss2+tt2+1,mt);
		if(tt1&&query1(1,tt1,d))solve1(1,tt1,d);
		if(tt2&&query2(1,tt2,d))solve2(1,tt2,d);
	}
	if(fff) for(int i=0;i<n;i++) G[i]=fa[i];
	else for(int i=0;i<n;++i)G[i]=G[fa[i]];
	return G;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 3

Accepted

Test #1:

score: 3

Accepted

time: 1ms

memory: 4104kb

input:

output:

result:

ok #experiments: 2

Test #2:

score: 3

Accepted

time: 0ms

memory: 3872kb

input:

output:

result:

ok #experiments: 3

Test #3:

score: 3

Accepted

time: 0ms

memory: 3796kb

input:

output:

result:

ok #experiments: 3

Test #4:

score: 3

Accepted

time: 0ms

memory: 3872kb

input:

output:

result:

ok #experiments: 4

Subtask #2:

score: 7

Accepted

Dependency #1:

100%

Accepted

Test #5:

score: 7

Accepted

time: 2ms

memory: 4148kb

input:

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

output:

result:

ok #experiments: 174

Test #6:

score: 7

Accepted

time: 2ms

memory: 3844kb

input:

output:

result:

ok #experiments: 230

Test #7:

score: 7

Accepted

time: 3ms

memory: 3852kb

input:

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

output:

result:

ok #experiments: 259

Test #8:

score: 7

Accepted

time: 2ms

memory: 3852kb

input:

output:

result:

ok #experiments: 256

Test #9:

score: 7

Accepted

time: 2ms

memory: 3840kb

input:

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

output:

result:

ok #experiments: 253

Test #10:

score: 7

Accepted

time: 3ms

memory: 3836kb

input:

output:

result:

ok #experiments: 299

Test #11:

score: 7

Accepted

time: 3ms

memory: 4136kb

input:

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

output:

result:

ok #experiments: 325

Test #12:

score: 7

Accepted

time: 0ms

memory: 4148kb

input:

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

output:

result:

ok #experiments: 335

Test #13:

score: 7

Accepted

time: 0ms

memory: 3840kb

input:

output:

result:

ok #experiments: 310

Test #14:

score: 7

Accepted

time: 0ms

memory: 3864kb

input:

output:

result:

ok #experiments: 297

Test #15:

score: 7

Accepted

time: 4ms

memory: 3800kb

input:

output:

result:

ok #experiments: 336

Test #16:

score: 7

Accepted

time: 2ms

memory: 4172kb

input:

output:

result:

ok #experiments: 371

Test #17:

score: 7

Accepted

time: 0ms

memory: 3876kb

input:

output:

result:

ok #experiments: 64

Test #18:

score: 7

Accepted

time: 3ms

memory: 3836kb

input:

output:

result:

ok #experiments: 217

Test #19:

score: 7

Accepted

time: 3ms

memory: 3892kb

input:

output:

result:

ok #experiments: 238

Test #20:

score: 7

Accepted

time: 3ms

memory: 3964kb

input:

output:

result:

ok #experiments: 256

Test #21:

score: 7

Accepted

time: 4ms

memory: 4180kb

input:

output:

result:

ok #experiments: 331

Test #22:

score: 7

Accepted

time: 4ms

memory: 3964kb

input:

output:

result:

ok #experiments: 328

Test #23:

score: 7

Accepted

time: 5ms

memory: 3856kb

input:

output:

result:

ok #experiments: 358

Test #24:

score: 7

Accepted

time: 5ms

memory: 3884kb

input:

output:

result:

ok #experiments: 385

Test #25:

score: 7

Accepted

time: 2ms

memory: 3796kb

input:

output:

result:

ok #experiments: 204

Test #26:

score: 7

Accepted

time: 0ms

memory: 3916kb

input:

output:

result:

ok #experiments: 295

Test #27:

score: 7

Accepted

time: 3ms

memory: 3812kb

input:

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

output:

result:

ok #experiments: 325

Test #28:

score: 7

Accepted

time: 3ms

memory: 4156kb

input:

output:

result:

ok #experiments: 308

Test #29:

score: 7

Accepted

time: 4ms

memory: 3856kb

input:

output:

result:

ok #experiments: 339

Test #30:

score: 7

Accepted

time: 4ms

memory: 3916kb

input:

output:

result:

ok #experiments: 261

Test #31:

score: 7

Accepted

time: 0ms

memory: 3944kb

input:

output:

result:

ok #experiments: 355

Test #32:

score: 7

Accepted

time: 2ms

memory: 3848kb

input:

output:

result:

ok #experiments: 104

Test #33:

score: 7

Accepted

time: 5ms

memory: 3876kb

input:

output:

result:

ok #experiments: 394

Subtask #3:

score: 33

Accepted

Test #34:

score: 33

Accepted

time: 14ms

memory: 3880kb

input:

output:

result:

ok #experiments: 944

Test #35:

score: 33

Accepted

time: 13ms

memory: 3956kb

input:

output:

result:

ok #experiments: 1173

Test #36:

score: 33

Accepted

time: 26ms

memory: 3876kb

input:

output:

result:

ok #experiments: 1437

Test #37:

score: 33

Accepted

time: 21ms

memory: 3824kb

input:

output:

result:

ok #experiments: 1546

Test #38:

score: 33

Accepted

time: 34ms

memory: 3876kb

input:

output:

result:

ok #experiments: 2035

Test #39:

score: 33

Accepted

time: 38ms

memory: 4168kb

input:

output:

result:

ok #experiments: 2250

Test #40:

score: 33

Accepted

time: 28ms

memory: 3840kb

input:

output:

result:

ok #experiments: 2386

Test #41:

score: 33

Accepted

time: 13ms

memory: 3876kb

input:

output:

result:

ok #experiments: 976

Test #42:

score: 33

Accepted

time: 32ms

memory: 3912kb

input:

output:

result:

ok #experiments: 2536

Subtask #4:

score: 0

Runtime Error

Test #43:

score: 21

Accepted

time: 50ms

memory: 4796kb

input:

output:

result:

ok #experiments: 777

Test #44:

score: 21

Accepted

time: 114ms

memory: 5016kb

input:

output:

result:

ok #experiments: 1241

Test #45:

score: 21

Accepted

time: 172ms

memory: 5012kb

input:

output:

result:

ok #experiments: 1685

Test #46:

score: 21

Accepted

time: 188ms

memory: 4796kb

input:

output:

result:

ok #experiments: 1916

Test #47:

score: 21

Accepted

time: 216ms

memory: 4784kb

input:

output:

result:

ok #experiments: 2232

Test #48:

score: 21

Accepted

time: 237ms

memory: 4908kb

input:

output:

result:

ok #experiments: 2415

Test #49:

score: 21

Accepted

time: 257ms

memory: 5152kb

input:

output:

result:

ok #experiments: 2523

Test #50:

score: 21

Accepted

time: 19ms

memory: 4756kb

input:

output:

result:

ok #experiments: 309

Test #51:

score: 0

Runtime Error

input:

output:

result:

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted