# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805682 | Jkap | Comparing Plants (IOI20_plants) | C++14 | 59 ms | 8680 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 si unordered_set<int>
#define vi vector<int>
int di[200005];
int ri[200005];
void init(int k, vi r) {
int x=0;
int n = r.size();
for (int i=n-1; i>=0; i--) {
if (r[i] != r[n-1]) {
x = i+1;
break;
}
}
int curr = x;
for (int i=x+n-1; i>=x; i--) {
if (r[i%n] == r[curr]) {
curr = (i+1) %n;
}
di[i%n] = curr;
ri[i%n] = r[i%n];
}
}
# | 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... |