Submission #1015031

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015031		u_suck_o	Comparing Plants (IOI20_plants)	C++17	5 / 100	68 ms	8272 KiB

plants

#include "bits/stdc++.h"
#include "plants.h"
#define MAXN 200005

using namespace std;
int pref[MAXN];
int n;

void init(int k, vector<int> r) {
    n = r.size();
    pref[0] = r[0];
    for (int i = 1; i < n; i++)
        pref[i] = pref[i-1] + r[i];
    return;
}

int compare_plants(int x, int y) {
    if (x == 0) {
        if (pref[y-1] == 0) return 1;
        if (pref[y-1] == y) return -1;
        if (pref[n-1] - pref[y-1] == n-y) return 1;
        if (pref[n-1] - pref[y-1] == 0) return -1;
    } else {
        if (pref[y-1] - pref[x-1] == 0) return 1;
        if (pref[y-1] - pref[x-1] == y-x) return -1;
        if (pref[n-1] - pref[y-1] == n-y && pref[x-1] == x) return 1;
        if (pref[n-1] - pref[y-1] == 0 && pref[x-1] == 0) 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