Submission #1222177

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222177		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;

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

int compare_plants(int x, int y) {
    // For k = 2, check if y is one of the next two plants after x
    int n1 = (x + 1) % n;
    int n2 = (x + 2) % n;
    if (r[x] == 0 && (y == n1 || y == n2)) return 1;  // x is definitely taller
    if (r[x] == 2 && (y == n1 || y == n2)) return -1; // x is definitely shorter

    // Check if x is one of the next two plants after y
    int yn1 = (y + 1) % n;
    int yn2 = (y + 2) % n;
    if (r[y] == 0 && (x == yn1 || x == yn2)) return -1; // y is definitely taller
    if (r[y] == 2 && (x == yn1 || x == yn2)) return 1;  // y is definitely shorter

    return 0; // inconclusive
}

• 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