QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#706344	#6700. Game on a Graph	futarian^#	AC ✓	208ms	3808kb	C++14	686b	2024-11-03 10:42:48	2024-11-03 10:42:50

Judging History

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

[2024-11-03 10:42:50]
评测

测评结果：AC
用时：208ms
内存：3808kb

查看

[2024-11-03 10:42:48]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int fa[100005];
//string day[5]={"Monday","Tuesday","Wednesday","Thursday","Friday"};
int find(int x)
{
	//cout<<"2"<<endl;
	if(fa[x]!=x)
	x=find(fa[x]);
	return fa[x];
}
int main()
{
	int t,k,n,m,x,y;
	string seq;
	cin>>t;
	while(t--)
	{
		int sum=0;
		cin>>k;
		cin>>seq;
		cin>>n>>m;
		/*for(int i=0;i<n;i++)
		fa[i]=i;*/
		for(int i=0;i<m;i++)
		{
			cin>>x>>y;
			/*if(find(x)!=find(y))
			{
				//cout<<"1"<<endl;
				fa[find(x)]=find(y);
				sum++;
			}*/
		}
		sum=n-1;
		//cout<<"ans:"<<sum<<" "<<m-sum<<endl;
		if(seq[(m-sum)%k]=='1') cout<<"2"<<endl;
		else cout<<"1"<<endl;
	}
	return 0;
}

源文件, 语言: C++14

这程序好像有点Bug，我给组数据试试？

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3808kb

input:

output:

2
1
2

result:

ok 3 number(s): "2 1 2"

Test #2:

score: 0

Accepted

time: 208ms

memory: 3704kb

input:

1027
28
1122121222221112112121212112
58 72
32 31
15 56
42 56
31 3
52 57
54 50
47 5
40 22
41 36
42 50
30 28
16 6
28 42
40 23
3 0
4 24
3 50
23 29
53 6
20 27
39 30
7 10
40 43
14 48
27 47
0 6
12 9
25 56
49 41
30 55
13 54
5 11
30 44
6 5
49 34
22 33
1 29
4 39
33 38
35 33
40 2
38 55
47 52
32 52
10 47
26 43...

output:

result:

ok 1027 numbers