Submission #1247194

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247194		nikulid	Stations (IOI20_stations)	C++20	8 / 100	304 ms	440 KiB

stations

#include <iostream>
#include <queue>

#include "stations.h"
#include <vector>

bool debug=0;

using namespace std;

#define pb push_back
#define mp make_pair

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    // subtask 2: binary tree
    vector<int> labels(n);
    for(int i=0; i<n; i++){
        labels[i] = i;
    }
    return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    if(s>t){
        return c[0];
    }
    int val=t;
    while(val>0){
        if( (val-1)/2 == s){
            return val;
        }
        val = (val-1)/2;
    }
    return c[0];

}

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