# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300416 | ecnerwala | Comparing Plants (IOI20_plants) | C++17 | 417 ms | 19036 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>
namespace {
class plants_solver {
struct index_data {
int l_to_r;
int l_to_r_2;
int r_to_l;
int r_to_l_2;
};
std::vector<index_data> v;
public:
plants_solver() { }
plants_solver(int N, int K, std::vector<int> R) : v(N) {
using std::min;
using std::max;
assert(N == int(R.size()));
assert(1 <= K && K <= N);
for (int& r : R) assert(0 <= r && r < K);
struct seg_node {
int val;
int ind;
int lazy;
int last_taken;
};
# | 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... |