제출 #1228250

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

stations

#include "stations.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)x.size()
using namespace std;

vector<int> a;
vector<vector<int>> adj;
int cnt=-1;

void dfs(int u, int p=-1) {
	a[u]=1000*(++cnt);
	for (auto &v: adj[u]) if (v!=p) dfs(v, u);
	a[u]+=cnt;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	// adj.clear(), adj.resize(n);
	// for (int i=0; i<n-1; i++) adj[u[i]].pb(v[i]), adj[v[i]].pb(u[i]);
	// cnt=-1, a.clear(), a.resize(n, -1);
	// dfs(0);
	a.resize(n); iota(all(a), 0);
	return a;
}

int find_next_station(int s, int t, vector<int> c) {
	// int up=-1, actl=s/1000, actr=s%1000, tl=t/1000, tr=t%1000;
	// for (auto &u: c) {
	// 	int l=u/1000, r=u%1000;
	// 	if (l<=actl && actr<=r) up=u;
	// 	else if (l<=tl && tr<=r) return u;
	// }
	// return up
	while (t>s) {
		int nt=t/2;
		if (s==nt) return t;
		t=nt;
	}
	return s/2;
}

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