Submission #307254

#	Time	Username	Problem	Language	Result	Execution time	Memory
307254		VEGAnn	Comparing Plants (IOI20_plants)	C++14	0 / 100	4062 ms	384 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 = 5010;
const int oo = 2e9;
queue<int> q;
vector<int> vc;
int per[N], mrk[N], tt = 0, n;
bool sml[N][N], g[N][N];

int dist(int fi, int se){
    if (se > fi)
        return se - fi;
    else return se - fi + n;
}

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

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

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

//        if (sz(vc) == 0){
//            while (1) {}
//        }

        int cand = -1, mx = -1;

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

            int dst = dist(pre, cur);

            if (dst > mx){
                mx = dst;
                cand = cur;
                break;
            }
        }

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

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

            r[loc]--;

            if (r[loc] < 0){
                while (1) {}
            }

            if (r[loc] < oo / 2)
                g[cand][loc] = 1;
        }

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

            if (r[loc] < oo / 2)
                g[cand][loc] = 1;
        }
    }

//    for (int i = 0; i < n; i++){
//        tt++;
//
//        q.push(i);
//        mrk[i] = tt;
//
//        while (sz(q)){
//            int v = q.front(); q.pop();
//
//            sml[i][v] = 1;
//
//            for (int u = 0; u < n; u++)
//                if (g[v][u] && mrk[u] < tt){
//                    mrk[u] = tt;
//                    q.push(u);
//                }
//        }
//    }

    return;
}

int compare_plants(int x, int y) {
//    if (sml[x][y]) return 1;
//    if (sml[y][x]) return -1;
//    return 0;
    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