# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941397 | Darren0724 | File Paths (BOI15_fil) | C++17 | 102 ms | 33108 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 LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=6005;
const int M=1000005;
const int INF=1e9;
int n,m,l,p;
vector<int> v(N),adj[N],ans(N),t(M,0),t1(M,0);
void dfs(int k,int pa){
for(int j:adj[k]){
if(j==pa)continue;
v[j]+=v[k];
dfs(j,k);
}
}
vector<int> h,h1;
vector<int> rec[N];
void dfs1(int k,int pa){
for(int j:h){
if(l-(v[k]-j)>=0&&t[l-(v[k]-j)]==1){
ans[k]=1;
}
}
h.push_back(v[k]);
for(int j:adj[k]){
if(j==pa)continue;
dfs1(j,k);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |