oj.uz

Submission #218253

# Submission time Handle Problem Language Result Execution time Memory
218253 2020-04-01T17:11:32 Z Haunted_Cpp Swimming competition (LMIO18_plaukimo_varzybos) C++17
60 / 100
 2000 ms 14968 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;
  FOR (i, mn, n + 1) {
    ROF (j, i - mn, max (0, i - mx)) { 
      dp[i] = min (dp[i], max (dp[j], a[i] - a[j + 1]));
      if (a[i] - a[j + 1] >= dp[i]) break;
    }
  }
  cout << dp[n] << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 20 ms 5376 KB Output is correct
3 Correct 8 ms 4352 KB Output is correct
4 Correct 217 ms 9212 KB Output is correct
5 Correct 224 ms 9164 KB Output is correct
6 Correct 31 ms 5376 KB Output is correct
7 Correct 199 ms 8824 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 20 ms 5376 KB Output is correct
3 Correct 8 ms 4352 KB Output is correct
4 Correct 217 ms 9212 KB Output is correct
5 Correct 224 ms 9164 KB Output is correct
6 Correct 31 ms 5376 KB Output is correct
7 Correct 199 ms 8824 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 12 ms 4480 KB Output is correct
12 Correct 12 ms 4608 KB Output is correct
13 Correct 18 ms 4736 KB Output is correct
14 Correct 23 ms 5040 KB Output is correct
15 Correct 80 ms 8056 KB Output is correct
16 Correct 184 ms 8440 KB Output is correct
17 Correct 25 ms 5112 KB Output is correct
18 Correct 19 ms 4864 KB Output is correct
19 Correct 7 ms 4224 KB Output is correct
20 Correct 268 ms 9208 KB Output is correct
21 Correct 238 ms 9208 KB Output is correct
22 Correct 7 ms 4224 KB Output is correct
23 Correct 7 ms 4224 KB Output is correct
24 Correct 7 ms 4352 KB Output is correct
25 Correct 7 ms 4352 KB Output is correct
26 Correct 7 ms 4224 KB Output is correct
27 Correct 7 ms 4224 KB Output is correct
28 Correct 7 ms 4224 KB Output is correct
29 Correct 6 ms 4224 KB Output is correct
30 Correct 7 ms 4224 KB Output is correct
31 Correct 7 ms 4224 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 20 ms 5376 KB Output is correct
3 Correct 8 ms 4352 KB Output is correct
4 Correct 217 ms 9212 KB Output is correct
5 Correct 224 ms 9164 KB Output is correct
6 Correct 31 ms 5376 KB Output is correct
7 Correct 199 ms 8824 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 12 ms 4480 KB Output is correct
12 Correct 12 ms 4608 KB Output is correct
13 Correct 18 ms 4736 KB Output is correct
14 Correct 23 ms 5040 KB Output is correct
15 Correct 80 ms 8056 KB Output is correct
16 Correct 184 ms 8440 KB Output is correct
17 Correct 25 ms 5112 KB Output is correct
18 Correct 19 ms 4864 KB Output is correct
19 Correct 7 ms 4224 KB Output is correct
20 Correct 268 ms 9208 KB Output is correct
21 Correct 238 ms 9208 KB Output is correct
22 Correct 7 ms 4224 KB Output is correct
23 Correct 7 ms 4224 KB Output is correct
24 Correct 7 ms 4352 KB Output is correct
25 Correct 7 ms 4352 KB Output is correct
26 Correct 7 ms 4224 KB Output is correct
27 Correct 7 ms 4224 KB Output is correct
28 Correct 7 ms 4224 KB Output is correct
29 Correct 6 ms 4224 KB Output is correct
30 Correct 7 ms 4224 KB Output is correct
31 Correct 7 ms 4224 KB Output is correct
32 Correct 81 ms 4728 KB Output is correct
33 Correct 1930 ms 7544 KB Output is correct
34 Correct 177 ms 9464 KB Output is correct
35 Correct 241 ms 14968 KB Output is correct
36 Execution timed out 2090 ms 14916 KB Time limit exceeded
37 Halted 0 ms 0 KB -