Submission #1222221

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222221		kargneq	Comparing Plants (IOI20_plants)	C++20	14 / 100	4094 ms	5704 KiB

plants

#include <vector>
using namespace std;

vector<int> height;
int n, k;

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

    vector<int> rr = r;
    vector<bool> used(n, false);

    for (int h = n; h >= 1; --h) {
        int idx = -1;
        for (int i = 0; i < n; ++i) {
            if (used[i]) continue;
            if (rr[i] == 0) {
                bool ok = true;
                for (int j = 1; j < k; ++j) {
                    int prev = (i - j + n) % n;
                    if (!used[prev] && rr[prev] == 0) {
                        ok = false;
                        break;
                    }
                }
                if (ok) {
                    idx = i;
                    break; // always pick the smallest such index
                }
            }
        }
        if (idx == -1) break; // should not happen for valid input
        height[idx] = h;
        used[idx] = true;
        for (int j = 0; j < k; ++j) {
            int prev = (idx - j + n) % n;
            if (!used[prev])
                rr[prev]--;
        }
    }
}

int compare_plants(int x, int y) {
    if (height[x] > height[y]) return 1;
    if (height[x] < height[y]) return -1;
    return 0;
}

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