제출 #1236082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236082		stanirina	Stations (IOI20_stations)	C++20	52.32 / 100	307 ms	632 KiB

stations

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

vector<int> sz;
vector<int> eul;
vector<vector<int>> g;
int br;

void dfs(int c, int p){
    eul[c]=br;
    br++;
    sz[c]=1;
    for(auto a:g[c]){
        if(a==p)continue;
        dfs(a,c);
        sz[c]+=sz[a];
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	sz.assign(n,0);
	eul.assign(n,0);
	g.resize(n);
	for(int i=0;i<n;i++)g[i].clear();
	for(int i=0;i<n-1;i++){
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
	}
	br=0;
	dfs(0,-1);
	for (int i = 0; i < n; i++) {
		labels[i] = (sz[i]-1)*1000+eul[i];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    for(auto a:c){
        if(a%1000<s%1000)continue;
        //cout<<t/1000<<' '<<a/1000<<' '<<a/1000+a%1000<<endl;
        if(t%1000>=a%1000 && t%1000<=a/1000+a%1000)return a;
    }
    for(auto a:c){
        if(a%1000<s%1000)return a;
    }
	return 1;
}

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