Submission #1033124

#TimeUsernameProblemLanguageResultExecution timeMemory
1033124Zicrus식물 비교 (IOI20_plants)C++17
0 / 100
4027 ms8028 KiB
#include <bits/stdc++.h>
#include "plants.h"
using namespace std;

typedef long long ll;

vector<int> a;

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

int compare_plants(int x, int y) {
    ll n = a.size();

    ll dir = a[x];
    for (int i = x; i != y; i++) {
        if (dir != a[i]) break;
        if (i == y-1) {
            return dir == 1 ? -1 : 1;
        }
    }
    dir = a[y];
    for (int i = y; i != x; i = (i+1)%n) {
        if (dir != a[i]) break;
        if (i == (x-1+n)%n) {
            return dir == 0 ? -1 : 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...