# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830388 | PoonYaPat | Homework (CEOI22_homework) | C++14 | 243 ms | 201380 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;
string s;
int n,cnt,com[20000005];
bool is_min[2000005];
vector<int> adj[2000005];
int build(int l, int r) {
int now=++cnt;
if (l!=r) {
adj[now].push_back(build(l+4,com[l+3]-1));
adj[now].push_back(build(com[l+3]+1,r-1));
if (s[l+1]=='i') is_min[now]=true;
}
return now;
}
pii dfs(int x) { //return min,max
if (adj[x].size()==0) return pii(1,n);
pii L=dfs(adj[x][0]), R=dfs(adj[x][1]), res;
if (is_min[x]) {
res.first=min(L.first,R.first);
res.second=L.second+R.second-n-1;
} else {
res.first=L.first+R.first;
res.second=max(L.second,R.second);
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... |