QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#236052#6700. Game on a Graphstcmuyi#AC ✓57ms3716kbC++20644b2023-11-03 15:52:412023-11-03 15:52:41

Judging History

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

  • [2023-11-03 15:52:41]
  • 评测
  • 测评结果:AC
  • 用时:57ms
  • 内存:3716kb
  • [2023-11-03 15:52:41]
  • 提交

answer

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i64 long long
#define endl '\n'
#define lb(x) ((x) & (-x))
using namespace std;
const i64 mod = 1e15+7;
const int maxn = 1e3+10;

signed main()
{
    IOS;
    int t; cin >> t;
    while(t--)
    {
        int k; cin >> k;
        string s; cin >> s;
        int n,m; cin >> n >> m;
        for(int i = 1; i <= m; ++i)
        {
            int x,y; cin >> x >> y;
        }
        int t = m-(n-1);
        char c = s[t%k];
        if(c == '1') cout << 2 << endl;
        else cout << 1 << endl;
    }
    return 0;
}

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

详细

Test #1:

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

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: 57ms
memory: 3716kb

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