QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #574893 | #9310. Permutation Counting 4 | Sai0511 | WA | 97ms | 27800kb | C++14 | 630b | 2024-09-19 08:14:59 | 2024-09-19 08:15:00 |
Judging History
answer
#include <bits/stdc++.h>
const int N = 1e6 + 5;
int n, m, i, j, k;
int T;
std::vector<int> g[N];
bool Vs[N];
bool chkT(int u, int F) {
if (Vs[u]) return 0; Vs[u] = 1; bool res = 1;
for (int v : g[u]) if (v != F) res &= chkT(v, u);
return res;
}
inline void Solve() {
scanf("%d", &n); Vs[0] = 0;
for (int i = 1, l, r; i <= n; i++) {
scanf("%d %d", &l, &r);
g[l - 1].push_back(r), g[r].push_back(l - 1);
Vs[i] = 0;
}
puts(chkT(0, 0) ? "1" : "0");
for (int i = 0; i <= n; i++) g[i].clear();
return;
}
int main() {
scanf("%d", &T); while (T--) Solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 27232kb
input:
4 5 1 2 1 5 1 2 1 2 2 2 5 1 1 2 4 2 3 5 5 3 4 5 3 5 1 2 3 4 3 5 3 3 5 1 5 1 4 4 5 5 5 1 2
output:
0 1 0 0
result:
ok 4 tokens
Test #2:
score: -100
Wrong Answer
time: 97ms
memory: 27800kb
input:
66725 14 7 7 4 6 7 8 8 13 2 13 6 13 6 10 14 14 1 10 9 11 7 9 3 8 4 12 5 12 12 2 6 3 6 7 11 2 5 1 1 6 12 8 12 2 3 7 9 7 8 1 10 1 4 10 4 8 4 4 6 10 9 10 2 3 2 7 1 3 3 4 2 2 3 10 20 3 12 10 14 19 20 19 20 1 9 7 9 13 16 17 17 16 18 2 11 5 19 6 17 11 17 3 6 3 11 7 20 8 17 3 18 10 15 9 20 16 5 10 2 10 2 1...
output:
1 1 0 0 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 1 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 0 0 1 0 1 1 ...
result:
wrong answer 12th words differ - expected: '0', found: '1'