Submission #300807

#TimeUsernameProblemLanguageResultExecution timeMemory
300807IgorIComparing Plants (IOI20_plants)C++17
0 / 100
1 ms256 KiB
#include <bits/stdc++.h>

using namespace std;

int n, k;
vector<int> r;

void init(int _k, vector<int> _r)
{
    n = _r.size();
    r = _r;
    k = _k;
}

int compare_plants(int x, int y)
{
    if ((x + 1) % n == y)
    {
        if (r[x]) return 1;
        else return -1;
    }
    if ((y + 1) % n == x)
    {
        if (r[y]) return -1;
        else 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...