Submission #302025

#	Time	Username	Problem	Language	Result	Execution time	Memory
302025		VEGAnn	Comparing Plants (IOI20_plants)	C++14	0 / 100	3 ms	544 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
const int N = 200100;
const int oo = 2e9;
vector<int> vc;
int per[N];

void init(int k, vector<int> r) {
    int n = sz(r);

    assert(2 * k > n);

    if (n > 5){
        while (1) {}
    }

    for (int it = n - 1; it >= 0; it--){
        vc.clear();

        for (int i = 0; i < n; i++)
            if (r[i] == 0)
                vc.PB(i);

        int cand = -1, cnt = 0;

        for (int it = 0; it < sz(vc); it++){
            int cur = vc[it];
            int pre = vc[(it + sz(vc) - 1) % sz(vc)];

            if (pre < cur){
                if (cur - pre + n < k){
                    cand = cur;
                    cnt++;
                }
            } else {
                if (cur - pre < k){
                    cand = cur;
                    cnt++;
                }
            }
        }

        if (cnt > 1){
            while (1) {}
        }

        per[cand] = it;
        r[cand] = oo;

        for (int i = 1, loc = cand; i < k; i++){
            loc = (loc + n - 1) % n;

            r[loc]--;
        }
    }

    return;
}

int compare_plants(int x, int y) {
    return (per[x] > per[y] ? 1 : -1);
}

• 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