QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#143427#6700. Game on a Graphqzez#AC ✓60ms3700kbC++14825b2023-08-21 11:29:472023-08-21 11:29:49

Judging History

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

  • [2023-08-21 11:29:49]
  • 评测
  • 测评结果:AC
  • 用时:60ms
  • 内存:3700kb
  • [2023-08-21 11:29:47]
  • 提交

answer

#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=N*4+5,K=31650,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int k,n,m,x,y;char s[N];
void Solve(){
	int i,j;
	scanf("%d",&k);scanf("%s",s);
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++) scanf("%d%d",&x,&y);
	puts(s[(m-(n-1))%k]^'2'?"2":"1");
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3596kb

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: 60ms
memory: 3700kb

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