# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826399 | MohamedAliSaidane | Olympic Bus (JOI20_ho_t4) | C++14 | 296 ms | 3532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
const int nax = 205;
const int fax = 5e4 + 4;
const int INF = 1e9;
int n, m;
int seen[nax];
int sp1[nax], ps1[nax], sp2[nax], ps2[nax];
vector<int> adj[nax], rev_adj[nax];
int U[fax], V[fax], is_on_path[fax];
int C[fax];
ll D[fax];
int previ[nax][4];
int vis[nax][nax];
void calculate_sp(int up = -1, int vp = -1, int edg = -1)
{
for(int i = 1; i <= n; i++)
{
sp1[i] = ps1[i] = sp2[i] = ps2[i] = INF;
seen[i] = 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... |