Submission #572793

#	Time	Username	Problem	Language	Result	Execution time	Memory
572793		kartel	Comparing Plants (IOI20_plants)	C++14	5 / 100	106 ms	16500 KiB

plants

#include <bits/stdc++.h>
//#include "grader.cpp"
#include "plants.h"
#define pb push_back
#define sz(x) (int)x.size()
using namespace std;

const int N = 1e6 + 500;

int le[N], ri[N], n;

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

    vector <vector <int> > g(n);
    for (int i = 0; i < n * 3; i++) {
        if (!r[i % n]) {
            le[i] = (i - 1 >= 0 ? le[i - 1] : -1);
        } else {
            le[i] = i;
        }
    }

    for (int i = n * 3 - 1; i >= 0; i--) {
        if (r[i % n]) {
            ri[i] = ri[i + 1];
        } else {
            ri[i] = i;
        }
    }
}

int compare_plants(int x, int y) {
    if (le[x + n - 1] + 1 <= y && y <= ri[x + n]) {
        return -1;
    }
    if (le[x + n - 1] + 1 <= y + n && y + n <= ri[x + n]) {
        return -1;
    }
    if (le[x + n - 1] + 1 <= y + 2 * n && y + 2 * n <= ri[x + n]) {
        return -1;
    }

    if (le[y + n - 1] + 1 <= x && x <= ri[y + n]) {
        return 1;
    }
    if (le[y + n - 1] + 1 <= x + n && x + n <= ri[y + n]) {
        return 1;
    }
    if (le[y + n - 1] + 1 <= x + 2 * n && x + 2 * n <= ri[y + n]) {
        return 1;
    }

    return 0;
}

• Subtask 1: 5 / 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