# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306889 | 2020-09-26T13:42:55 Z | giorgikob | Stations (IOI20_stations) | C++14 | 981 ms | 876 KB |
#include "stations.h" #include <vector> #include<bits/stdc++.h> #define ll long long #define ff first #define ss second #define pb push_back using namespace std; const int N = 1e3+5; /*int cnt = 0; int c = 0; int answer[N][N]; void dfs(int x){ fix[x] = 1; answer[root][x] = c; for(auto to : gr[x]){ if(fix[to]) continue; dfs(to); } }*/ std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { std::vector<int> labels(n); for (int i = 0; i < n; i++) { labels[i] = i; //cnt++; } /*for(int i = 0; i < n; i++){ int x = u[i]; int y = v[i]; gr[x].pb(y); gr[y].pb(x); } for(int x = 0; x < n; x ++){ fix[x] = 1; for(auto to : gr[x]){ dfs(to); } }*/ return labels; } int find_next_station(int s, int t, std::vector<int> c) { if(s > t) return c[0]; if(s < t) return c[1]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 566 ms | 876 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 455 ms | 768 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 623 ms | 760 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 981 ms | 768 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 583 ms | 872 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |