oj.uz

Submission #1071632

# Submission time Handle Problem Language Result Execution time Memory
1071632 2024-08-23T09:28:48 Z Ignut Comparing Plants (IOI20_plants) C++17
0 / 100
 1 ms 432 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 (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
0 / 5.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 #2
0 / 14.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 #3
0 / 13.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 #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 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 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -