| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331044 | somefolk | Stations (IOI20_stations) | C++20 | 393 ms | 444 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);
for(int i = 0; i < n; i++){
labels[i] = i;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c){
bool flag = false;
{
int curr = s;
while(curr <= 1000){
if(t == curr){
flag = true;
break;
}
curr = 2*curr+1;
}
}
if(flag) return c[1];
{
int curr = s;
while(curr <= 1000){
if(t == curr){
flag = true;
break;
}
curr = 2*curr+2;
}
}
if(flag) return c[2];
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... | ||||
