# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980792 | rumbin | Senior Postmen (BOI14_postmen) | C++17 | 4 ms | 944 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;
vector<set<int>> E;
vector<vector<int>> A;
vector<int> V,P,S;
int t = 1;
void dfs(int u, int p, int s)
{
auto i = E[u].begin();
while(!E[u].empty())
{
int v= *i;
E[v].erase(E[v].find(u));
E[u].erase(i++);
dfs(v, u, s);
}
P.push_back(u);
}
void trace(int i)
{
int k = A.size();
A.push_back({});
A[k].push_back(P[i]);
V[i] = 1;
for(int j=i+1;j<S[i]; j++)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |