제출 #1242265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242265		M_W_13	Stations (IOI20_stations)	C++20	0 / 100	308 ms	520 KiB

stations

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

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define st first
#define nd second
#define pb push_back
const int MAXN = 1007;
vector<int> graf[MAXN];
int kt = 0;
int jakie[MAXN];

void dfs(int v, int last) {
	jakie[v] = kt;
	// cout << "v = " << v << '\n';
	kt++;
	for (auto syn: graf[v]) {
		if (syn == last) continue;
		dfs(syn, v);
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	rep(i, n) {
		graf[i].clear();
		jakie[i] = 0;
	}
	rep(i, n - 1) {
		int a = u[i];
		int b = v[i];
		graf[a].pb(b);
		graf[b].pb(a);
	}	
	kt = 0;
	dfs(0, 0);
	vector<int> labels;
	rep(i, n) {
		labels.pb(jakie[i]);
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (s > t) {
		return c[0];
	}
	else {
		int sz = c.size();
		rep(i, sz - 1) {
			if (c[i] <= t && c[i + 1] > t) {
				return c[i];
			}
		}
		return c[sz - 1];
	}
	return s;
}

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