QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #455474 | #8720. BFS 序 0 | Andyqian7 | AC ✓ | 341ms | 78596kb | C++14 | 2.9kb | 2024-06-26 14:44:40 | 2024-06-26 14:44:41 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAX = 5e5 + 10;
int n, T, m, dep[MAX], q[MAX], f[MAX][20], deg[MAX], vis[MAX];
vector<int> sons[MAX];
set<int> nxt[MAX];
int anc(int s, int dis)
{
int ans = s;
for (int i = 0; i < 20; i++)
{
if (dis >> i & 1)
ans = f[ans][i];
}
return ans;
}
int lca(int x, int y)
{
if (dep[x] < dep[y])
swap(x, y);
x = anc(x, dep[x] - dep[y]);
for (int i = 19; ~i; i--)
{
if (f[x][i] != f[y][i])
{
x = f[x][i], y = f[y][i];
}
}
return f[x][0];
}
int main()
{
cin >> n;
for (int i = 2; i <= n; i++)
{
int fa;
cin >> fa;
sons[fa].push_back(i), dep[i] = dep[fa] + 1, f[i][0] = fa;
}
for (int i = 0; i < 19; i++)
{
for (int j = 1; j <= n; j++)
{
f[j][i + 1] = f[f[j][i]][i];
}
}
cin >> T;
while (T--)
{
cin >> m;
vector<int> c;
for (int i = 1; i <= m; i++)
{
cin >> q[i];
c.push_back(q[i]);
}
sort(c.begin(), c.end());
int sz = c.size();
if (unique(c.begin(), c.end()) - c.begin() != sz)
{
cout << "No" << endl;
continue;
}
set<int> todo;
bool sign = true;
for (int i = 1; i < m; i++)
{
if (dep[q[i]] > dep[q[i + 1]])
{
cout << "No" << endl;
sign = false;
break;
}
}
if (!sign)
continue;
for (int i = 1; i < m; i++)
{
if (dep[q[i]] < dep[q[i + 1]])
continue;
int z = lca(q[i], q[i + 1]);
int a = anc(q[i], dep[q[i]] - dep[z] - 1);
int b = anc(q[i + 1], dep[q[i + 1]] - dep[z] - 1);
nxt[a].insert(b);
todo.insert(a), todo.insert(b);
}
for (int s : todo)
{
for (int son : nxt[s])
{
deg[son]++;
}
}
queue<int> Q;
for (int s : todo)
{
if (!deg[s])
Q.push(s);
}
while (Q.size())
{
int t = Q.front();
vis[t] = 1;
Q.pop();
for (int son : nxt[t])
{
deg[son]--;
if (!deg[son])
Q.push(son);
}
}
for (int s : todo)
{
nxt[s].clear();
deg[s] = 0;
if (!vis[s])
{
sign = false;
}
vis[s] = 0;
}
if (sign)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 7ms
memory: 45560kb
input:
6 1 1 3 2 4 10 4 3 6 2 5 1 4 3 2 4 5 5 2 5 4 6 3 3 1 4 2 3 5 6 3 5 4 5 2 6 1 4 4 3 2 5 4 4 6 2 3 3 3 2 6
output:
No Yes Yes No No No No No No Yes
result:
ok 10 token(s): yes count is 3, no count is 7
Test #2:
score: 0
Accepted
time: 338ms
memory: 78204kb
input:
300000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
No Yes Yes Yes No No No No No No Yes Yes No Yes No Yes Yes Yes No No No No Yes No No Yes No No No No Yes Yes Yes No No Yes No No No No No No No Yes No Yes No Yes No No No No Yes Yes Yes No No Yes No No No No No Yes Yes No No No No No Yes Yes No Yes No No No Yes No No Yes No No Yes Yes Yes No No No Y...
result:
ok 254 token(s): yes count is 89, no count is 165
Test #3:
score: 0
Accepted
time: 333ms
memory: 78596kb
input:
300000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
Yes No No Yes No No Yes Yes No Yes No Yes No No No Yes No No No No Yes No No No No No Yes Yes No No No Yes No No No No No Yes Yes Yes No No No No No No No Yes No Yes No No No Yes No No No Yes No No Yes No Yes Yes No No No Yes No Yes Yes Yes No Yes No Yes Yes Yes Yes Yes No Yes No No No No No Yes No ...
result:
ok 266 token(s): yes count is 102, no count is 164
Test #4:
score: 0
Accepted
time: 341ms
memory: 77972kb
input:
300000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
No No Yes No Yes No No No No No No No No Yes No No No No No No No No Yes No No No No Yes No No No No No No No Yes Yes No No No No No No Yes No No No Yes Yes No No No Yes Yes No Yes No Yes No Yes No Yes No Yes No No Yes No No No No No No No Yes Yes No Yes No No No No No No Yes Yes No Yes Yes No No No...
result:
ok 252 token(s): yes count is 87, no count is 165
Test #5:
score: 0
Accepted
time: 20ms
memory: 45356kb
input:
10 1 1 3 3 1 3 1 3 9 10000 4 3 5 6 9 5 3 1 4 9 6 5 6 4 3 5 7 28 8 3 4 3 1 6 3 5 8 7 2 4 4 4 2 7 5 9 2 4 10 8 4 10 3 4 5 7 3 5 2 9 6 4 7 2 3 9 5 5 9 2 5 6 1 12 3 5 8 8 1 3 5 8 4 5 9 1 29 3 9 9 1 5 8 5 5 6 10 8 8 4 8 4 2 8 10 5 7 3 7 1 8 4 7 5 1 6 7 5 9 8 3 2 1 6 4 4 1 9 5 22 10 9 5 4 5 8 10 3 2 1 10 ...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes No No No No Yes No No No No No Yes No No No No No No No Yes No No No No Yes No No No Yes No No Yes No No No No No No No No No No No No No No No Yes No Yes No No No No No No No No No Yes Yes No Yes No No No No No No ...
result:
ok 10000 token(s): yes count is 1058, no count is 8942
Test #6:
score: 0
Accepted
time: 19ms
memory: 45084kb
input:
9 1 2 1 2 2 4 2 6 10000 6 5 1 4 3 7 8 14 6 8 7 9 7 5 1 8 3 6 3 8 5 2 2 6 9 17 7 8 6 5 2 1 5 5 9 3 4 1 5 2 7 2 5 3 8 6 5 5 3 9 1 6 8 8 3 5 8 7 9 4 6 2 4 8 9 6 5 7 4 7 2 9 3 8 1 6 1 4 9 5 6 2 4 7 5 4 3 5 9 5 2 1 3 4 4 5 7 3 3 9 1 8 4 4 2 8 6 26 7 4 7 6 1 7 9 4 5 5 8 9 8 2 4 8 9 6 2 8 6 4 5 5 4 4 45 3 ...
output:
No No Yes No Yes No No No No No No No No No Yes No No No No No No Yes No No No No No No Yes No No No No No No No No Yes Yes No No No Yes No No No No No No No No No No No No Yes No No No No No No No No No No No No No Yes No Yes No No No No No No No No Yes No No No Yes No No Yes No No No No No No No N...
result:
ok 10000 token(s): yes count is 1492, no count is 8508
Test #7:
score: 0
Accepted
time: 19ms
memory: 46172kb
input:
8 1 1 2 4 2 4 6 10000 5 2 6 6 2 1 3 7 3 8 2 8 1 5 7 5 1 2 7 3 2 3 5 3 8 4 3 5 8 2 4 5 3 4 3 2 1 8 6 6 8 4 5 3 1 6 3 1 2 7 4 6 4 8 6 4 3 5 4 7 6 8 5 11 2 1 6 5 2 7 1 3 3 5 4 4 6 1 7 2 7 6 2 7 8 4 1 3 3 4 6 7 3 7 1 6 38 3 4 6 6 3 4 8 1 5 3 1 8 8 6 2 3 6 7 8 8 4 2 3 7 3 3 6 7 7 5 7 5 8 8 5 4 5 7 1 8 5 ...
output:
No No No No Yes No No No No No No No No No No Yes No No Yes No No No No No Yes No Yes No No No Yes Yes No No No No No No Yes No No No No No No No No No No No Yes No No No No No No No No No Yes No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No Yes No No No No No ...
result:
ok 10000 token(s): yes count is 1568, no count is 8432
Test #8:
score: 0
Accepted
time: 12ms
memory: 45020kb
input:
7 1 2 3 1 2 5 10000 5 1 7 3 5 6 5 5 3 2 7 4 4 5 2 6 4 12 3 1 5 5 6 6 3 5 3 5 3 3 11 2 3 2 6 7 3 6 6 3 3 3 2 3 2 6 1 3 4 2 6 7 3 2 7 1 6 5 2 7 3 4 1 27 2 5 6 1 7 1 7 1 4 6 7 1 6 2 1 7 1 3 4 4 7 7 2 6 4 4 3 2 5 6 1 7 3 3 1 4 4 1 7 3 4 3 4 2 1 4 4 1 6 7 4 6 2 7 4 4 5 1 6 4 1 3 5 1 2 3 5 7 5 2 3 7 6 5 1...
output:
No No Yes No No No No No No No Yes Yes No Yes No No No No Yes No No No No Yes No No Yes No No No No No No No No No No No No No No No No No No No No No No No Yes No No Yes No Yes Yes No Yes Yes No No No No No No No No No No Yes No No No No No No No No Yes No Yes No No No No Yes Yes Yes Yes Yes Yes Ye...
result:
ok 10000 token(s): yes count is 2205, no count is 7795
Extra Test:
score: 0
Extra Test Passed