Submission #926239

#	Time	Username	Problem	Language	Result	Execution time	Memory
926239		velislavgarkov	Stations (IOI20_stations)	C++14	0 / 100	551 ms	940 KiB

stations

#include "stations.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAXN=1e3+10;
vector <int> ver[MAXN];
vector <int> in;
int br;
void dfs(int x, int par) {
	in[x]=br;
	br++;
	for (auto i:ver[x]) {
		if (i==par) continue;
		dfs(i,x);
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	in.resize(n);
	for (int i=0;i<n;i++) in[i]=i;
	br=0;
	for (int i=0;i<n-1;i++) {
		ver[u[i]].push_back(v[i]);
		ver[v[i]].push_back(u[i]);
	}
	return in;
	dfs(0,-1);
	return in;
}

int find_next_station(int s, int t, vector<int> c) {
	return c[0];
	if (s>t) return c[0];
	int l, r, mid;
	l=0; r=c.size()-1;
	while (l<=r) {
		mid=(l+r)/2;
		if (c[mid]<=t) l=mid+1;
		else r=mid-1;
	}
	return c[r];
}

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