# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073492 | blushingecchigirl | Comparing Plants (IOI20_plants) | C++17 | 0 ms | 348 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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<pair<pair<int, int>, pair<int, int>>> p;
void init(int k, std::vector<int> r) {
int n = r.size(), x;
p.resize(n);
for(int i = 0; i<n; i++) {
if(r[i]!=r[(i+1)%n]) {
x = i;
break;
}
}
int cur = 0, g = 0;
for(int i = x; i<n+x; i++) {
p[i%n].second.first = cur;
if(r[i%n]) cur--;
else cur++;
p[i%n].second.second = cur;
p[i%n].first.first = p[(i+1)%n].first.second = g;
if(r[i%n] != r[(i+1)%n]) g++;
}
return;
}
int compare_plants(int x, int y) {
auto a = p[x].first, b = p[y].first;
if(a.first == b.second) {
if(p[x].second.first>p[y].second.second) return 1;
return -1;
} if(a.second == b.first) {
if(p[x].second.second>p[y].second.first) return 1;
return -1;
}
return 0;
}
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... |