Submission #1222182

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

plants

#include <bits/stdc++.h>
using namespace std;

vector<int> r;
int n, k;

void init(int kk, std::vector<int> rr) {
    r = rr;
    n = r.size();
    k = kk;
}

bool in_window(int from, int to) {
    // Returns true if 'to' is in the next k-1 plants after 'from'
    int dist = (to - from + n) % n;
    return 1 <= dist && dist <= k-1;
}

int compare_plants(int x, int y) {
    if (in_window(x, y)) {
        if (r[x] == 0) return 1;
        if (r[x] == k-1) return -1;
    }
    if (in_window(y, x)) {
        if (r[y] == 0) return -1;
        if (r[y] == k-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