Submission #1223665

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223665		Ludissey	기지국 (IOI20_stations)	C++20	8 / 100	304 ms	492 KiB

stations

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

using namespace std;

#define sz(a) (int)a.size()
#define all(a) (a.begin(), a.end())

vector<vector<int>> neigh;
vector<int> labels;
int tim=0;

void dfs(int x,int p){
    labels[x]=tim++;
    for (auto u : neigh[x])
    {
        if(u==p) continue;
        dfs(u,x);
    }
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels.clear();
	neigh.clear();
    labels.resize(n);
	neigh.resize(n);
    tim=0;
    for (int i = 0; i < n; i++)
    {
        labels[i]=i;
    }
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    while(true){
        for (int i=0; i< sz(c); i++)
        {
            int u=c[i];
            if(t==u) return u;
        }
        if(t==0) return c[0];
        t=(t-1)/2;
    }
    return c[0];

}

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