QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#471247#9101. Zayin and Busreal_sigma_team#AC ✓161ms7896kbC++231.0kb2024-07-10 20:03:362024-07-10 20:03:36

Judging History

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

  • [2024-07-10 20:03:36]
  • 评测
  • 测评结果:AC
  • 用时:161ms
  • 内存:7896kb
  • [2024-07-10 20:03:36]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif
//#define int long long

vector<vector<int>> v;
vector<int> d;

void dfs(int u){
    for(auto i : v[u]){
        d[i] = d[u] + 1;
        dfs(i);
    }
}

void solve(){
    int n;
    cin >> n;
    v.clear();
    v.resize(n);
    d.clear();
    d.resize(n);
    d[0] = 0;
    for(int i = 0; i < n - 1; i++){
        int a;
        cin >> a;
        a--;
        v[a].push_back(i + 1);
    }
    dfs(0);
    sort(d.begin(), d.end());
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        a[i] += i + 1;
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    int mx = 0;
    for(int i = 0; i < n; i++){
        mx = max(mx, a[i] + d[i]);
    }
    cout << mx << endl;
}

signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);    
#endif     
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}

详细

Test #1:

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

input:

14
1
1
1
2
1
3
2
1
1 1
2
1
1 2
2
1
2 1
2
1
1 3
2
1
3 1
2
1
1 4
2
1
4 1
3
1 1
1 1 1
3
1 2
1 1 1
3
1 1
1 3 2
3
1 2
1 3 2

output:

2
3
4
3
4
4
5
4
6
5
4
4
6
6

result:

ok 14 lines

Test #2:

score: 0
Accepted
time: 161ms
memory: 7896kb

input:

15
1000
1 2 2 1 1 1 4 8 1 7 7 7 9 3 4 7 15 18 18 4 6 11 19 7 6 1 9 13 2 21 28 6 17 24 24 2 28 5 32 24 23 8 3 26 15 28 25 34 46 41 33 16 46 11 7 2 13 53 12 59 52 53 51 52 31 41 63 18 55 49 55 62 15 19 23 67 18 37 2 4 23 75 58 55 14 84 20 3 7 89 82 15 53 77 60 25 97 69 5 40 54 24 72 10 87 90 99 43 71 ...

output:

98572828
100088663
99870474
100076153
99995412
100076982
99971239
100079684
99928633
100093408
99432584
100093568
99620300
100058966
99565256

result:

ok 15 lines