QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#553789	#9241. Sphinx	JohnAlfnov	10	226ms	5092kb	C++17	4.5kb	2024-09-08 20:22:06	2024-09-08 20:22:06

Judging History

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

[2024-09-08 20:22:06]
评测

测评结果：10
用时：226ms
内存：5092kb

查看

[2024-09-08 20:22:06]
提交

answer

#include<bits/stdc++.h>
#define ONLINE_JUDGE
using namespace std;
#ifdef ONLINE_JUDGE
#include "sphinx.h"
#endif
#ifndef ONLINE_JUDGE
int a[1005],b[1005],cnt=0;
int perform_experiment(vector<int>E){
	printf("%d\n",++cnt);
	int sz=E.size();
	for(int i=0;i<sz;++i){
		b[i]=(E[i]==-1?a[i]:E[i]);
	}
	int ans=1;
	for(int i=0;i<sz-1;++i)ans+=(b[i]!=b[i+1]);
	return ans;
}
#endif
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]);
}
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-perform_experiment(C);
}
void solve(int l,int r,int k){
	if(!k)return;
	if(l==r){
		fa[ss[l]]=I;
		return;
	}
	int mid=(l+r)>>1;
	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 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[s1[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-perform_experiment(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[s2[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-perform_experiment(C);
}
int p[255],v1[255],v2[255],sy1,sy2;
void solve1(int l,int r,int k,int d){
	if(!k)return;
	if(l==r){
		G[s1[l]]=d;v1[l]=1;--sy1;
		return;
	}
	int mid=(l+r)>>1;
	int al=0,ar=0;
	for(int i=l;i<=mid;++i)al+=v1[i];
	for(int i=mid+1;i<=r;++i)ar+=v1[i];
	if(al<mid-l+1)solve1(l,mid,(0&&mid-l+1-al==sy1?1:query1(l,mid,d)),d);
	if(ar<r-mid)solve1(mid+1,r,(0&&r-mid-ar==sy1?1:query1(mid+1,r,d)),d);
}
void solve2(int l,int r,int k,int d){
	if(!k)return;
	if(l==r){
		G[s2[l]]=d;v2[l]=1;--sy2;
		return;
	}
	int mid=(l+r)>>1;
	int al=0,ar=0;
	for(int i=l;i<=mid;++i)al+=v2[i];
	for(int i=mid+1;i<=r;++i)ar+=v2[i];
	if(al<mid-l+1)solve2(l,mid,(0&&mid-l+1-al==sy2?1:query2(l,mid,d)),d);
	if(ar<r-mid)solve2(mid+1,r,(0&&r-mid-ar==sy2?1:query2(mid+1,r,d)),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=1;i<n;++i){
		I=i;
		for(int j=0;j<i;++j)gg[j].clear();
		for(int j=0;j<i;++j){
			gg[findfather(j)].emplace_back(j);
		}
		tt=0;
		for(int j=0;j<i;++j)if(gg[j].size())ss[++tt]=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(perform_experiment(G)==1){
				for(int j=0;j<n;++j)G[j]=i;
				break;
			}
		}
		return G;
	}
	for(int i=1;i<=t1;++i)v1[i]=0;
	for(int i=1;i<=t2;++i)v2[i]=0;
	for(int i=0;i<n;++i)p[i]=i;
	mt19937 mt(1377);
	shuffle(p,p+n,mt);
	sy1=t1;sy2=t2;
	for(int dd=0;dd<n;++dd){
		int d=p[dd];
		if(t1)solve1(1,t1,query1(1,t1,d),d);
		if(t2)solve2(1,t2,query2(1,t2,d),d);
	}
	for(int i=0;i<n;++i)G[i]=G[fa[i]];
	return G;
}
#ifndef ONLINE_JUDGE
int main(){
	int n=10;
	mt19937 mt(time(0));
	for(int i=0;i<n;++i)a[i]=mt()%n;
	vector<int>X(n-1),Y(n-1);
	for(int i=0;i<n-1;++i){
		X[i]=i,Y[i]=i+1;
	}
	auto ans=find_colours(n,X,Y);
	for(int i=0;i<n;++i)assert(a[i]==ans[i]);
	system("sphinx");
	return 0;
}
#endif

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 3

Accepted

Test #1:

score: 3

Accepted

time: 1ms

memory: 3836kb

input:

output:

result:

ok #experiments: 2

Test #2:

score: 3

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

ok #experiments: 5

Test #3:

score: 3

Accepted

time: 1ms

memory: 3788kb

input:

output:

result:

ok #experiments: 5

Test #4:

score: 3

Accepted

time: 0ms

memory: 3824kb

input:

output:

result:

ok #experiments: 3

Subtask #2:

score: 7

Accepted

Dependency #1:

100%

Accepted

Test #5:

score: 7

Accepted

time: 1ms

memory: 4144kb

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

Test #6:

score: 7

Accepted

time: 2ms

memory: 3860kb

input:

output:

result:

ok #experiments: 187

Test #7:

score: 7

Accepted

time: 0ms

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

Test #8:

score: 7

Accepted

time: 2ms

memory: 3912kb

input:

output:

result:

ok #experiments: 220

Test #9:

score: 7

Accepted

time: 3ms

memory: 3796kb

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

Test #10:

score: 7

Accepted

time: 3ms

memory: 3844kb

input:

output:

result:

ok #experiments: 310

Test #11:

score: 7

Accepted

time: 2ms

memory: 3856kb

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

Test #12:

score: 7

Accepted

time: 4ms

memory: 3844kb

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

Test #13:

score: 7

Accepted

time: 4ms

memory: 3860kb

input:

output:

result:

ok #experiments: 387

Test #14:

score: 7

Accepted

time: 0ms

memory: 3896kb

input:

output:

result:

ok #experiments: 371

Test #15:

score: 7

Accepted

time: 5ms

memory: 3864kb

input:

output:

result:

ok #experiments: 443

Test #16:

score: 7

Accepted

time: 4ms

memory: 3900kb

input:

output:

result:

ok #experiments: 513

Test #17:

score: 7

Accepted

time: 1ms

memory: 4172kb

input:

output:

result:

ok #experiments: 64

Test #18:

score: 7

Accepted

time: 0ms

memory: 4204kb

input:

output:

result:

ok #experiments: 259

Test #19:

score: 7

Accepted

time: 3ms

memory: 3836kb

input:

output:

result:

ok #experiments: 277

Test #20:

score: 7

Accepted

time: 2ms

memory: 4188kb

input:

output:

result:

ok #experiments: 313

Test #21:

score: 7

Accepted

time: 5ms

memory: 3860kb

input:

output:

result:

ok #experiments: 375

Test #22:

score: 7

Accepted

time: 0ms

memory: 4192kb

input:

output:

result:

ok #experiments: 400

Test #23:

score: 7

Accepted

time: 5ms

memory: 3888kb

input:

output:

result:

ok #experiments: 468

Test #24:

score: 7

Accepted

time: 0ms

memory: 3888kb

input:

output:

result:

ok #experiments: 556

Test #25:

score: 7

Accepted

time: 3ms

memory: 3928kb

input:

output:

result:

ok #experiments: 321

Test #26:

score: 7

Accepted

time: 4ms

memory: 3912kb

input:

output:

result:

ok #experiments: 442

Test #27:

score: 7

Accepted

time: 2ms

memory: 3852kb

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

Test #28:

score: 7

Accepted

time: 0ms

memory: 4148kb

input:

output:

result:

ok #experiments: 338

Test #29:

score: 7

Accepted

time: 2ms

memory: 3864kb

input:

output:

result:

ok #experiments: 473

Test #30:

score: 7

Accepted

time: 3ms

memory: 4192kb

input:

output:

result:

ok #experiments: 311

Test #31:

score: 7

Accepted

time: 4ms

memory: 4180kb

input:

output:

result:

ok #experiments: 424

Test #32:

score: 7

Accepted

time: 2ms

memory: 3856kb

input:

output:

result:

ok #experiments: 117

Test #33:

score: 7

Accepted

time: 3ms

memory: 3920kb

input:

output:

result:

ok #experiments: 554

Subtask #3:

score: 0

Runtime Error

Test #34:

score: 33

Accepted

time: 15ms

memory: 3896kb

input:

output:

result:

ok #experiments: 851

Test #35:

score: 33

Accepted

time: 13ms

memory: 4212kb

input:

output:

result:

ok #experiments: 913

Test #36:

score: 33

Accepted

time: 17ms

memory: 4136kb

input:

output:

result:

ok #experiments: 1311

Test #37:

score: 33

Accepted

time: 10ms

memory: 3924kb

input:

output:

result:

ok #experiments: 1275

Test #38:

score: 33

Accepted

time: 31ms

memory: 4132kb

input:

output:

result:

ok #experiments: 1905

Test #39:

score: 33

Accepted

time: 30ms

memory: 4156kb

input:

output:

result:

ok #experiments: 2463

Test #40:

score: 0

Runtime Error

input:

output:

result:

Subtask #4:

score: 0

Runtime Error

Test #43:

score: 21

Accepted

time: 64ms

memory: 5092kb

input:

output:

result:

ok #experiments: 997

Test #44:

score: 21

Accepted

time: 107ms

memory: 5044kb

input:

output:

result:

ok #experiments: 1415

Test #45:

score: 21

Accepted

time: 134ms

memory: 4776kb

input:

output:

result:

ok #experiments: 1739

Test #46:

score: 21

Accepted

time: 174ms

memory: 4756kb

input:

output:

result:

ok #experiments: 2009

Test #47:

score: 21

Accepted

time: 226ms

memory: 4800kb

input:

output:

result:

ok #experiments: 2508

Test #48:

score: 0

Runtime Error

input:

output:

result:

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted