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