Submission #1035391

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035391		Zicrus	Comparing Plants (IOI20_plants)	C++17	0 / 100	45 ms	5804 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"
using namespace std;

typedef long long ll;

vector<ll> lnk;
vector<int> a;

ll find(ll a) {
    if (lnk[a] != a) lnk[a] = find(lnk[a]);
    return lnk[a];
}

void unite(ll a, ll b) {
    a = find(a); b = find(b);
    lnk[b] = a;
}

bool same(ll a, ll b) {
    return find(a) == find(b);
}

void init(int k, vector<int> r) {
    ll n = r.size();
    lnk = vector<ll>(n);
    for (int i = 0; i < n; i++) lnk[i] = i;
    for (int i = n-1; i >= 0; i--) {
        int o = (i+1) % n;
        if (r[i] == r[o]) unite(i, o);
    }
    lnk[lnk[0]] = 0;
    lnk[0] = 0;
    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 mul = 1;
    if (find(y-1) == 0 && find(x) == 0) { swap(x, y); mul = -1; }

    if (same(x, (y-1+n)%n)) {
         return (a[x] ? -1 : 1) * mul;
    }
    if (same((x-1+n)%n, y)) {
        return (!a[y] ? -1 : 1) * mul;
    }
    return 0;
}

• 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