Submission #674158

#TimeUsernameProblemLanguageResultExecution timeMemory
674158Essa2006Stations (IOI20_stations)C++14
8 / 100
807 ms536 KiB
#include<bits/stdc++.h>
using namespace std;
vector<int>new_;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    new_.clear();
    new_.resize(n);
    for(int i=0;i<n-1;i++){
        if(u[i]<v[i])
            swap(u[i], v[i]);
        new_[i+1]=u[i], new_[i/2]=v[i];
    }
    return new_;
}
int find_next_station(int s, int t, vector<int> c) {
    bool found=0;
    int last=t;
    while(t){
        t=(t-1)/2;
        if(t==s){
            found=1;
            break;
        }
        last=t;
    }    
    if(!found)
        last=c[0];
    return last;
}
#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...