제출 #719517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
719517		mseebacher	기지국 (IOI20_stations)	C++17	0 / 100	793 ms	540 KiB

stations

#include "stations.h"
#include <bits/stdc++.h> 

using namespace std;

#define MAXI (int)1e3+10

vector<int> ad[MAXI];
vector<int> labels;
vector<int> in(MAXI,0);
vector<int> out(MAXI,0);
int counter = 0;


// 1 .. 1e3
// 1e3+1 ... 2e3
void dfs(int x,int e){
	in[x] = counter++;
	for(auto s: ad[x]){
		if(s == e) continue;
		dfs(s,x);
	}
	out[x] = counter++;
}


vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	labels.assign(n,0);
	for(int i = 0;i<MAXI;i++) ad[i].clear();
	counter = 0;
	for(int i = 0;i<n-1;i++){
		ad[u[i]].push_back(v[i]);
		ad[v[i]].push_back(u[i]);
	}

	dfs(0,-1);
	for(int i = 0;i<n;i++){
		labels[i] = in[i]*1000+out[i];
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size() == 1) return c[0];
	int in_t = t/1000;
	int out_t = t%1000;
	
	for(int i = 0;i<(int)c.size();i++){
		int in_i = c[i]/1000;
		int out_i = c[i]%1000;
		if(in_i <= in_t && out_i >= out_t) return c[i];
	}
	return c[0];
	
}

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