# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431523 | saleh | Comparing Plants (IOI20_plants) | C++17 | 0 ms | 0 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;
const int MAXN = 200 * 1000 + 23;//, INF = 1e6;
int n;
vector<int> v[MAXN], ps[MAXN], ind[MAXN];
void init(int k, vector<int> r) {
n = r.size();
if (k == 2) {
int tmp = -1;
for (int i = 1; i <= n; i++) if (r[i % n] != r[i - 1]) tmp = i;
int cnt = 0;
v[0].push_back(tmp);
ps[tmp].push_back(0);
ind[tmp].push_back(0);
for (int i = 1; i <= n; i++) if (r[(tmp + i - 1) % n] == r[(tmp + i) % n]) {
v[cnt].push_back((tmp + i) % n);
ps[(tmp + i) % n].push_back(cnt);
ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
} else {
v[cnt].push_back((tmp + i) % n);
ps[(tmp + i) % n].push_back(cnt);
ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
cnt++;
v[cnt].push_back((tmp + i) % n);
ps[(tmp + i) % n].push_back(cnt);
ind[(tmp + i) % n].push_back(v[cnt].size() - 1);
}
} else if (k * 2 > n && n <= 5000) {
}
return;
}
int compare_plants(int x, int y) {
for (int i = 0; i < ps[x].size(); i++) for (int j = 0; j < ps[y].size(); j++) if (ps[x][i] == ps[y][j])
return (r[x] == ((ind[x][i] < ind[y][i])? 1: 0))? -1: 1;
return 0;
}
//int main() {}//