# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823971 | thimote75 | Comparing Plants (IOI20_plants) | C++14 | 4051 ms | 6720 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 idata = vector<int>;
void shift (idata &r, int count) {
idata h;
for (int i = count; i < r.size(); i ++)
h.push_back(r[i]);
for (int i = 0; i < count; i ++)
h.push_back(r[i]);
r.swap(h);
}
idata A;
void init(int k, idata r) {
int n = r.size();
A.resize(n);
int s = 0;
for (int v = n - 1; v >= 0; v --) {
int p = 0; int m = 1e9;
for (int i = 0; i < n; i ++) {
if (r[i] > m) continue ;
if (r[i] == m) {
int d = n + p - i;
if (d >= k) continue ;
}
p = i;
m = r[i];
}
r[p] = 1e9;
for (int g = p - 1; g > p - k; g --) r[(g + n) % n] --;
A[p] = v;
}
return;
}
int compare_plants(int x, int y) {
int del = A[x] - A[y];
if (del == 0) return 0;
return del / abs(del);
}
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... |