oj.uz

Submission #952752

# Submission time Handle Problem Language Result Execution time Memory
952752 2024-03-24T16:54:59 Z stakaman Swimming competition (LMIO18_plaukimo_varzybos) C++14
10 / 100
 341 ms 11080 KB 
#include <bits/stdc++.h>
using namespace std;

bool canDivide(vector<int>& times, int maxDiff, int A, int B, int N) {
    int groups = 0, i = 0;
    while (i < N) {
        int start_time = times[i];
        int members = 0;
        while (i < N && members < B && times[i] - start_time <= maxDiff) {
            i++;
            members++;
        }
        if (members < A) return false; // Cannot form a valid group
        groups++;
    }
    return true;
}

int main() {
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> times(N);
    for (int& time : times) cin >> time;
    sort(times.begin(), times.end());

    int low = 0, high = times.back() - times.front(), ans = high;
    while (low <= high) {
        int mid = low + (high - low) / 2;
        if (canDivide(times, mid, A, B, N)) {
            ans = mid;
            high = mid - 1;
        } else {
            low = mid + 1;
        }
    }

    cout << ans << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 26 ms 1360 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 296 ms 11080 KB Output is correct
5 Correct 341 ms 11076 KB Output is correct
6 Correct 30 ms 1460 KB Output is correct
7 Correct 291 ms 10016 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.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 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 26 ms 1360 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 296 ms 11080 KB Output is correct
5 Correct 341 ms 11076 KB Output is correct
6 Correct 30 ms 1460 KB Output is correct
7 Correct 291 ms 10016 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 26 ms 1360 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 296 ms 11080 KB Output is correct
5 Correct 341 ms 11076 KB Output is correct
6 Correct 30 ms 1460 KB Output is correct
7 Correct 291 ms 10016 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Halted 0 ms 0 KB -