oj.uz

Submission #310435

# Submission time Handle Problem Language Result Execution time Memory
310435 2020-10-06T23:03:15 Z VROOM_VARUN Skyscraper (JOI16_skyscraper) C++14
100 / 100
 315 ms 260664 KB 
/*
ID: varunra2
LANG: C++
TASK: skycraper
*/

#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
#define int long long

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 = 105;
const int L = 1005;

int dp[N][N][L][3];

int n, l;
VI vals;

void ad(int& a, int b) {
  b %= MOD;
  a += b;
  a %= MOD;
}

int solve(int i, int cc, int sum, int bnds) {
  if (cc == 0 or bnds == 3 or sum > l) return 0;

  if (i == n) {
    if (cc == 1 and sum <= l and bnds == 2) return 1;
    return 0;
  }

  if (dp[i][cc][sum][bnds] != -1) return dp[i][cc][sum][bnds];

  int nsum = sum + (2 * cc - bnds) * (vals[i] - vals[i - 1]);

  int ret = 0;

  ad(ret, (cc + 1 - bnds) * solve(i + 1, cc + 1, nsum, bnds));
  ad(ret, (2 * cc - bnds) * solve(i + 1, cc, nsum, bnds));
  ad(ret, (cc - 1) * solve(i + 1, cc - 1, nsum, bnds));
  ad(ret, (2 - bnds) * solve(i + 1, cc + 1, nsum, bnds + 1));
  ad(ret, (2 - bnds) * solve(i + 1, cc, nsum, bnds + 1));

  ret %= MOD;

  dp[i][cc][sum][bnds] = ret;

  return ret;
}

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

  cin >> n >> l;

  MEM(dp, -1);

  vals.resize(n);

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

  sort(all(vals));

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

  cout << (solve(1, 1, 0, 0) + 2 * solve(1, 1, 0, 1)) % MOD << '\n';

  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 260472 KB Output is correct
2 Correct 145 ms 260472 KB Output is correct
3 Correct 145 ms 260464 KB Output is correct
4 Correct 145 ms 260472 KB Output is correct
5 Correct 144 ms 260472 KB Output is correct
6 Correct 145 ms 260544 KB Output is correct
7 Correct 164 ms 260472 KB Output is correct
8 Correct 145 ms 260472 KB Output is correct
9 Correct 146 ms 260472 KB Output is correct
10 Correct 146 ms 260600 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 260468 KB Output is correct
2 Correct 145 ms 260472 KB Output is correct
3 Correct 145 ms 260472 KB Output is correct
4 Correct 145 ms 260476 KB Output is correct
5 Correct 146 ms 260472 KB Output is correct
6 Correct 143 ms 260600 KB Output is correct
7 Correct 145 ms 260600 KB Output is correct
8 Correct 143 ms 260472 KB Output is correct
9 Correct 144 ms 260472 KB Output is correct
10 Correct 146 ms 260600 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 260472 KB Output is correct
2 Correct 145 ms 260472 KB Output is correct
3 Correct 145 ms 260464 KB Output is correct
4 Correct 145 ms 260472 KB Output is correct
5 Correct 144 ms 260472 KB Output is correct
6 Correct 145 ms 260544 KB Output is correct
7 Correct 164 ms 260472 KB Output is correct
8 Correct 145 ms 260472 KB Output is correct
9 Correct 146 ms 260472 KB Output is correct
10 Correct 146 ms 260600 KB Output is correct
11 Correct 145 ms 260468 KB Output is correct
12 Correct 145 ms 260472 KB Output is correct
13 Correct 145 ms 260472 KB Output is correct
14 Correct 145 ms 260476 KB Output is correct
15 Correct 146 ms 260472 KB Output is correct
16 Correct 143 ms 260600 KB Output is correct
17 Correct 145 ms 260600 KB Output is correct
18 Correct 143 ms 260472 KB Output is correct
19 Correct 144 ms 260472 KB Output is correct
20 Correct 146 ms 260600 KB Output is correct
21 Correct 146 ms 260472 KB Output is correct
22 Correct 315 ms 260600 KB Output is correct
23 Correct 224 ms 260664 KB Output is correct
24 Correct 240 ms 260472 KB Output is correct
25 Correct 235 ms 260472 KB Output is correct
26 Correct 222 ms 260600 KB Output is correct
27 Correct 184 ms 260472 KB Output is correct
28 Correct 206 ms 260600 KB Output is correct
29 Correct 271 ms 260564 KB Output is correct
30 Correct 233 ms 260472 KB Output is correct