oj.uz

Submission #312337

# Submission time Handle Problem Language Result Execution time Memory
312337 2020-10-13T03:51:01 Z VROOM_VARUN Sparklers (JOI17_sparklers) C++14
50 / 100
 106 ms 18352 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 int long long
#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 = 1005;
int n, k, t;
int v;
VI vals;
VVI dp(N, VI(N, -1));

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

bool solve(int l, int r) {
  if (l > k) return false;
  if (r < k) return false;
  if (l == r) return true;

  if (dp[l][r] != -1) return dp[l][r];

  if (vals[r] - vals[l] <= 2 * (r - l) * t * v) {
    if (solve(l, r - 1))
      dp[l][r] = 1;
    else if (solve(l + 1, r))
      dp[l][r] = 1;
    else
      dp[l][r] = 0;
  } else {
    dp[l][r] = 0;
  }

  return dp[l][r];
}

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

bool works(int _v) {
  v = _v;
  if (v * t >= vals.back()) return true;
  fll(dp, -1);
  dp[k][k] = 1;
  return solve(0, n - 1);
}

int32_t 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 * (int)(1e5) + 1; b >= 1; b /= 2) {
    while (!works(x + b)) x += b;
  }

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

  x++;

  for (int i = x - 5; i <= x + 5; i++) {
    if (works(i)) {
      cout << i << '\n';
      return 0;
    }
  }

  return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8440 KB Output is correct
2 Correct 35 ms 8320 KB Output is correct
3 Correct 39 ms 8320 KB Output is correct
4 Correct 45 ms 8320 KB Output is correct
5 Correct 48 ms 8320 KB Output is correct
6 Correct 42 ms 8332 KB Output is correct
7 Correct 39 ms 8320 KB Output is correct
8 Correct 39 ms 8320 KB Output is correct
9 Correct 48 ms 8320 KB Output is correct
10 Correct 43 ms 8320 KB Output is correct
11 Correct 41 ms 8320 KB Output is correct
12 Correct 40 ms 8328 KB Output is correct
13 Correct 43 ms 8320 KB Output is correct
14 Correct 43 ms 8320 KB Output is correct
15 Correct 42 ms 8236 KB Output is correct
16 Correct 46 ms 8320 KB Output is correct
17 Correct 35 ms 8320 KB Output is correct
18 Correct 41 ms 8320 KB Output is correct
19 Correct 10 ms 8320 KB Output is correct
20 Correct 50 ms 8320 KB Output is correct
21 Correct 5 ms 8320 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8440 KB Output is correct
2 Correct 35 ms 8320 KB Output is correct
3 Correct 39 ms 8320 KB Output is correct
4 Correct 45 ms 8320 KB Output is correct
5 Correct 48 ms 8320 KB Output is correct
6 Correct 42 ms 8332 KB Output is correct
7 Correct 39 ms 8320 KB Output is correct
8 Correct 39 ms 8320 KB Output is correct
9 Correct 48 ms 8320 KB Output is correct
10 Correct 43 ms 8320 KB Output is correct
11 Correct 41 ms 8320 KB Output is correct
12 Correct 40 ms 8328 KB Output is correct
13 Correct 43 ms 8320 KB Output is correct
14 Correct 43 ms 8320 KB Output is correct
15 Correct 42 ms 8236 KB Output is correct
16 Correct 46 ms 8320 KB Output is correct
17 Correct 35 ms 8320 KB Output is correct
18 Correct 41 ms 8320 KB Output is correct
19 Correct 10 ms 8320 KB Output is correct
20 Correct 50 ms 8320 KB Output is correct
21 Correct 5 ms 8320 KB Output is correct
22 Correct 70 ms 8320 KB Output is correct
23 Correct 46 ms 8320 KB Output is correct
24 Correct 48 ms 8320 KB Output is correct
25 Correct 49 ms 8320 KB Output is correct
26 Correct 42 ms 8320 KB Output is correct
27 Correct 47 ms 8320 KB Output is correct
28 Correct 97 ms 8440 KB Output is correct
29 Correct 103 ms 8444 KB Output is correct
30 Correct 69 ms 8320 KB Output is correct
31 Correct 106 ms 8320 KB Output is correct
32 Correct 50 ms 8320 KB Output is correct
33 Correct 87 ms 8384 KB Output is correct
34 Correct 65 ms 8320 KB Output is correct
35 Correct 52 ms 8320 KB Output is correct
36 Correct 67 ms 8320 KB Output is correct
37 Correct 58 ms 8388 KB Output is correct
38 Correct 82 ms 8320 KB Output is correct
39 Correct 60 ms 8320 KB Output is correct
40 Correct 10 ms 8320 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 8440 KB Output is correct
2 Correct 35 ms 8320 KB Output is correct
3 Correct 39 ms 8320 KB Output is correct
4 Correct 45 ms 8320 KB Output is correct
5 Correct 48 ms 8320 KB Output is correct
6 Correct 42 ms 8332 KB Output is correct
7 Correct 39 ms 8320 KB Output is correct
8 Correct 39 ms 8320 KB Output is correct
9 Correct 48 ms 8320 KB Output is correct
10 Correct 43 ms 8320 KB Output is correct
11 Correct 41 ms 8320 KB Output is correct
12 Correct 40 ms 8328 KB Output is correct
13 Correct 43 ms 8320 KB Output is correct
14 Correct 43 ms 8320 KB Output is correct
15 Correct 42 ms 8236 KB Output is correct
16 Correct 46 ms 8320 KB Output is correct
17 Correct 35 ms 8320 KB Output is correct
18 Correct 41 ms 8320 KB Output is correct
19 Correct 10 ms 8320 KB Output is correct
20 Correct 50 ms 8320 KB Output is correct
21 Correct 5 ms 8320 KB Output is correct
22 Correct 70 ms 8320 KB Output is correct
23 Correct 46 ms 8320 KB Output is correct
24 Correct 48 ms 8320 KB Output is correct
25 Correct 49 ms 8320 KB Output is correct
26 Correct 42 ms 8320 KB Output is correct
27 Correct 47 ms 8320 KB Output is correct
28 Correct 97 ms 8440 KB Output is correct
29 Correct 103 ms 8444 KB Output is correct
30 Correct 69 ms 8320 KB Output is correct
31 Correct 106 ms 8320 KB Output is correct
32 Correct 50 ms 8320 KB Output is correct
33 Correct 87 ms 8384 KB Output is correct
34 Correct 65 ms 8320 KB Output is correct
35 Correct 52 ms 8320 KB Output is correct
36 Correct 67 ms 8320 KB Output is correct
37 Correct 58 ms 8388 KB Output is correct
38 Correct 82 ms 8320 KB Output is correct
39 Correct 60 ms 8320 KB Output is correct
40 Correct 10 ms 8320 KB Output is correct
41 Runtime error 27 ms 18352 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -