제출 #1310939

#제출 시각아이디문제언어결과실행 시간메모리
1310939moha1111기지국 (IOI20_stations)C++20
0 / 100
386 ms480 KiB
#include "bits/stdc++.h"
#include "stations.h"

using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
    vector<int> graph[n + 5];
    for(int i = 0 ; i < n - 1 ; i++)
    {
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }
    vector<int> la(n , 0);
    int cur;
    for(int i = 0 ; i < n ; i++)
    {
        if(graph[i].size() == 1)
        {
            la[i] = 1 , cur = i;
            break;
        }
    }
    for(int i = 2 ; i < n ; i++)
    {
        int n1 = graph[cur][0];
        if(la[n1] == 0)
            la[n1] = i , cur = n1;
        
        else
            la[graph[cur][1]] = i , cur = la[graph[cur][1]];
    }
    if(la[graph[cur][0]] == 0)
        la[graph[cur][0]] = n;
    
    else
        la[graph[cur][1]] = n;
    
    return la;
}

int find_next_station(int s, int t, vector<int> c)
{
    if(s < t)
        return c[0];
    
    else
        return c[1];
}
#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...