Submission #1310952

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310952		moha1111	기지국 (IOI20_stations)	C++20	5 / 100	389 ms	484 KiB

stations

#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]);
    }
    int cur = 0;
    for(int i = 0 ; i < n ; ++i)
    {
        if(graph[i].size() == 1)
        {
            cur = i; 
            break;
        }
    }
    vector<int> la(n , 0);
    int p = -1;
    for(int i = 1 ; i <= n ; i++) 
    {
        la[cur] = i;
        int next = -1;
        for(int j : graph[cur]) 
        {
            if(j != p) 
                next = j; 
            
        }
        p = cur;
        cur = next;
    }
    return la;
}

int find_next_station(int s, int t, vector<int> c)
{
    if(c.size() == 1)
        return c[0];
    
    if(s < t)
        return c[1];
    
    else
        return c[0];
}

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