Submission #1239630

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239630		Ghulam_Junaid	Comparing Plants (IOI20_plants)	C++20	5 / 100	47 ms	6604 KiB

plants

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

const int N = 4e5 + 100;
int nn, K, par[N];
vector<int> R;

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

int compare_plants(int x, int y) {
    if (y <= par[x]){
        if (R[x]) return -1;
        return 1;
    }
    if (x + nn <= par[y]){
        if (R[y]) return 1;
        return -1;
    }
    return 0;
}

• Subtask 1: 5 / 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