Submission #601891

#	Time	Username	Problem	Language	Result	Execution time	Memory
601891		FatihSolak	Stations (IOI20_stations)	C++17	8 / 100	2263 ms	792 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define N 1000
vector<int> adj[N];
int tin[N];
int tout[N];
int timer = 0;
void dfs(int v,int par){
	tin[v] = timer++;
	for(auto u:adj[v]){
		if(u == par)continue;
		dfs(u,v);
	}
	tout[v] = timer-1;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    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){
    timer = 0;
	for(int i = 0;i<N;i++){
		adj[i].clear();
	}
    for(int i = 0;i<N-1;i++){
		adj[i+1].push_back(i/2);
		adj[i/2].push_back(i+1);
	}
    timer = 0;
    dfs(0,-1);
    int x = tin[t];
	int par = -1;
	for(auto u:c){
		if(tin[u] < tin[s])
			par = u;
	}
	for(auto u:c){
		if(u == par)continue;
		int a = tin[u];
		int b = tout[u];
		if(a <= x && x <= b)
			return u;
	}
	return par;
}

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