Submission #372918

#	Time	Username	Problem	Language	Result	Execution time	Memory
372918		Jarif_Rahman	Stations (IOI20_stations)	C++17	0 / 100	6 ms	1364 KiB

stations

#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;
int n;
vector<vector<int>> v;
vector<int> label(int nn, int k, vector<int> aa, vector<int> bb){
    n = nn;
    v.assign(n, {});
    for(int i = 0; i < n-1; i++){
        v[aa[i]].pb(bb[i]);
        v[bb[i]].pb(aa[i]);
    }
    vector<int> lb(n);
    for(int i = 0; i < n; i++) lb[i] = i;
    return lb;
}
vector<int> cur;
int ans;
void dfs(int nd, int ss, int tt){
    if(nd == tt){
        ans = cur.front();
        return;
    }
    if(ans != -1) return;
    for(int x: v[nd]) if(x!=ss){
        cur.pb(x);
        dfs(x, nd, tt);
        cur.pop_back();
    }
}
int find_next_station(int s, int t, vector<int> c){
    cur.clear();
    ans = -1;
    dfs(s, -1, t);
    return ans;
}

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