# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479877 | SamAnd | Senior Postmen (BOI14_postmen) | C++17 | 567 ms | 104212 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;
#define m_p make_pair
const int N = 500005;
int n, m;
int z;
bool c[N];
int s[N];
vector<int> a[N];
vector<int> b[N];
int vn;
int v[N];
void dfs(int x)
{
while (s[x] != -1)
{
int h = a[x][s[x]];
if (c[b[x][s[x]]])
{
--s[x];
continue;
}
c[b[x][s[x]]] = true;
--s[x];
dfs(h);
}
v[vn++] = x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |