Submission #298897

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
298897	2020-09-14 09:43:10	Bruteforceman	Tax Evasion (LMIO19_mokesciai)	C++11	61 / 100	2060 ms	26620 KiB

mokesciai

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 22 / 22
• Subtask 3: 39 / 39
• Subtask 4: 0 / 29