Submission #781049

#TimeUsernameProblemLanguageResultExecution timeMemory
781049jasminStations (IOI20_stations)C++17
8 / 100
644 ms544 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {

    vector<int> labels(n, 0);
    iota(labels.begin(), labels.end(), 0);
    return labels;
}

const int LIM=1000;
bool dfs(int v, int t){
    if(v==t) return true;
    if(v>=LIM) return false;

    if(dfs(v*2+1, t)) return true;
    return dfs(v*2+2, t);
}

int find_next_station(int s, int t, vector<int> c) {
    
    for(int i=1; i<(int)c.size(); i++){
        if(dfs(c[i], t)){
            return c[i];
        }
    }
    return c[0];
}
#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...