oj.uz

Submission #364257

# Submission time Handle Problem Language Result Execution time Memory
364257 2021-02-08T15:46:01 Z _martynas Swimming competition (LMIO18_plaukimo_varzybos) C++11
100 / 100
 513 ms 13036 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb push_back

const ll INF = 1e13;
const int MAX_N = 1e6+5;

int N, A, B;
int T[MAX_N];

bool check_t(int c_t)
{
    deque<int> I;
    I.pb(-1);

    int i = 0;

    while(i < N && !I.empty())
    {
        int curr_i = I.front();
        if(i - curr_i >= A)
        {
            if(i - curr_i <= B && T[i] - T[curr_i + 1] <= c_t)
            {
                I.pb(i);
                i++;
            }
            else
            {
                I.pop_front();
            }
        }
        else
        {
            i++;
        }
    }

    return !I.empty() && I.back() == N-1;
}

int bin_search()
{
    int l = 0, r = T[N-1];
    int mid;
    while(l < r)
    {
        mid = l + (r-l) / 2;
        bool can = check_t(mid);
        if(can)
        {
            r = mid;
        }
        else
        {
            l = mid+1;
        }
    }
    return l;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    scanf("%d%d%d", &N, &A, &B);

    for(int i = 0; i < N; i++)
    {
        scanf("%d", &T[i]);
    }

    sort(T, T + N);

    int ans = bin_search();

    cout << ans << endl;

    return 0;
}

Compilation message

plaukimo_varzybos.cpp: In function 'int main()':
plaukimo_varzybos.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |     scanf("%d%d%d", &N, &A, &B);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plaukimo_varzybos.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   76 |         scanf("%d", &T[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 15 ms 1388 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 244 ms 10988 KB Output is correct
5 Correct 234 ms 10988 KB Output is correct
6 Correct 24 ms 1388 KB Output is correct
7 Correct 200 ms 9964 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 408 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 15 ms 1388 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 244 ms 10988 KB Output is correct
5 Correct 234 ms 10988 KB Output is correct
6 Correct 24 ms 1388 KB Output is correct
7 Correct 200 ms 9964 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 408 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 8 ms 620 KB Output is correct
22 Correct 9 ms 748 KB Output is correct
23 Correct 15 ms 876 KB Output is correct
24 Correct 24 ms 1260 KB Output is correct
25 Correct 109 ms 5100 KB Output is correct
26 Correct 257 ms 8940 KB Output is correct
27 Correct 30 ms 1260 KB Output is correct
28 Correct 16 ms 1004 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 400 ms 11104 KB Output is correct
31 Correct 370 ms 10988 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 15 ms 1388 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 244 ms 10988 KB Output is correct
5 Correct 234 ms 10988 KB Output is correct
6 Correct 24 ms 1388 KB Output is correct
7 Correct 200 ms 9964 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 8 ms 620 KB Output is correct
12 Correct 9 ms 748 KB Output is correct
13 Correct 15 ms 876 KB Output is correct
14 Correct 24 ms 1260 KB Output is correct
15 Correct 109 ms 5100 KB Output is correct
16 Correct 257 ms 8940 KB Output is correct
17 Correct 30 ms 1260 KB Output is correct
18 Correct 16 ms 1004 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 400 ms 11104 KB Output is correct
21 Correct 370 ms 10988 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 408 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 10 ms 748 KB Output is correct
33 Correct 170 ms 6180 KB Output is correct
34 Correct 134 ms 5676 KB Output is correct
35 Correct 513 ms 13036 KB Output is correct
36 Correct 257 ms 13036 KB Output is correct
37 Correct 260 ms 12780 KB Output is correct
38 Correct 186 ms 6892 KB Output is correct