Submission #1239604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239604		Ghulam_Junaid	Comparing Plants (IOI20_plants)	C++20	0 / 100	0 ms	328 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"
// #include "grader.cpp"
using namespace std;

const int N = 2e5 + 100;
int n, k, par[N];
vector<int> r;

void init(int kk, vector<int> rr) {
    n = r.size(), k = kk, r = rr;
    par[2 * n - 1] = 2 * n;
    for (int i = 2 * n - 2; i >= 0; i --){
        if ((r[i % n] == r[(i + 1) % n]))
            par[i] = par[i + 1];
        else
            par[i] = i + 1;
    }
	return;
}

int compare_plants(int x, int y) {
    if (x > y) swap(x, y);
    if (y <= par[x]){
        if (r[x]) return -1;
        return 1;
    }
    if (x + n <= par[y]){
        if (r[y]) return 1;
        return -1;
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25