# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
196966 | mahmoudbadawy | Pipes (BOI13_pipes) | C++17 | 275 ms | 29432 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>
#define F first
#define S second
using namespace std;
const int M=5e5+5;
const int N=1e5+5;
int n,m;
int ans[M],arr[N],co[N];
vector<pair<int,int> > adj[N];
int cur;
vector<pair<int,int> > adj2[M];
int vis[N];
int dfs1(int node,int p,int co,int pa)
{
if(co==cur) return 0;
for(auto i:adj2[node])
{
if(i.F==pa) continue;
return i.S*p+dfs1(i.F,-1*p,co+1,node);
}
}
void dfs2(int node,int co,int pa)
{
if(co==cur) return;
for(auto i:adj2[node])
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |