제출 #432407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432407		Pbezz	기지국 (IOI20_stations)	C++14	0 / 100	3138 ms	2097156 KiB

stations

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

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;

const ll MAXN = 1005;
const ll INF = 1e9+7;
vector<vector<ll>>adj(MAXN);
int deg[MAXN],order[MAXN];

void dfs(int node, int p,int mark){
order[node]=mark;
for(auto u:adj[node]){
if(u==p)continue;

dfs(u,node,mark+1);

}
}


std::vector<int> label(int n, int k,std::vector<int>u,std::vector<int>v){
	std::vector<int> labels(n);
	int i;
	for(i=0;i<n-1;i++){
	adj[u[i]].pb(v[i]);
	adj[v[i]].pb(u[i]);
	deg[u[i]]++;
	deg[v[i]]++;
	}

	for(i=0;i<n;i++) {
	if(deg[i]==1)break;
	}
//	cout<<i<<" k \n";
	dfs(i,-1,0);

	for (i = 0; i < n; i++) {
		labels[i] = order[i];
//	cout<<order[i]<<" ";
	}//cout<<endl;
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {

	int mini=INF,maxi=-1;

	for(auto u:c){
	mini=min(mini,u);
	maxi=max(maxi,u);
	}
//	sort(c.begin(),c.end());
	if(t<s)return mini;

	

	return maxi;
}

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