oj.uz

Submission #219557

# Submission time Handle Problem Language Result Execution time Memory
219557 2020-04-05T14:48:58 Z quocnguyen1012 Swimming competition (LMIO18_plaukimo_varzybos) C++14
100 / 100
 564 ms 13048 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1e6 + 5;

int N, a[maxn], l, r;

bool check(int diff)
{
  //cerr << diff << '\n';
  int i = 1;
  deque<int> gr;
  gr.pb(0);
  while(i <= N && gr.size()){
    if(i - gr.front() >= l){
      if(i - gr.front() <= r && a[i] - a[gr.front() + 1] <= diff)
        gr.pb(i), ++i;
      else gr.pop_front();
    }
    else ++i;
  }
  return (gr.size() && gr.back() == N);
}

signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  cin >> N >> l >> r;
  for(int i = 1; i <= N; ++i)
    cin >> a[i];
  sort(a + 1, a + 1 + N);
  int lo = 0, hi = 1e6, mid;
  while(lo <= hi){
    mid = (lo + hi) / 2;
    if(check(mid)) hi = mid - 1;
    else lo = mid + 1;
  }
  cout << lo;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 21 ms 1408 KB Output is correct
3 Correct 7 ms 416 KB Output is correct
4 Correct 281 ms 11008 KB Output is correct
5 Correct 272 ms 11128 KB Output is correct
6 Correct 31 ms 1408 KB Output is correct
7 Correct 224 ms 9848 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 21 ms 1408 KB Output is correct
3 Correct 7 ms 416 KB Output is correct
4 Correct 281 ms 11008 KB Output is correct
5 Correct 272 ms 11128 KB Output is correct
6 Correct 31 ms 1408 KB Output is correct
7 Correct 224 ms 9848 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 13 ms 640 KB Output is correct
12 Correct 17 ms 640 KB Output is correct
13 Correct 21 ms 896 KB Output is correct
14 Correct 30 ms 1144 KB Output is correct
15 Correct 166 ms 5112 KB Output is correct
16 Correct 256 ms 8824 KB Output is correct
17 Correct 35 ms 1152 KB Output is correct
18 Correct 21 ms 896 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 426 ms 11004 KB Output is correct
21 Correct 440 ms 11060 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 21 ms 1408 KB Output is correct
3 Correct 7 ms 416 KB Output is correct
4 Correct 281 ms 11008 KB Output is correct
5 Correct 272 ms 11128 KB Output is correct
6 Correct 31 ms 1408 KB Output is correct
7 Correct 224 ms 9848 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 13 ms 640 KB Output is correct
12 Correct 17 ms 640 KB Output is correct
13 Correct 21 ms 896 KB Output is correct
14 Correct 30 ms 1144 KB Output is correct
15 Correct 166 ms 5112 KB Output is correct
16 Correct 256 ms 8824 KB Output is correct
17 Correct 35 ms 1152 KB Output is correct
18 Correct 21 ms 896 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 426 ms 11004 KB Output is correct
21 Correct 440 ms 11060 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 17 ms 768 KB Output is correct
33 Correct 179 ms 6144 KB Output is correct
34 Correct 156 ms 5500 KB Output is correct
35 Correct 564 ms 13048 KB Output is correct
36 Correct 276 ms 13048 KB Output is correct
37 Correct 302 ms 12664 KB Output is correct
38 Correct 211 ms 6648 KB Output is correct