QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#554289	#9241. Sphinx	lgvc	36	132ms	4820kb	C++23	3.9kb	2024-09-09 10:01:48	2024-09-09 10:01:49

Judging History

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

[2024-09-09 10:01:49]
评测

测评结果：36
用时：132ms
内存：4820kb

查看

[2024-09-09 10:01:48]
提交

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>=2751) {
		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.37;
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(1233);
	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;
}

源文件, 语言: C++23

詳細信息

Subtask #1:

score: 3

Accepted

Test #1:

score: 3

Accepted

time: 1ms

memory: 3804kb

input:

output:

result:

ok #experiments: 2

Test #2:

score: 3

Accepted

time: 1ms

memory: 3836kb

input:

output:

result:

ok #experiments: 3

Test #3:

score: 3

Accepted

time: 0ms

memory: 3780kb

input:

output:

result:

ok #experiments: 3

Test #4:

score: 3

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok #experiments: 4

Subtask #2:

score: 0

Wrong Answer

Dependency #1:

100%

Accepted

Test #5:

score: 7

Accepted

time: 2ms

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: 130

Test #6:

score: 7

Accepted

time: 2ms

memory: 3852kb

input:

output:

result:

ok #experiments: 177

Test #7:

score: 7

Accepted

time: 0ms

memory: 3920kb

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: 233

Test #8:

score: 7

Accepted

time: 2ms

memory: 4136kb

input:

output:

result:

ok #experiments: 242

Test #9:

score: 7

Accepted

time: 2ms

memory: 3860kb

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: 261

Test #10:

score: 7

Accepted

time: 0ms

memory: 4088kb

input:

output:

result:

ok #experiments: 274

Test #11:

score: 7

Accepted

time: 3ms

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: 330

Test #12:

score: 7

Accepted

time: 1ms

memory: 3924kb

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: 347

Test #13:

score: 7

Accepted

time: 2ms

memory: 4160kb

input:

output:

result:

ok #experiments: 247

Test #14:

score: 7

Accepted

time: 3ms

memory: 4172kb

input:

output:

result:

ok #experiments: 249

Test #15:

score: 7

Accepted

time: 0ms

memory: 3852kb

input:

output:

result:

ok #experiments: 288

Test #16:

score: 7

Accepted

time: 3ms

memory: 3860kb

input:

output:

result:

ok #experiments: 311

Test #17:

score: 0

Wrong Answer

time: 3ms

memory: 3856kb

input:

output:

result:

wrong answer Vertices 0 and 1 do have the same color, but they do not in returned answer

Subtask #3:

score: 33

Accepted

Test #34:

score: 33

Accepted

time: 11ms

memory: 3888kb

input:

output:

result:

ok #experiments: 926

Test #35:

score: 33

Accepted

time: 24ms

memory: 4176kb

input:

output:

result:

ok #experiments: 1143

Test #36:

score: 33

Accepted

time: 14ms

memory: 3824kb

input:

output:

result:

ok #experiments: 1362

Test #37:

score: 33

Accepted

time: 32ms

memory: 3888kb

input:

output:

result:

ok #experiments: 1506

Test #38:

score: 33

Accepted

time: 31ms

memory: 3820kb

input:

output:

result:

ok #experiments: 1962

Test #39:

score: 33

Accepted

time: 32ms

memory: 3956kb

input:

output:

result:

ok #experiments: 2236

Test #40:

score: 33

Accepted

time: 40ms

memory: 3884kb

input:

output:

result:

ok #experiments: 2392

Test #41:

score: 33

Accepted

time: 9ms

memory: 3936kb

input:

output:

result:

ok #experiments: 598

Test #42:

score: 33

Accepted

time: 38ms

memory: 3880kb

input:

output:

result:

ok #experiments: 2526

Subtask #4:

score: 0

Wrong Answer

Test #43:

score: 0

Wrong Answer

time: 132ms

memory: 4820kb

input:

output:

result:

wrong answer Vertices 0 and 3 do have the same color, but they do not in returned answer

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted