# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771761 | khshg | Comparing Plants (IOI20_plants) | C++14 | 1 ms | 300 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;
vector<int> know, r;
int N;
int goR = 0;
void init(int k, vector<int> _r) {
swap(r, _r);
N = (int)r.size();
for(int i = 0; i + 1 < N; ++i) {
if(r[i] != r[i + 1] && r[i + 1]) {
goR = N - 1 - i;
break;
}
}
rotate(r.rbegin(), r.rbegin() + goR, r.rend());
int cnt = 0;
for(int i = 1; i < N; ++i) {
cnt += (r[i - 1] != r[i] && r[i - 1]);
}
if(cnt == 1) {
for(int i = 0; r[i]; ++i) {
know.push_back(i);
}
for(int i = N - 1; know.size() + 1 < N; --i) {
know.push_back(i);
}
}
return;
}
int compare_plants(int x, int y) {
x += goR;
y += goR;
x %= N;
y %= N;
if((int)know.size()) {
return know[x] < know[y] ? -1 : 1;
}
if(x == 0 && y == N - 1) return r[y] ? 1 : -1;
if(y - x > 1) {
return 0;
}
return r[x] ? -1 : 1;
}
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... |