제출 #621449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
621449		misteg168	기지국 (IOI20_stations)	C++17	0 / 100	852 ms	632 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll it = 1;
void dfs(ll node, vector<vector<ll>> & adj, vector<bool> & vis, vector<int> & labels){
	vis[node] = 1;
	labels[node] = it;
	//cout << node << "\n";
	for(auto x : adj[node]){
		if(vis[x]) continue;
		it++;
		dfs(x, adj, vis, labels);
	}
}

vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> labels(n);
	vector<vector<ll>> adj(n);
	for(int i = 0; i < (ll)u.size(); i++){
		adj[ u[i] ].push_back( v[i] );
		adj[ v[i] ].push_back( u[i] );
	}
	for(int i = 0; i < n; i++){
		if(adj[i].size() == 1){
			vector<bool> vis(n);
			dfs( i, adj, vis, labels);
			break;
		}
	}
	//for(auto x : labels) cout << x << " ";
	//cout << "\n";
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c){
	sort(c.begin(), c.end());
	if(t > s && s != 1){
		return c[1];
	}
	return c[0];
}

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