Submission #350163

#	Time	Username	Problem	Language	Result	Execution time	Memory
350163		tengiz05	Stations (IOI20_stations)	C++17	0 / 100	2 ms	748 KiB

stations

#include "stations.h"
 
#ifndef EVAL
#include "stub.cpp"
#endif
 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define all(x) x.begin(), x.end()
 
const int NN = 1e3+5;
 
vector<int> edges[NN];
int tim;
vector<int> val;
 
void dfs(int u, int t, int p){
	if(t) val[u] = ++tim;
	for(auto x:edges[u]){
      if(x == p) continue;
      dfs(x, (t ? 0 : 1), u);
    }
	if(!t) val[u] = ++tim;
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for(int i=0;i<n-1;i++){
		edges[u[i]].pb(v[i]);
		edges[v[i]].pb(u[i]);
	}
	val.resize(n);
	tim = -1;
	dfs(0, 1, -1);assert(0);
	return val;
}
 
int find_next_station(int s, int t, vector<int> c){
	sort(all(c));assert(false);
	if(s < c[sz(c)-1]){
		int p = c[sz(c)-1];
		if(t >= p) return p;
		auto tmp = lower_bound(all(c), t);
		return (*tmp);
	}else{
		int p = c[0];
		if(t > s) return p; 
		int i = sz(c)-1;
		while(c[i] > t && i > 0) i--;
		return c[i];
	}
	
}
/*
 
1
5 10
0 1
1 2
1 3
2 4
2
0 2
1 3
 
*/

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