# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683337 | Tenis0206 | Homework (CEOI22_homework) | C++11 | 114 ms | 119864 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;
string s;
int tip[2000005], w[2000005];
int st[2000005],dr[2000005];
pair<int,int> dp[2000005];
int p = 0;
void dfs(int nod)
{
if(tip[nod]==2)
{
dp[nod].first = 1;
dp[nod].second = 1;
w[nod] = 1;
return;
}
dfs(st[nod]);
w[nod] += w[st[nod]];
dfs(dr[nod]);
w[nod] += w[dr[nod]];
if(tip[nod]==0)
{
dp[nod].first = min(dp[st[nod]].first,dp[dr[nod]].first);
# | 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... |