oj.uz

Submission #312321

# Submission time Handle Problem Language Result Execution time Memory
312321 2020-10-13T03:23:11 Z VROOM_VARUN Sparklers (JOI17_sparklers) C++14
0 / 100
 23 ms 4224 KB 
/*
ID: varunra2
LANG: C++
TASK: sparklers
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
const int N = 1001;
int n, k, t;
int v;
VI vals;
VVI dp(N, VI(N, -1));

void init() { vals.resize(n); }

int solve(int l, int r) {
  int& ret = dp[l][r];
  if (ret != -1) return ret;
  if (l >= r) {
    return ret == 0;
  }
  return ret = ((solve(l + 1, r) == 1 or solve(l, r - 1) == 1) and
                (vals[r] - vals[l]) / (v) <= 2ll * (r - l) * t);
}

void fll(VVI& dp, int val) { trav(x, dp) trav(y, x) y = val; }

bool works(int _v) {
  if (_v >= 2 * INF) return true;
  if (_v == 0) return false;
  fll(dp, -1);
  dp[k][k] = 1;
  v = _v;
  return solve(0, n - 1) == 1;
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("sparklers.in", "r", stdin);
  // freopen("sparklers.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k >> t;

  if (n == 1) {
    cout << "0\n";
    return 0;
  }

  k--;

  init();

  for (int i = 0; i < n; i++) {
    cin >> vals[i];
  }

  int x = -1;

  for (int b = INF + 1; b >= 1; b /= 2) {
    while (!works(x + b)) x += b;
  }

  cout << x + 1 << '\n';

  return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -