# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22981 | model_code | Editor (BOI15_edi) | C++11 | 586 ms | 266708 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.
// Jan Kanty Milczek
#include <cstdio>
int max(int x, int y) {
if (x > y)
return x;
else
return y;
}
int max(int x, int y, int z) {
return max(x, max(y, z));
}
struct PersTree {
PersTree *l, *r;
int key;
int value;
int max_value;
int find(int) const;
PersTree *add(int, int) const;
PersTree(PersTree *_l, PersTree *_r, int _key, int _value, int _max_value) : l(_l), r(_r), key(_key), value(_value), max_value(_max_value) {}
};
int safe_max_value(PersTree *x) {
if (x == NULL)
return 0;
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... |