제출 #23499

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
23499	2017-05-11 10:50:24	rubabredwan	Skyscraper (JOI16_skyscraper)	C++14	100 / 100	303 ms	348272 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
/* Bismillahir Rahmanir Rahim */
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const int L = 1005;
const long long mod = 1e9 + 7;
long long dp[N][L][N][2][2];
int n, l, a[N];
long long recur(int at, int sum, int tot, int lf, int rf){
    int fuk = sum + ((a[at] - a[at-1]) * (lf + rf + tot * 2));
    if(fuk > l || tot < 0) return 0;
    if(at == n) return (tot == 0);
    if(dp[at][sum][tot][lf][rf] != -1) return dp[at][sum][tot][lf][rf];
    long long ret = 0;
    ret += recur(at+1, fuk, tot, 1, rf);
    ret += recur(at+1, fuk, tot-1, 1, rf) * tot;
    ret += recur(at+1, fuk, tot, lf, 1);
    ret += recur(at+1, fuk, tot-1, lf, 1) * tot;
    ret += recur(at+1, fuk, tot, lf, rf) * tot * 2;
    ret += recur(at+1, fuk, tot-1, lf, rf) * tot * (tot - 1);
    ret += recur(at+1, fuk, tot+1, lf, rf);
    return dp[at][sum][tot][lf][rf] = ret % mod;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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