QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#408260 | #6700. Game on a Graph | _Dusker# | AC ✓ | 52ms | 3864kb | C++20 | 596b | 2024-05-09 22:03:24 | 2024-05-09 22:03:24 |
Judging History
answer
#include <bits/stdc++.h>
#define ioclear std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
#define endl '\n'
#define int long long
using namespace std;
void solve()
{
int k;
std::cin >> k;
std::string s;
std::cin >> s;
int n, m;
std::cin >> n >> m;
for(int i = 1; i <= m; i++)
{
int u, v;
std::cin >> u >> v;
}
char t = s[(m - n + 1 + k) % k];
if(t == '1') std::cout << 2 << endl;
else cout << 1 << endl;
}
signed main()
{
#ifdef ONLINE_JUDGE
ioclear;
#endif
int t;
std::cin >> t;
while(t--)
solve();
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3520kb
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: 52ms
memory: 3864kb
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