# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1122811 | LucaIlie | Olympic Bus (JOI20_ho_t4) | C++20 | 1085 ms | 2068 KiB |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int u, v, c, d;
};
struct vd {
int v, d;
bool operator < ( const vd &x ) const {
return d > x.d;
}
};
const int MAX_N = 200;
const int MAX_M = 5e4;
const int INF = 2e9;
int n;
bool vis[MAX_N + 1], used1[MAX_N + 1], usedN[MAX_N + 1], usedNew[MAX_N + 1];
int dist[MAX_N + 1][MAX_N + 1], distNew[MAX_N + 1], parent[MAX_N + 1];
vector<int> adjIn[MAX_N + 1], adjOut[MAX_N + 1];
edge edges[MAX_M];
int specialEdge;
void getDistances( int s, int t, int dist[], bool used[] ) {
for ( int v = 1; v <= n; v++ )
dist[v] = INF, vis[v] = false;
# | 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... |