제출 #1227346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227346		ByeWorld	기지국 (IOI20_stations)	C++20	0 / 100	0 ms	508 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int MAXN = 1e3+10;
const int MAX = 1e3;

int n, k;
vector <int> adj[MAXN];
vector <int> lab;
int le[MAXN], ri[MAXN], day, dep[MAXN];

void dfs(int nw, int pa){
	le[nw] = ++day; dep[nw] = dep[pa]+1;
	for(auto nx : adj[nw]){
		if(nx==pa) continue;
		dfs(nx, nw);
	}
	ri[nw] = ++day;
}

vector<int> label(int N, int K, vector<int> u, vector<int> v) {
	n = N; k = K;
	for(int i=0; i<u.size(); i++){
		adj[u[i]+1].pb(v[i]+1); adj[v[i]+1].pb(u[i]+1);
	}
	dfs(1, 0);
	for(int i=1; i<=n; i++){
		if(dep[i] % 2) lab.pb(le[i]);
		else lab.pb(ri[i]);
	}

	day = 0;
	for(int i=0; i<=n; i++){
		adj[i].clear();
	}
	return lab;
}

int find_next_station(int s, int t, vector<int> c) {
	if(s < c[0]){ // start, en, en, en
		for(int i=0; i+1<c.size(); i++){
			if(t <= c[i]) return c[i];
		}
		return c.back();
	}
	// sta, sta, sta, en -> nw
	for(int i=1; i<c.size(); i++){
		if(c[i] <= 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