oj.uz

Submission #1033137

# Submission time Handle Problem Language Result Execution time Memory
1033137 2024-07-24T13:13:10 Z Zicrus Comparing Plants (IOI20_plants) C++17
0 / 100
 4000 ms 6492 KB 
#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);
    }
    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[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;
        }
    }
    if (same(x, (y-1+n)%n)) {
         return (a[x] ? -1 : 1);
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 33 ms 3052 KB Output is correct
7 Correct 125 ms 3428 KB Output is correct
8 Correct 66 ms 6484 KB Output is correct
9 Correct 140 ms 6492 KB Output is correct
10 Correct 739 ms 6480 KB Output is correct
11 Execution timed out 4048 ms 6480 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 33 ms 3052 KB Output is correct
7 Correct 125 ms 3428 KB Output is correct
8 Correct 66 ms 6484 KB Output is correct
9 Correct 140 ms 6492 KB Output is correct
10 Correct 739 ms 6480 KB Output is correct
11 Execution timed out 4048 ms 6480 KB Time limit exceeded
12 Halted 0 ms 0 KB -