# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361141 | Aldas25 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 662 ms | 50020 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 "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define s second
#define pb push_back
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef vector<pii> vii;
const int MAXN = 100100;
int n, m;
vii adj[MAXN];
vi exits;
ll d1[MAXN], d2[MAXN];
bool vis[MAXN];
void addD (int v, ll d) {
if (d1[v] == -1) {
d1[v] = d;
return;
}
if (d2[v] == -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... |