# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128726 | SamAnd | Railway (BOI17_railway) | C++17 | 315 ms | 46660 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;
const int N = 100005;
int n, m, k;
vector<int> a[N];
vector<int> t[N];
vector<int> b[N];
int u[N];
int q[N];
map<int, int> mp[N];
vector<int> ans;
void dfs(int x, int p, int ki)
{
for (int i = 0; i < b[x].size(); ++i)
{
int y = b[x][i];
mp[x][y]++;
if (mp[x][y] == u[y])
++q[x];
}
for (int i = 0; i < a[x].size(); ++i)
{
int h = a[x][i];
if (h == p)
continue;
dfs(h, x, t[x][i]);
if (mp[h].size() > mp[x].size())
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |