제출 #838610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
838610		ma_moutahid	Stations (IOI20_stations)	C++17	0 / 100	662 ms	552 KiB

stations

#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vii vector<vi>
#define pi pair<int,int>

vi l;
vii g;
int p;
int ps;
void dfs(int node, int parent,int d){
	
	for(int child:g[node]){
		if(child==parent)continue;
		dfs(child,node,d+1);
	}
	l[node]=p*ps+d+1;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	g.clear();
	g.resize(2*n);
	l.resize(n);
	std::vector<int> labels(n);
	for(int i=0;i<n-1;i++){
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	int found=-1;
	for(int i=0;i<n;i++){
		if(g[n].size()>1){
			found =i;
			break;
		}
	}
	if(found!=-1){
		int ps=1000;
		for(int i=0;i<ps;i++){
			p=i;
			dfs(g[found][i],found,0);
		}
	}
	else {
		ps=0;
		p=0;
		dfs(0,-1,0);
	}
	return l;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(s==0){
		return t/1000;
	}
	s--;
	if(t/1000 !=s/1000)return s-1;
	if(t%1000>s%1000)return s++;
	else return s--;
}

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