# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990862 | alexdumitru | Homework (CEOI22_homework) | C++14 | 121 ms | 163028 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 <iostream>
#include <stack>
#include <vector>
using namespace std;
string s;
vector<int> virgula;
struct Node {
int l, r, sz;
};
Node combine(Node a, Node b, bool isMIN) {
Node ans;
ans.sz = a.sz + b.sz;
if (isMIN) {
ans.l = min(a.l, b.l);
ans.r = a.r + b.r - 1;
} else {
ans.l = a.l + b.l;
ans.r = max(a.r + b.sz, b.r + a.sz);
}
return ans;
}
Node go(int st, int dr) {
if (st == dr) {
//?
return {1, 1, 1};
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... |