Submission #1194273

#TimeUsernameProblemLanguageResultExecution timeMemory
1194273simona1230기지국 (IOI20_stations)C++20
5 / 100
311 ms5176 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> g[200001];
int used[200001];
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> l(n);
	for(int i=0;i<n;i++)
        g[i].clear(),used[i]=0;
	for(int i=0;i<n-1;i++)
        g[u[i]].push_back(v[i]),g[v[i]].push_back(u[i]);
    int s=0;
    for(int i=0;i<n;i++)
    {
        if(g[i].size()==1)
        {
            s=i;
        }
    }

    l[s]=0;
    int id=1;
    //cout<<s<<endl;
    while(1)
    {
        used[s]=1;
        if(!used[g[s][0]])s=g[s][0];
        else s=g[s][1];
        //cout<<s<<"-";
        l[s]=id++;
        if(g[s].size()==1)
            break;
    }

    return l;
}

int find_next_station(int s, int t, std::vector<int> c)
{
    if(c.size()==1)return c[0];
    if(s<t)return c[1];
    return c[0];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...