Submission #372960

#TimeUsernameProblemLanguageResultExecution timeMemory
372960Jarif_RahmanStations (IOI20_stations)C++17
5 / 100
1059 ms1192 KiB
#include "stations.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<int>> v;
vector<int> order;
void dfs(int nd, int ss){
    order.pb(nd);
    for(int x: v[nd]) if(x != ss) dfs(x, nd);
}
vector<int> label(int n, int k, vector<int> aa, vector<int> bb){
    v.assign(n, {});
    order.clear();
    for(int i = 0; i < n-1; i++){
        v[aa[i]].pb(bb[i]);
        v[bb[i]].pb(aa[i]);
    }
    for(int i = 0; i < n; i++){
        if(v[i].size() == 1){
            dfs(i, -1);
            break;
        }
    }
    vector<int> lb(n);
    for(int i = 0; i < n; i++) lb[order[i]] = i;
    return lb;
}
int find_next_station(int s, int t, vector<int> c){
    if(s < t) return s+1;
    return s-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...