Submission #254011

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
254011	2020-07-29 09:08:07	Nightlight	Tax Evasion (LMIO19_mokesciai)	C++14	100 / 100	583 ms	42348 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;
int N, M;
vector<int> adj[200005];
priority_queue<int, vector<int>> pq[200005]; 
int need[200005], can[200005], depth[200005];
bitset<200005> coin;
void DFS(int u, int p) {
  depth[u] = depth[p] + 1;
  for(int v : adj[u]) {
    if(v == p) continue;
    DFS(v, u);
    if(pq[v].size() > pq[u].size()) swap(pq[u], pq[v]);
    need[u] += need[v];
  }
  for(int v : adj[u]) {
    if(v == p) continue;
    while(!pq[v].empty()) pq[u].emplace(pq[v].top()), pq[v].pop();
  }
  if(coin[u]) pq[u].emplace(depth[u] / 2 + (depth[u] & 1));
  while(!pq[u].empty() && pq[u].top() == depth[u]) {
    need[u]++;
    pq[u].pop();
  }
//  cout << u << " " << need[u] << "\n";
}
int l, r, mid, ans;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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