Submission #932599

#	Time	Username	Problem	Language	Result	Execution time	Memory
932599		EJIC_B_KEDAX	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	604 KiB

plants

#include <bits/stdc++.h>

using ll = long long;

using namespace std;

const int N = 200200;
int level[N];

void init(int k, vector<int> r) {
    int n = r.size();
    int ok = 0, last = -k, lev = n;
    while (ok != n) {
        for (int i = n - 1; i >= n - k; i--) {
            if (!r[i]) {
                last = i - n;
                break;
            }
        }
        for (int i = 0; i < n; i++) {
            if (!r[i]) {
                if (i - last >= k) {
                    level[i] = lev;
                    ok++;
                    for (int j = i - 1; j > i - k; j++) {
                        if (j >= 0) {
                            r[j]--;
                        } else {
                            r[j + n]--;
                        }
                    }
                    r[i] = INT32_MAX;
                }
                last = i;
            }
        }
        lev--;
    }
}

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

• 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