oj.uz

Submission #218249

# Submission time Handle Problem Language Result Execution time Memory
218249 2020-04-01T16:37:21 Z Haunted_Cpp Swimming competition (LMIO18_plaukimo_varzybos) C++17
60 / 100
 2000 ms 38448 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 n, mn, mx;

int solve (int p = 0) {
  if (p >= n) return 0;
  int &res = dp[p];
  if (~res) return res;
  res = 1e9;
  if (p + mn > n) return 1e9;
  FOR (i, mn - 1, mx) {
    int seguinte = min (p + i, n - 1);
    res = min ( res, max ( a[seguinte] - a[p], solve (p + i + 1) ) );
  }
  return res;
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> mn >> mx;
  F0R (i, n) cin >> a[i];
  sort (a, a + n);
  memset (dp, -1, sizeof(dp));
  cout << solve () << '\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 18 ms 5376 KB Output is correct
3 Correct 9 ms 4600 KB Output is correct
4 Correct 220 ms 26692 KB Output is correct
5 Correct 216 ms 14968 KB Output is correct
6 Correct 26 ms 6904 KB Output is correct
7 Correct 198 ms 14124 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 6 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 6 ms 4224 KB Output is correct
4 Correct 6 ms 4224 KB Output is correct
5 Correct 6 ms 4224 KB Output is correct
6 Correct 6 ms 4224 KB Output is correct
7 Correct 6 ms 4224 KB Output is correct
8 Correct 6 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 7 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 18 ms 5376 KB Output is correct
3 Correct 9 ms 4600 KB Output is correct
4 Correct 220 ms 26692 KB Output is correct
5 Correct 216 ms 14968 KB Output is correct
6 Correct 26 ms 6904 KB Output is correct
7 Correct 198 ms 14124 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 6 ms 4224 KB Output is correct
11 Correct 12 ms 4864 KB Output is correct
12 Correct 13 ms 5376 KB Output is correct
13 Correct 38 ms 4864 KB Output is correct
14 Correct 26 ms 5856 KB Output is correct
15 Correct 89 ms 15608 KB Output is correct
16 Correct 226 ms 31608 KB Output is correct
17 Correct 30 ms 5888 KB Output is correct
18 Correct 51 ms 4864 KB Output is correct
19 Correct 6 ms 4224 KB Output is correct
20 Correct 1000 ms 15456 KB Output is correct
21 Correct 1765 ms 38448 KB Output is correct
22 Correct 6 ms 4224 KB Output is correct
23 Correct 6 ms 4224 KB Output is correct
24 Correct 6 ms 4224 KB Output is correct
25 Correct 6 ms 4224 KB Output is correct
26 Correct 6 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 7 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 18 ms 5376 KB Output is correct
3 Correct 9 ms 4600 KB Output is correct
4 Correct 220 ms 26692 KB Output is correct
5 Correct 216 ms 14968 KB Output is correct
6 Correct 26 ms 6904 KB Output is correct
7 Correct 198 ms 14124 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 6 ms 4224 KB Output is correct
11 Correct 12 ms 4864 KB Output is correct
12 Correct 13 ms 5376 KB Output is correct
13 Correct 38 ms 4864 KB Output is correct
14 Correct 26 ms 5856 KB Output is correct
15 Correct 89 ms 15608 KB Output is correct
16 Correct 226 ms 31608 KB Output is correct
17 Correct 30 ms 5888 KB Output is correct
18 Correct 51 ms 4864 KB Output is correct
19 Correct 6 ms 4224 KB Output is correct
20 Correct 1000 ms 15456 KB Output is correct
21 Correct 1765 ms 38448 KB Output is correct
22 Correct 6 ms 4224 KB Output is correct
23 Correct 6 ms 4224 KB Output is correct
24 Correct 6 ms 4224 KB Output is correct
25 Correct 6 ms 4224 KB Output is correct
26 Correct 6 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 7 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 1412 ms 4760 KB Output is correct
33 Execution timed out 2093 ms 9720 KB Time limit exceeded
34 Halted 0 ms 0 KB -