Submission #772485

#TimeUsernameProblemLanguageResultExecution timeMemory
772485ono_de206Stations (IOI20_stations)C++14
5 / 100
761 ms632 KiB
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	vector<vector<int>> g(n);
	for(int i = 0; i < n - 1; i++) {
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
	}
	int st = 0;
	for(int i = n - 1; i >= 0; i--) {
		if(g[i].size() == 1) st = i;
	}
	int x = st, y = g[st][0];
	while(g[y].size() == 2) {
		labels[y] = labels[x] + 1;
		x ^= g[y][0] ^ g[y][1];
		swap(x, y);
	}
	labels[y] = labels[x] + 1;
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(t < s) return c[0];
	return c.back();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...