oj.uz

Submission #298895

# Submission time Handle Problem Language Result Execution time Memory
298895 2020-09-14T09:42:25 Z Bruteforceman Tax Evasion (LMIO19_mokesciai) C++11
39 / 100
 151 ms 13048 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
vector <int> g[maxn];
int par[maxn];
int dep[maxn];
int vis[maxn];

void dfs(int x) {
  for(int i : g[x]) {
    dep[i] = 1 + dep[x];
    dfs(i);
  }
}
pair <int, int> getFarthest(int x) {
  if(vis[x]) return make_pair(0, x);
  pair <int, int> ans (dep[x], x);
  for(int i : g[x]) {
    ans = max(ans, getFarthest(i)); 
  }
  return ans;
}
int main() {
  int n, m;
  cin >> n >> m;
  for(int i = 2; i <= n; i++) {
    cin >> par[i];
    g[par[i]].push_back(i);
  }
  dep[1] = 1;
  dfs(1);
  vector <pair <int, int>> v;
  for(int i = 1; i <= m; i++) {
    int x;
    cin >> x;
    v.emplace_back(dep[x], x);
    if(x == 1) {
      cout << 1 << endl;
      exit(0);
    }
  }
  for(auto &i : v) {
    int top = (i.first + 1) / 2;
    while(top + 1 < dep[i.second]) {
      i.second = par[i.second];
    }
    i.first = dep[i.second];
  }
  sort(v.begin(), v.end(), greater <pair <int, int>> ());
  int ans = n;
  for(auto &i : v) {
    auto j = getFarthest(i.second);
    vis[j.second] = true;
    ans = min(ans, j.first);
  }
  cout << ans << endl;
  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 129 ms 3072 KB Output is correct
4 Correct 137 ms 3232 KB Output is correct
5 Correct 150 ms 3200 KB Output is correct
6 Runtime error 72 ms 13048 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 5 ms 2944 KB Output is correct
4 Correct 4 ms 2816 KB Output is correct
5 Correct 5 ms 2944 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Runtime error 72 ms 13048 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 66 ms 2944 KB Output is correct
7 Correct 35 ms 2944 KB Output is correct
8 Correct 151 ms 3296 KB Output is correct
9 Correct 11 ms 2944 KB Output is correct
10 Correct 4 ms 2816 KB Output is correct
11 Correct 16 ms 2944 KB Output is correct
12 Correct 14 ms 2944 KB Output is correct
13 Correct 123 ms 3072 KB Output is correct
14 Correct 10 ms 2944 KB Output is correct
15 Correct 84 ms 3072 KB Output is correct
16 Correct 48 ms 3072 KB Output is correct
17 Correct 15 ms 2944 KB Output is correct
18 Correct 73 ms 3072 KB Output is correct
19 Correct 8 ms 2944 KB Output is correct
20 Correct 91 ms 2944 KB Output is correct
21 Correct 26 ms 2944 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 129 ms 3072 KB Output is correct
25 Correct 137 ms 3232 KB Output is correct
26 Correct 150 ms 3200 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 6 ms 2944 KB Output is correct
29 Correct 5 ms 2944 KB Output is correct
30 Correct 4 ms 2816 KB Output is correct
31 Correct 5 ms 2944 KB Output is correct
32 Correct 5 ms 2816 KB Output is correct
33 Correct 5 ms 3200 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 66 ms 2944 KB Output is correct
7 Correct 35 ms 2944 KB Output is correct
8 Correct 151 ms 3296 KB Output is correct
9 Correct 11 ms 2944 KB Output is correct
10 Correct 4 ms 2816 KB Output is correct
11 Correct 16 ms 2944 KB Output is correct
12 Correct 14 ms 2944 KB Output is correct
13 Correct 123 ms 3072 KB Output is correct
14 Correct 10 ms 2944 KB Output is correct
15 Correct 84 ms 3072 KB Output is correct
16 Correct 48 ms 3072 KB Output is correct
17 Correct 15 ms 2944 KB Output is correct
18 Correct 73 ms 3072 KB Output is correct
19 Correct 8 ms 2944 KB Output is correct
20 Correct 91 ms 2944 KB Output is correct
21 Correct 26 ms 2944 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 129 ms 3072 KB Output is correct
25 Correct 137 ms 3232 KB Output is correct
26 Correct 150 ms 3200 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 6 ms 2944 KB Output is correct
29 Correct 5 ms 2944 KB Output is correct
30 Correct 4 ms 2816 KB Output is correct
31 Correct 5 ms 2944 KB Output is correct
32 Correct 5 ms 2816 KB Output is correct
33 Runtime error 72 ms 13048 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -