Submission #1024359

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024359		Ahmed_Solyman	Stations (IOI20_stations)	C++14	0 / 100	570 ms	940 KiB

stations

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
vector<vector<int>>adj;
vector<int>l,r;
int mark=0;
void dfs(int node,int par){
    l[node]=mark++;
    for(auto i:adj[node])
        if(i!=par)dfs(i,node);
    r[node]=mark-1;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v){
    mark=0;
    l=r=vector<int>(n);
    adj=vector<vector<int>>(n);
    for(int i=0;i<n-1;i++){
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
    dfs(0,0);
    vector<int>ret;
    for(int i=0;i<n;i++)ret.push_back(l[i]*1000+r[i]);
    return ret;
}
bool is_anc(int u,int v){
    v%=1000;
    int in=u/1000,out=u%1000;
    if(v>=in && v<=out)return 1;
    else return 0;
}
int find_next_station(int s, int t,vector<int> c){
    int root=0;
    for(auto i:c){
        if(is_anc(i,s))root=i;
        else if(is_anc(i,t))return i;
    }
    return root;
}

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