제출 #1241269

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

stations

#include <bits/stdc++.h>
using namespace std;
const int N=1e3+5;
vector<int>a[N];
int dep[N];
int ce=0;
void dfs(int x,int y,vector<int> &labels){
	if (x!=0){
		dep[x]=dep[y]=1;
	}
	if (dep[x]%2==0){
		labels[x]=ce;
		ce++;
	}
	for (int i:a[x]){
		if (i==y)continue;
		dfs(i,x,labels);
	}
	if (dep[x]%2){
		labels[x]=ce;
		ce++;
	}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
	}
	for (int i=0;i<n-1;i++){
		int x=u[i];
		int y=v[i];
		a[x].push_back(y);
		a[y].push_back(x);
	}
	dfs(0,-1,labels);
	return labels;
}

int find_next_station(int s, int p, vector<int> c) {
	int ans=*max_element(c.begin(),c.end());
	for (int i:c){
		if (p==i){
			ans = i;
			break;
		}
		if (i>=p){
			ans=min(ans,i);
		}
	}
	return ans;
	// return 6;
}

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