Submission #300828

#	Time	Username	Problem	Language	Result	Execution time	Memory
300828		IgorI	Comparing Plants (IOI20_plants)	C++17	0 / 100	1 ms	256 KiB

plants

#include <bits/stdc++.h>

using namespace std;

const int N = 500000;
int n, k;
vector<int> r;
int p[N];

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

int compare_plants(int x, int y)
{
    if (x < y)
    {
        if (p[y - 1] - p[x - 1] == 0)
        {
            return -1;
        }
        if (p[y - 1] - p[x - 1] == y - x)
        {
            return 1;
        }
        if (p[n - 1] - p[y - 1] + p[x - 1] == 0)
        {
            return 1;
        }
        if (p[n - 1] - p[y - 1] + p[x - 1] == 0)
        {
            return -1;
        }
        return 0;
    }
    return -2;
}

• 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