QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#758491#9751. 覆盖一棵树fstqwq#WA 9ms3724kbC++20606b2024-11-17 18:34:502024-11-17 18:34:50

Judging History

This is the latest submission verdict.

  • [2024-11-17 18:34:50]
  • Judged
  • Verdict: WA
  • Time: 9ms
  • Memory: 3724kb
Show
  • [2024-11-17 18:34:50]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;

int n;
vector <int> E[N];
int fa[N],dep[N];

int dfs (int x) {
    dep[x] = 0;
    for (auto v : E[x]) {
        dep[x] = max(dep[x], dfs(v) + 1);
    }
    return dep[x];
}

void work() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        E[i].clear();
    } 
    for (int i = 2; i <= n; i++) {
        cin >> fa[i];
        E[fa[i]].push_back(i);
    }
    cout << dfs (1) << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T; cin >> T;
    while (T--) work();
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3632kb

input:

2
8
1 2 3 2 5 1 7
8
1 2 3 4 5 6 7

output:

3
7

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 9ms
memory: 3724kb

input:

33428
10
1 2 3 3 4 6 7 7 9
10
1 2 3 4 5 6 7 8 8
8
1 2 3 4 5 6 7
8
1 2 3 4 4 6 7
4
1 2 3
3
1 2
3
1 1
9
1 2 3 4 5 6 7 8
2
1
3
1 2
10
1 2 3 4 5 6 7 8 9
3
1 2
2
1
10
1 2 3 4 5 6 7 8 9
2
1
5
1 2 2 4
8
1 2 3 4 5 6 7
5
1 2 3 3
2
1
5
1 2 3 4
3
1 2
9
1 2 3 4 5 6 6 8
9
1 2 3 4 5 6 7 8
9
1 2 3 4 5 5 7 8
8
1 2 ...

output:

7
8
7
6
3
2
1
8
1
2
9
2
1
9
1
3
7
3
1
4
2
7
8
7
6
4
1
2
9
7
4
3
4
6
7
3
5
7
6
5
9
3
4
4
8
2
8
6
2
4
8
4
2
1
5
2
5
2
4
7
2
2
5
2
2
6
3
9
2
5
7
4
2
2
1
3
1
9
1
5
1
7
3
6
2
9
7
2
3
1
3
3
1
2
8
6
8
4
7
7
7
6
5
7
8
4
5
2
5
5
1
7
7
7
2
2
2
3
8
3
5
6
4
3
3
3
2
2
4
8
6
7
8
6
4
2
4
7
8
1
6
2
7
7
9
1
2
8
5
2
...

result:

wrong answer 1st lines differ - expected: '4', found: '7'
English 繁體中文 简体中文

Server Time: 2025-03-13 15:07:22 | OpenSource Project