Submission #394530

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
394530	2021-04-26 19:18:51	couplefire	Pastiri (COI20_pastiri)	C++17	100 / 100	961 ms	150640 KiB

pastiri

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;
#define MAXN 500005
int n, k;
vector<int> adj[MAXN];
vector<int> newadj[MAXN];
int dist[MAXN], good[MAXN], depth[MAXN];
bool sheep[MAXN], visited[MAXN];
vector<int> curstack[2*MAXN];
set<array<int, 2>, greater<array<int, 2>>> active;
vector<int> ans;
void bfs(){
    memset(dist, 63, sizeof dist);
    queue<int> q;
    for(int i = 0; i<n; i++) if(sheep[i]) q.push(i), dist[i] = 0;
    while(!q.empty()){
        int v = q.front(); q.pop();
        for(auto u : adj[v]) if(dist[u] > dist[v]+1) dist[u] = dist[v]+1, q.push(u);
    }
}
void dfs(int v, int p, int d){
    depth[v] = d;
    curstack[depth[v]+dist[v]].push_back(v);
    if(sheep[v]) good[v] = curstack[depth[v]+dist[v]].front();
    for(auto u : adj[v]){
        if(u == p) continue;
        dfs(u, v, d+1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 18 / 18
• Subtask 3: 23 / 23
• Subtask 4: 51 / 51