# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29336 | tlwpdus | Untitled (POI11_dyn) | C++11 | 1833 ms | 27340 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 pair<int,int> pii;
void upd(pii &a, pii b) {
a.first= min(a.first,b.first);
a.second=max(a.second,b.second);
}
int n, m;
bool chk[300100];
vector<int> lis[300100];
int L, ans;
pii dfs(int here, int p, int c) {
//printf("%d, %d, %d\n",here,p,c);
pii res = pii(c,chk[here]?0:-987654321);
for (auto &there : lis[here]) {
if (there==p) continue;
pii tmp = dfs(there,here,res.first+1);
tmp.first++; tmp.second++;
upd(res,tmp);
}
if (res.second<=L-res.first) res.second = -987654321;
if (res.second==L) {
ans++; //printf("%d!!!!\n",here+1);
res.first = 0;
res.second = -987654321;
}
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... |
# | 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... |