Submission #430135

#	Time	Username	Problem	Language	Result	Execution time	Memory
430135		yanire	Stations (IOI20_stations)	C++17	0 / 100	1061 ms	584 KiB

stations

#include <bits/stdc++.h>
using namespace std;
#include "stations.h"
#define fin(i,s,n) for(auto i = s; i < n; ++i)
#define fine(i,s,n) for(auto i = s; i <= n; ++i)
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
using ii = pair<int,int>;
using vi = vector<int>;
using vii = vector<ii>;
template<class T> ostream& operator<<(ostream& os, vector<T> v) {
	if(v.empty()) return os << "[]";
	os << '[' << v[0];
	fin(i,1,int(v.size())) os << ',' << v[i];
	return os << ']';
}
const int maxn = 1005;
vi l;
int lid = 0;
vi g[maxn];
void dfs2(int u, int id) {
	if(l[u]!=-1) return;
	l[u] = id++;
	for(int v : g[u]) dfs2(v,id+1);
}
void dfs(int u) {
	if(l[u]!=-1) return;
	l[u] = lid++;
	for(int v : g[u]) dfs(v);
}
vi label(int n, int k, vi u, vi v) {
	l = vi(n,-1),lid = 0;
	fin(i,0,n) g[i].clear();
	fin(i,0,n-1) g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
	fin(i,0,n) if(g[i].size()>2) {
		l[i] = 0;
		int gid = 0;
		for(int v : g[i]) dfs2(v,1+(gid++*1000));
		return l;
	}
	fin(i,0,n) if(g[i].size()==1) { dfs2(i,0); break; }
	return l;
}
int dir(int a, int b){ 
	if(a==b) return 0;
	return b>a?1:-1;
}
bool anc(int u, int v) {
	while(v>=u) {
		if(u==v) return 1;
		v = (v-1)/2;
	}
	return 0;
}
int find_next_station(int s, int t, vi c) {
	if(s==0) {
		for(int v : c) if((v/1000)==(t/1000)) return v;
		return c[0];
	}
	if((s/1000)==(t/1000)) {
		for(int v : c) if(dir(s,v)==dir(s,t)) return v;
	} else return *min_element(all(c));
	return c[0];
}

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