Submission #377582

#TimeUsernameProblemLanguageResultExecution timeMemory
377582marat0210Comparing Plants (IOI20_plants)C++14
5 / 100
114 ms8292 KiB
#include <plants.h>
#include <bits/stdc++.h>

using namespace std;

vector <int> s;
int n;

void init(int k, vector <int> r)
{
    n = r.size();
    s.push_back(0);
    for (int i: r) {
        s.push_back(s.back() + i);
    }
}

int compare_plants(int x, int y)
{
    if (x > y) return -compare_plants(y, x);
    if (s[x] == s[y]) return 1;
    if (s[y] == s[n] and s[0] == s[x]) return -1;
    if (s[x] - x == s[y] - y) return -1;
    if (s[y] - y == s[n] - n and s[0] == s[x] - x) return 1;
    return 0;
}




#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...