oj.uz

답안 #74595

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
74595 2018-09-04T22:22:35 Z nobik Skyscraper (JOI16_skyscraper) C++14
100 / 100
 295 ms 79392 KB 
#include <bits/stdc++.h>
using namespace std;

const int mod = 1000 * 1000 * 1000 + 7;

const int N = 105;
const int L = 1005;

int n, l, a[N], f[N][L][N][2][2];

void add(int &x, int y) {
  x += y;
  if (x >= mod) {
    x -= mod;
  }
}

int main() {
  cin >> n >> l;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  
  sort(a, a + n);
  reverse(a, a + n);
  
  for (int x = 0; x < 2; ++x)
    for (int y = 0; y < 2; ++y)
      f[0][0][1][x][y] = 1;
  
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j <= l; ++j) {
      for (int w = 1; w <= i; ++w) {
        for (int x = 0; x < 2; ++x) {
          for (int y = 0; y < 2; ++y) {
            int r, nj, nw, p;
            r = f[i - 1][j][w][x][y];
            nj = j + (2 * w - x - y) * (a[i - 1] - a[i]);
            
            if (r == 0 || nj > l) {
              continue;
            }
            
            if (w == 1 && x && y) {
              continue;
            }
            
            {
              nw = w + 1;
              add(f[i][nj][nw][x][y], r);
              if (x == 0) add(f[i][nj][nw][1][y], r);
              if (y == 0) add(f[i][nj][nw][x][1], r);
            }
            
            {
              add(f[i][nj][w][x][y], 1LL * (2 * w - x - y) * r % mod);
            }
            
            {
              {
                nw = w - 1;
                p = (x ? w - x - y : 0) + (y ? w - x - y : 0) + (w - x - y) * (w - x - y - 1);
                if (nw == 1 && x && y) ++p;
                add(f[i][nj][nw][x][y], 1LL * p * r % mod);
              }
              
              if (x == 0) {
                p = w - (w > 1 && y);
                add(f[i][nj][w][1][y], 1LL * p * r % mod);
              }
              
              if (y == 0) {
                p = w - (w > 1 && x);
                add(f[i][nj][w][x][1], 1LL * p * r % mod);
              }
            }
          }
        }
      }
    }
  }
  
  int r = 0;
  for (int i = 0; i <= l; ++i)
    add(r, f[n - 1][i][1][1][1]);
    
  cout << r << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 1048 KB Output is correct
9 Correct 6 ms 1112 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1276 KB Output is correct
2 Correct 3 ms 1296 KB Output is correct
3 Correct 3 ms 1304 KB Output is correct
4 Correct 4 ms 1304 KB Output is correct
5 Correct 5 ms 1304 KB Output is correct
6 Correct 4 ms 1732 KB Output is correct
7 Correct 2 ms 1732 KB Output is correct
8 Correct 3 ms 1732 KB Output is correct
9 Correct 3 ms 1732 KB Output is correct
10 Correct 4 ms 1732 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 1048 KB Output is correct
9 Correct 6 ms 1112 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1276 KB Output is correct
12 Correct 3 ms 1296 KB Output is correct
13 Correct 3 ms 1304 KB Output is correct
14 Correct 4 ms 1304 KB Output is correct
15 Correct 5 ms 1304 KB Output is correct
16 Correct 4 ms 1732 KB Output is correct
17 Correct 2 ms 1732 KB Output is correct
18 Correct 3 ms 1732 KB Output is correct
19 Correct 3 ms 1732 KB Output is correct
20 Correct 4 ms 1732 KB Output is correct
21 Correct 5 ms 1972 KB Output is correct
22 Correct 295 ms 79392 KB Output is correct
23 Correct 245 ms 79392 KB Output is correct
24 Correct 207 ms 79392 KB Output is correct
25 Correct 243 ms 79392 KB Output is correct
26 Correct 213 ms 79392 KB Output is correct
27 Correct 84 ms 79392 KB Output is correct
28 Correct 111 ms 79392 KB Output is correct
29 Correct 198 ms 79392 KB Output is correct
30 Correct 243 ms 79392 KB Output is correct