oj.uz

Submission #713007

# Submission time Handle Problem Language Result Execution time Memory
713007 2023-03-20T19:42:20 Z tamyte Swimming competition (LMIO18_plaukimo_varzybos) C++14
100 / 100
 429 ms 13020 KB 
#include <bits/stdc++.h>


using namespace std;
#define sz(x) (int)(x).size()
void setIO(string name = "")
{
    cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
    if (sz(name))
    {
        freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
        freopen((name + ".out").c_str(), "w", stdout);
    }
}

/*----------------------------------*/


bool ok(int max_diff, vector<int>& arr, int left, int right) {
    queue<int> q;
    q.push(-1);
    int i = left - 1;
    while (i < arr.size() && q.size()) {
        if (i - q.front() >= left) {
            if (i - q.front() <= right && arr[i] - arr[q.front() + 1] <= max_diff) {
                q.push(i);
                i++;
            } else {
                q.pop();
            }
        } else {
            i++;
        }
    }
    return (q.size() && q.back() == arr.size() - 1);
}



int main()
{
    setIO("");
    int n, a, b;
    cin >> n >> a >> b;
    vector<int> arr(n);
    for (auto& x : arr) cin >> x;
    sort(arr.begin(), arr.end());
    int l = 0, r = *max_element(arr.begin(), arr.end());
    while (l < r) {
        int m = (l + r) / 2;
        if (ok(m, arr, a, b)) r = m;
        else l = m + 1;
    }
    cout << l;
}

Compilation message

plaukimo_varzybos.cpp: In function 'bool ok(int, std::vector<int>&, int, int)':
plaukimo_varzybos.cpp:23:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     while (i < arr.size() && q.size()) {
      |            ~~^~~~~~~~~~~~
plaukimo_varzybos.cpp:35:34: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     return (q.size() && q.back() == arr.size() - 1);
      |                         ~~~~~~~~~^~~~~~~~~~~~~~~~~
plaukimo_varzybos.cpp: In function 'void setIO(std::string)':
plaukimo_varzybos.cpp:11:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plaukimo_varzybos.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 13 ms 1348 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 208 ms 10880 KB Output is correct
5 Correct 189 ms 10868 KB Output is correct
6 Correct 24 ms 1352 KB Output is correct
7 Correct 168 ms 9840 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 13 ms 1348 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 208 ms 10880 KB Output is correct
5 Correct 189 ms 10868 KB Output is correct
6 Correct 24 ms 1352 KB Output is correct
7 Correct 168 ms 9840 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 324 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 7 ms 608 KB Output is correct
22 Correct 6 ms 596 KB Output is correct
23 Correct 12 ms 852 KB Output is correct
24 Correct 20 ms 1108 KB Output is correct
25 Correct 79 ms 5068 KB Output is correct
26 Correct 217 ms 8824 KB Output is correct
27 Correct 26 ms 1108 KB Output is correct
28 Correct 12 ms 840 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 343 ms 10872 KB Output is correct
31 Correct 309 ms 11000 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 13 ms 1348 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 208 ms 10880 KB Output is correct
5 Correct 189 ms 10868 KB Output is correct
6 Correct 24 ms 1352 KB Output is correct
7 Correct 168 ms 9840 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 312 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 7 ms 608 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 12 ms 852 KB Output is correct
14 Correct 20 ms 1108 KB Output is correct
15 Correct 79 ms 5068 KB Output is correct
16 Correct 217 ms 8824 KB Output is correct
17 Correct 26 ms 1108 KB Output is correct
18 Correct 12 ms 840 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 343 ms 10872 KB Output is correct
21 Correct 309 ms 11000 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 324 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 7 ms 724 KB Output is correct
33 Correct 140 ms 6080 KB Output is correct
34 Correct 106 ms 5480 KB Output is correct
35 Correct 429 ms 13004 KB Output is correct
36 Correct 214 ms 13020 KB Output is correct
37 Correct 204 ms 12672 KB Output is correct
38 Correct 156 ms 6632 KB Output is correct