This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> col;
vector<int> label(int n, int k, vector<int> a, vector<int> b){
col.resize(n,0); iota(col.begin(),col.end(),0); return col;
}
int nx(int s){return (s-1)/2;}
int is_child(int s, int t){return t==s*2+1 or t==s*2+2;}
int find_next_station(int s, int t, vector<int> c){
if(c.size()==1)return c[0];
int x = t;
while(nx(x)>s) x=nx(x);
if(is_child(s,x)) return x;
return c[0];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |