Submission #1157418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157418		zhasyn	기지국 (IOI20_stations)	C++20	0 / 100	0 ms	448 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1000 + 100, M = 4096 + 10, len = 21, inf = 1e18;
const ll mod = 1e9 + 7;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
int pos[N];
vector <int> q[N];
void dfs(int v, int pred, int cnt){
	pos[v] = cnt;
	for(auto u : q[v]){
		if(u == pred) continue;
		dfs(u, v, cnt + 1);
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector <int> labels(n);
	for(int i = 0; i < (int)u.size(); i++){
		q[u[i]].pb(v[i]);
		q[v[i]].pb(u[i]);
	}
	dfs(0, -1, 0);
	for(int i = 0; i < n; i++){
		labels.pb(pos[i]);
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(t > s) return s + 1;
	else return s - 1;
}

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