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;
#define debug(x) cerr << #x << ": " << x << endl;
#define sep ' '
void add(int u, int v);
const int MAXN = 4e5 + 10;
int R[MAXN], n, k, L[MAXN];
void init(int k_, std::vector<int> r) {
k = k_;
n = r.size();
for (int i = 0; i < n; i++)
R[i] = r[i];
L[n - 1] = 1;
for (int i = n - 2; i >= 0; i--)
L[i] = (R[i] == R[i + 1] ? L[i + 1] + 1 : 1);
}
int compare_plants(int x, int y) {
if (R[x] < R[y]) return 1;
if (R[x] > R[y]) return -1;
return 0;
}
# | 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... |