제출 #434292

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

stations

#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second

int aqui,m=1e9,M=-1,cont;
vector<int> adj[1000],l(1000);
bool mk[1000];

void dfs(int x){
    mk[x]=1;
    l[x]=cont;
    cont++;
    for(auto y:adj[x])if(!mk[y])dfs(y);
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for (int i = 0; i < n-1; i++) {
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
    l.resize(n);
	for(int i=0;i<n;i++)if(adj[i].size()==1){aqui=i; break;}

	dfs(aqui);
    for(auto x:l)cout<<x<<" ";
    cout<<"\n";
	return l;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(t>s){for(auto x:c)M=max(M,x); return M;}
	else {for(auto x:c)m=min(m,x); return m;}
}

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