Submission #1292788

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292788		julia_08	기지국 (IOI20_stations)	C++20	0 / 100	394 ms	564 KiB

stations

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

using namespace std;

const int MAXN = 1e3 + 10;

vector<int> adj[MAXN];

vector<int> label(int n, int k, vector<int> u, vector<int> v){

	vector<int> labels(n);

	for(int i=0; i<n; i++) adj[i].clear();

	for(int i=0; i<n; i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	vector<pair<int, int>> ord;

	for(int i=0; i<n; i++) ord.push_back({(int) adj[i].size(), i});

	sort(ord.rbegin(), ord.rend());

	for(int i=0; i<n; i++) labels[ord[i].second] = i;

	return labels;

}

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

	if(s == 0) return t;

	return 0;

}

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