# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301572 | kevinsogo | Comparing Plants (IOI20_plants) | C++17 | 1593 ms | 137536 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 "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int mod(int a, int n) {
if ((a %= n) < 0) a += n;
return a;
}
int n, k;
int dist(int i, int j) {
return mod(j - i - 1, n) + 1;
}
struct MinTree {
int i, j;
int m, a = 0;
MinTree *l, *r;
MinTree(const vector<int>& v, int i, int j): i(i), j(j) {
if (j - i == 1) {
m = v[i];
l = r = nullptr;
} else {
int k = i + j >> 1;
l = new MinTree(v, i, k);
r = new MinTree(v, k, j);
m = min(l->m, r->m);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |