제출 #218249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
218249		Haunted_Cpp	Swimming competition (LMIO18_plaukimo_varzybos)	C++17	60 / 100	2093 ms	38448 KiB

plaukimo_varzybos

#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 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 0 / 40