oj.uz

Submission #1071634

# Submission time Handle Problem Language Result Execution time Memory
1071634 2024-08-23T09:29:27 Z Ignut Comparing Plants (IOI20_plants) C++17
5 / 100
 64 ms 9180 KB 
// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int n, k;

vector<int> r;
vector<int> cntInRow;

void init(int K, vector<int> R) {
    n = R.size();
    k = K;
    r = R;
    for (int val : R) r.push_back(val);
    cntInRow.resize(2 * n);
    cntInRow[2 * n - 1] = 1;
    for (int i = 2 * n - 2; i >= 0; i --)
        cntInRow[i] = (r[i] == r[i + 1] ? cntInRow[i + 1] + 1 : 1);
}

int compare_plants(int x, int y) {
    if (k == 2) {
        if (x + cntInRow[x] >= y)
            return r[x] == 1 ? -1 : 1;
        if (y + cntInRow[y] - n >= x)
            return r[y] == 1 ? 1 : -1;
        return 0;
    }
    if (x + k - 1 >= y) {
        if (x == 0) return 1;
        if (x == k - 1) return -1;
    }
    if (y + k - 1 - n >= x) {
        if (y == 0) return -1;
        if (y == k - 1) return 1;
    }
    return 0;
}

Subtask #1
5.0 / 5.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 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 32 ms 3856 KB Output is correct
7 Correct 50 ms 4880 KB Output is correct
8 Correct 50 ms 9028 KB Output is correct
9 Correct 64 ms 9180 KB Output is correct
10 Correct 49 ms 9024 KB Output is correct
11 Correct 49 ms 9104 KB Output is correct
12 Correct 52 ms 9024 KB Output is correct
13 Correct 50 ms 9032 KB Output is correct
14 Correct 49 ms 9064 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 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 344 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 436 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 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 #7
0 / 25.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 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 32 ms 3856 KB Output is correct
7 Correct 50 ms 4880 KB Output is correct
8 Correct 50 ms 9028 KB Output is correct
9 Correct 64 ms 9180 KB Output is correct
10 Correct 49 ms 9024 KB Output is correct
11 Correct 49 ms 9104 KB Output is correct
12 Correct 52 ms 9024 KB Output is correct
13 Correct 50 ms 9032 KB Output is correct
14 Correct 49 ms 9064 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Incorrect 1 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -