Submission #1067333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067333		Lalic	Stations (IOI20_stations)	C++17	5 / 100	660 ms	940 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(). x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

void build(int ver, int prev, int cnt, vector<int>& arr, vector<vector<int>>& adj){
	arr[ver]=cnt;
	
	for(auto u : adj[ver]){
		if(u==prev) continue;
		build(u, ver, cnt+1, arr, adj);
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> adj(n);
	vector<int> labels(n);
	
	for(int i=0;i<n-1;i++){
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	
	for(int i=0;i<n;i++){
		if((int)adj[i].size()==1){
			build(i, -1, 0, labels, adj);
			break;
		}
	}
	
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(t>s) return s+1;
	return s-1;
}

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