oj.uz

Submission #262220

# Submission time Handle Problem Language Result Execution time Memory
262220 2020-08-12T13:36:47 Z Haunted_Cpp Swimming competition (LMIO18_plaukimo_varzybos) C++17
60 / 100
 2000 ms 14944 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
 
const int N = 1e6 + 5;
int a [N], dp [N];
 
 
int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, mn, mx;
  cin >> n >> mn >> mx;
  FOR (i, 1, n + 1) cin >> a[i];
  sort (a, a + n + 1);
  FOR (i, 1, N) dp[i] = 1e9;
  dp[0] = 0;
  int last_one = 0;
  FOR (i, mn, n + 1) {
    pair<int, int> best_way = {1e9, -1};
    ROF (j, i - mn, max (last_one, i - mx)) {
      pair<int, int> cur = { max (dp[j], a[i] - a[j + 1]), j };
      best_way = min(best_way, cur);
      dp[i] = min (dp[i], max (dp[j], a[i] - a[j + 1]));
      if (a[i] - a[j + 1] >= dp[i]) break;
    }
    last_one = best_way.second;
  }
  cout << dp[n] << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 16 ms 5376 KB Output is correct
3 Correct 4 ms 4352 KB Output is correct
4 Correct 193 ms 14840 KB Output is correct
5 Correct 199 ms 14928 KB Output is correct
6 Correct 21 ms 5376 KB Output is correct
7 Correct 172 ms 13932 KB Output is correct
8 Correct 3 ms 4224 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 16 ms 5376 KB Output is correct
3 Correct 4 ms 4352 KB Output is correct
4 Correct 193 ms 14840 KB Output is correct
5 Correct 199 ms 14928 KB Output is correct
6 Correct 21 ms 5376 KB Output is correct
7 Correct 172 ms 13932 KB Output is correct
8 Correct 3 ms 4224 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct
11 Correct 8 ms 4480 KB Output is correct
12 Correct 8 ms 4608 KB Output is correct
13 Correct 17 ms 4736 KB Output is correct
14 Correct 18 ms 5120 KB Output is correct
15 Correct 74 ms 9080 KB Output is correct
16 Correct 170 ms 12892 KB Output is correct
17 Correct 20 ms 5120 KB Output is correct
18 Correct 19 ms 4992 KB Output is correct
19 Correct 3 ms 4224 KB Output is correct
20 Correct 284 ms 14944 KB Output is correct
21 Correct 245 ms 14840 KB Output is correct
22 Correct 3 ms 4224 KB Output is correct
23 Correct 3 ms 4224 KB Output is correct
24 Correct 3 ms 4224 KB Output is correct
25 Correct 3 ms 4224 KB Output is correct
26 Correct 3 ms 4224 KB Output is correct
27 Correct 3 ms 4224 KB Output is correct
28 Correct 3 ms 4224 KB Output is correct
29 Correct 3 ms 4224 KB Output is correct
30 Correct 4 ms 4224 KB Output is correct
31 Correct 3 ms 4224 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4224 KB Output is correct
2 Correct 16 ms 5376 KB Output is correct
3 Correct 4 ms 4352 KB Output is correct
4 Correct 193 ms 14840 KB Output is correct
5 Correct 199 ms 14928 KB Output is correct
6 Correct 21 ms 5376 KB Output is correct
7 Correct 172 ms 13932 KB Output is correct
8 Correct 3 ms 4224 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 3 ms 4224 KB Output is correct
11 Correct 8 ms 4480 KB Output is correct
12 Correct 8 ms 4608 KB Output is correct
13 Correct 17 ms 4736 KB Output is correct
14 Correct 18 ms 5120 KB Output is correct
15 Correct 74 ms 9080 KB Output is correct
16 Correct 170 ms 12892 KB Output is correct
17 Correct 20 ms 5120 KB Output is correct
18 Correct 19 ms 4992 KB Output is correct
19 Correct 3 ms 4224 KB Output is correct
20 Correct 284 ms 14944 KB Output is correct
21 Correct 245 ms 14840 KB Output is correct
22 Correct 3 ms 4224 KB Output is correct
23 Correct 3 ms 4224 KB Output is correct
24 Correct 3 ms 4224 KB Output is correct
25 Correct 3 ms 4224 KB Output is correct
26 Correct 3 ms 4224 KB Output is correct
27 Correct 3 ms 4224 KB Output is correct
28 Correct 3 ms 4224 KB Output is correct
29 Correct 3 ms 4224 KB Output is correct
30 Correct 4 ms 4224 KB Output is correct
31 Correct 3 ms 4224 KB Output is correct
32 Correct 176 ms 4736 KB Output is correct
33 Execution timed out 2025 ms 9720 KB Time limit exceeded
34 Halted 0 ms 0 KB -