Submission #249896

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
249896	2020-07-16 10:45:40	dimash241	Tax Evasion (LMIO19_mokesciai)	C++17	100 / 100	239 ms	53352 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 <queue>
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
int solve(int N, int K, vector<int> S, vector<int> V) {
  int bits = 1;
  while ((1 << bits) <= N) ++bits;
  vector<vector<int> > P(bits, vector<int>(N));
  vector<int> depth(N);
  vector<vector<int> > G(N);
  for (int i = 1; i < N; ++i) {
    P[0][i] = S[i - 1];
    depth[i] = depth[P[0][i]] + 1;
    G[P[0][i]].push_back(i);
  }
  vector<bool> coin(N);
  for (int i = 0; i < K; ++i) {
    coin[V[i]] = true;
  }
  for (int i = 1; i < bits; ++i) {
    for (int j = 0; j < N; ++j) {
      P[i][j] = P[i - 1][P[i - 1][j]];
    }
  }
  int cnt = 0;
  vector<int> sl(N), sr(N), ord;
  function<void(int)> eulertour = [&](int pos) {
    ord.push_back(pos);
    sl[pos] = cnt++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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