제출 #1132375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132375		StefanSebez	Stations (IOI20_stations)	C++20	0 / 100	3064 ms	2162688 KiB

stations

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int N=1050;
vector<int>E[N];
int in[N],nc=-1;
void DFS(int u,int par){
    in[u]=++nc;
    for(auto i:E[u]) if(i!=par) DFS(i,u);
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v){
    for(int i=0;i<n-1;i++) E[u[i]].pb(v[i]),E[v[i]].pb(u[i]);
    int root=0;for(int i=0;i<n;i++) if(E[i].size()==1) root=i;
    DFS(root,-1);
    vector<int>lbl;for(int i=0;i<n;i++) lbl.pb(in[i]);
    return lbl;
}
int find_next_station(int s, int t, std::vector<int> c){
    int res=0;
    if(s<t){
        for(auto i:c){
            if(i>s) res=i;
        }
    }
    else{
        for(auto i:c){
            if(i<s) res=i;
        }
    }
    return res;
}

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