Submission #808602

#	Time	Username	Problem	Language	Result	Execution time	Memory
808602		drdilyor	Comparing Plants (IOI20_plants)	C++17	14 / 100	4082 ms	7204 KiB

plants

#include<bits/stdc++.h>
#include "plants.h"
using namespace std;
using ll = long long;
const int inf = 1e9;

#define debug(args...) cout << "[" << #args << "]: "; debug_out(args);
void debug_out() {
    cout << endl;
}
template<typename H, typename... T>
void debug_out(H h, T... t) {
    cout << h << ", ";
    debug_out(t...);
}

void vis() {
    int n = 7;
    int k = 4;

    vector<int> arr(n);
    iota(arr.begin(), arr.end(), 1);
    map<vector<int>, vector<int>> mp;
    do {
        vector<int> r;
        for (int i = 0; i < n; i++) {
            int cnt = 0;
            for (int j = i; j < i + k; j++)
                cnt += arr[j % n] > arr[i];
            r.push_back(cnt);
        }
        mp[r] = arr;
    }while (next_permutation(arr.begin(), arr.end()));
    for (auto[r, arr] : mp) {
        for (int i : r) cout << i << ' ';
        cout << "= ";
        for (int i : arr) cout << i << ' ';
        cout << endl;
    }

	return;
}

int n;
vector<int> p;

int f(int i) {
    return i < 0 ? i + n : i >= n ? i - n : i;
}

void init(int k, std::vector<int> r) {
    n = r.size();
    p.resize(n);
    vector<int> done(n);

    for (int step = 0; step < n; step++) {
        vector<int> bad(n);
        int p0 = -1;
        for (int i = 0; i < n; i++)
            if (!done[i] && r[i] == 0) p0 = i;
        p0 -= n;
        int found = -1;
        for (int i = 0; i < n; i++) {
            if (done[i]) continue;
            if (r[i] == 0 && p0 <= i - k) {
                found = i;
                break;
            }
            if (r[i] == 0) p0 = i;
        }

        p[found] = n - step;
        done[found] = 1;
        for (int j = 1; j < k; j++)
            r[f(found - j)]--;
    }
}


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

• 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