Submission #614030

#	Time	Username	Problem	Language	Result	Execution time	Memory
614030		Dan4Life	Stations (IOI20_stations)	C++17	0 / 100	951 ms	740 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[1001], col;
int lab = 0;
void dfs(int s, int p, int lab){
	col[s]=lab;
	for(auto u : adj[s])
		if(u!=p) dfs(u,s,lab+1);
}
 
vector<int> label(int n, int k, vector<int> a, vector<int> b)
{
    col.resize(n,0); lab = 0;
    for(int i = 0; i < n; i++) adj[i].clear();
	for (int i = 0; i < n-1; i++)
		adj[a[i]].pb(b[i]), adj[b[i]].pb(a[i]);
  	int ind = 0, x=1000;
    for(int i = 0; i < n; i++) if(adj[i].size()>=2) ind = i;
  	for(int i = 0; i < n; i++) if(adj[i].size()>=3) ind = i;
  	for(auto u : adj[ind]) dfs(u,ind,x),x+=1000;
  	col[ind] = 0; return col;
}
 
int fi(int x){ while(x>9) x/=10; return x; }
int find_next_station(int s, int t, vector<int> c){
	if(c.size()==1) return c[0];
  	if(s==0) for(auto u : c) if(fi(u)==fi(t)) return u;
  	if(fi(s)!=fi(t)) return c[0];
  	return c[s<t];
}

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