Submission #926647

#	Time	Username	Problem	Language	Result	Execution time	Memory
926647		ByeWorld	Stations (IOI20_stations)	C++14	0 / 100	568 ms	4936 KiB

stations

#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int MAXN = 1e3+10;

int n, k;
vector <int> adj[MAXN];
int x, sta;
int ans[MAXN][MAXN];

void dfs(int nw, int par){
	ans[sta][nw] = x;
	for(auto nx : adj[nw]){
		if(nx == par) continue;
		dfs(nx, nw);
	}
}

vector<int> label(int N, int K, vector<int> u, vector<int> v) {
	n = N; k = K;
	for(int i=0; i<=n; i++) adj[i].clear();

	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++){ // start
		sta = i;
		for(auto in : adj[i]){
			x = in;
			dfs(in, i);
		}
	}
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(i==j) continue;
			//cout << i << ' ' << j << ' ' << ans[i][j] << " p\n";
		}
	}
	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	return ans[s][t];
}

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