Submission #615544

#	Time	Username	Problem	Language	Result	Execution time	Memory
615544		Koosha_mv	Stations (IOI20_stations)	C++14	100 / 100	1004 ms	788 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1000;

int Time,st[N],ft[N],h[N];
vector<int> g[N];

void dfs(int u,int p){
	if(h[u]==0){
		st[u]=Time++;
	}
	for(auto v : g[u]){
		if(v==p) continue ;
		h[v]=h[u]^1;
		dfs(v,u);
	}
	if(h[u]==1){
		ft[u]=Time++;
	}
}
vector<int> label(int n, int k,vector<int> u,vector<int> v) {
	vector<int> labels(n);
	h[0]=Time=0;
	f(i,0,n) g[i].clear();
	f(i,0,n-1) g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
	dfs(0,0);
	f(i,0,n){
		if(h[i]==0){
			labels[i]=st[i];
		}
		else{
			labels[i]=ft[i];
		}
	}
	return labels;
}
int find_next_station(int s, int t,vector<int> c) {
	for(auto v : c){
		if(v==t){
			return v;
		}
	}
	c.pb(s);
	sort(all(c));
	if(c[0]==s){
		f(i,0,int(c.size())-2){
			if(c[i]<t && t<c[i+1]){
				return c[i+1];
			}
		}
		return c.back();
	}
	else{
		f(i,1,int(c.size())-1){
			if(c[i]<t && t<c[i+1]){
				return c[i];
			}
		}
		return c[0];
	}
}

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