| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338764 | jenterjongle45 | Stations (IOI20_stations) | C++20 | 392 ms | 444 KiB |
#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> L(n);
for(int i=0;i<n;i++) L[i]=i;
return L;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(c.size()==1) return c[0];
return s>t?c[0]:c[1];
}
| # | 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... | ||||
