# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348829 | JovanK26 | Poklon (COCI17_poklon7) | C++14 | 43 ms | 12396 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;
int n,m;
int f[200001];
int maks[200001];
vector<int> v[200001];
void dfs(int node,int dep)
{
if(node>=n)
{
maks[dep]=max(maks[dep],f[node]);
}
else
{
dfs(v[node][0],dep+1);
dfs(v[node][1],dep+1);
}
}
int main()
{
memset(maks,-1,sizeof(maks));
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a,b;
cin >> n;
m=n;
for(int i=0;i<n;i++)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |