Submission #68116

#	Time	Username	Problem	Language	Result	Execution time	Memory
68116		duality	Skyscraper (JOI16_skyscraper)	C++11	100 / 100	331 ms	117800 KiB

skyscraper

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#define MOD 1000000007

int A[100];
LLI dp[100][101][1001][3];
int main() {
    int i;
    int N,L;
    scanf("%d %d",&N,&L);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);
    sort(A,A+N);
    if (N == 1) {
        printf("1\n");
        return 0;
    }

    int j,k,l;
    if (A[1]-A[0] <= L) dp[0][1][A[1]-A[0]][1] = 2;
    if (2*(A[1]-A[0]) <= L) dp[0][1][2*(A[1]-A[0])][0] = 1;
    for (i = 0; i < N-1; i++) {
        for (j = 1; j <= i+1; j++) {
            for (k = 0; k <= L; k++) {
                int d = (i == N-2) ? 9999:(A[i+2]-A[i+1]);
                for (l = 0; l <= 2; l++) {
                    dp[i][j][k][l] %= MOD;
                    if (l < 2) {
                        if ((k+(2*j+1-l)*d) <= L) dp[i+1][j+1][k+(2*j+1-l)*d][l+1] += (2-l)*dp[i][j][k][l];
                        if ((k+(2*j-1-l)*d) <= L) {
                            if (i == N-2) dp[i+1][j][k+(2*j-1-l)*d][l+1] += (2-l)*j*dp[i][j][k][l];
                            else dp[i+1][j][k+(2*j-1-l)*d][l+1] += (2-l)*(j-l)*dp[i][j][k][l];
                        }
                    }
                    if ((k+(2*j+2-l)*d) <= L) dp[i+1][j+1][k+(2*j+2-l)*d][l] += dp[i][j][k][l];
                    if ((k+(2*j-l)*d) <= L) dp[i+1][j][k+(2*j-l)*d][l] += (2*j-l)*dp[i][j][k][l];
                    if ((j >= 2) && ((k+(2*j-2-l)*d) <= L)) {
                        if (l == 0) dp[i+1][j-1][k+(2*j-2-l)*d][l] += j*(j-1)*dp[i][j][k][l];
                        else if (l == 1) dp[i+1][j-1][k+(2*j-2-l)*d][l] += (j-1)*(j-1)*dp[i][j][k][l];
                        else {
                            if (i == N-2) dp[i+1][j-1][k+(2*j-2-l)*d][l] += ((j-1)*(j-2)+1)*dp[i][j][k][l];
                            else dp[i+1][j-1][k+(2*j-2-l)*d][l] += (j-1)*(j-2)*dp[i][j][k][l];
                        }
                    }
                }
            }
        }
    }
    LLI ans = 0;
    for (i = 0; i <= L; i++) ans += dp[N-1][1][i][2];
    printf("%lld\n",ans % MOD);

    return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&L);
     ~~~~~^~~~~~~~~~~~~~~
skyscraper.cpp:65:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&A[i]);
                             ~~~~~^~~~~~~~~~~~

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