Submission #490546

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
490546	2021-11-27 23:11:15	mraron	Stations (IOI20_stations)	C++14	100 / 100	876 ms	736 KiB

stations

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 "stations.h"
#include <vector>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
vector<vector<int>> adj;
vector<int> L, R, lvl;
int ind;
void dfs(int x) {
  L[x]=ind++;
  for(auto i:adj[x]) {
    if(!L[i]) {
      lvl[i]=lvl[x]+1;
      dfs(i);
    }
  }
  R[x]=ind++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
  adj.resize(n);
  for(auto& i:adj) i.clear();
  
  for(int i=0;i<n-1;++i) {
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);
    //~ cerr<<u[i]<<" "<<v[i]<<"\n";
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61