QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #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
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;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3808kb
input:
3 5 11212 4 6 0 1 0 2 0 3 1 2 1 3 2 3 5 11121 5 7 0 2 1 3 2 4 0 3 1 2 3 2 4 1 3 121 4 3 0 1 0 2 1 3
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:
1 1 2 1 2 2 1 2 1 2 2 2 2 2 1 2 1 2 1 2 2 2 2 1 2 2 1 1 2 1 2 1 2 1 2 1 1 2 2 2 2 2 2 1 2 2 2 2 2 2 1 1 2 1 1 2 1 2 1 1 1 2 1 2 1 2 1 1 2 1 1 1 2 1 1 1 1 2 1 1 1 1 2 2 1 1 2 1 1 2 2 2 1 2 1 1 1 1 1 1 2 1 1 2 1 1 1 1 1 2 2 1 2 1 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 1 1 2 2 1 1 2 1 2 2 1 2 2 2 1 ...
result:
ok 1027 numbers