Submission #33191

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
33191	2017-10-22 16:03:52	aome	Skyscraper (JOI16_skyscraper)	C++14	100 / 100	159 ms	5620 KiB

skyscraper

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 105;
int n, m, a[N], f[2][N][N * 10][2][2];
void add(int &x, int y) {
  x += y; if (x >= mod) x -= mod;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  if (n == 1) {
    cout << "1\n"; return 0;
  }
  sort(a + 1, a + 1 + n);
  f[0][0][0][0][0] = 1;
  for (int i = 0; i < n; ++i) {
    bool t = i & 1;
    memset(f[t ^ 1], 0, sizeof f[t ^ 1]);
    for (int j = 0; j <= i; ++j) for (int k = 0; k <= m; ++k) {
      for (int l = 0; l <= 1; ++l) for (int r = 0; r <= 1; ++r) {
        if (!f[t][j][k][l][r]) continue;
        //cout << i << ' ' << j << ' ' << k << ' ' << l << ' ' << r << ' ' << f[t][j][k][l][r] << '\n'; 
        int nk = k + (2 * j - l - r) * (a[i + 1] - a[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 80 / 80