Submission #1234321

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234321		caacrugon	Stations (IOI20_stations)	C++20	0 / 100	305 ms	536 KiB

stations

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

using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
	}
	vector<int> indegree(n,0);
	vector<vector<int>> adj(n,vector<int>(0,0));
	for(int i=0;i<n;i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
		indegree[u[i]]++;
		indegree[v[i]]++;
	}
	queue<int> q;
	for(int i=0;i<n;i++){
		if(indegree[i]==1){
			q.push(i);
			break;
		}
	}
	int i=0;
	vector<bool> visited(n,false);	
	while(q.size()){
		int nodo=q.front();
		q.pop();
		labels[nodo]=i;
		visited[nodo]=true;
		i++;
		for(int j=0;j<adj[nodo].size();j++){
			if(visited[adj[nodo][j]])continue;
			q.push(adj[nodo][j]);
		}
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int best = c[0];
    for (int i = 1; i < c.size(); i++) {
        if (abs(c[i] - t) < abs(best - t)) {
            best = c[i];
        }
    }
    return best;
}

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