# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255086 | vioalbert | Tax Evasion (LMIO19_mokesciai) | C++14 | 273 ms | 55528 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int n, m;
vector<int> adj[N];
bool coin[N];
void read() {
cin >> n >> m;
for(int i = 2; i <= n; i++) {
int x; cin >> x;
adj[x].push_back(i);
adj[i].push_back(x);
}
memset(coin, 0, sizeof coin);
for(int i = 0; i < m; i++) {
int x; cin >> x;
coin[x] = 1;
}
}
const int lv = 20;
int par[N][lv+1];
int fi[N], se[N], depth[N];
vector<int> euler;
int timer;
void dfs(int u, int p, int h) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |