oj.uz

Submission #134425

# Submission time Handle Problem Language Result Execution time Memory
134425 2019-07-22T16:38:05 Z duality Tents (JOI18_tents) C++11
100 / 100
 90 ms 70848 KB 
#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

LLI dp[3001][3001];
int main() {
    int H,W;
    cin >> H >> W;

    int i,j;
    for (i = 0; i <= W; i++) dp[0][i] = 1;
    for (i = 1; i <= H; i++) {
        dp[i][0] = 1;
        for (j = 1; j <= W; j++) {
            dp[i][j] = dp[i-1][j]+4*j*dp[i-1][j-1];
            if (i >= 2) dp[i][j] += (j*(i-1))*dp[i-2][j-1];
            if (j >= 2) dp[i][j] += (j*(j-1)/2)*dp[i-1][j-2];
            dp[i][j] %= MOD;
        }
    }
    cout << (dp[H][W]+MOD-1) % MOD << endl;

    return 0;
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 1784 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 4 ms 2296 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 3 ms 1528 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 1784 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 4 ms 2296 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 9 ms 9720 KB Output is correct
15 Correct 65 ms 55132 KB Output is correct
16 Correct 6 ms 4088 KB Output is correct
17 Correct 16 ms 12792 KB Output is correct
18 Correct 21 ms 17144 KB Output is correct
19 Correct 75 ms 62992 KB Output is correct
20 Correct 60 ms 50936 KB Output is correct
21 Correct 40 ms 33784 KB Output is correct
22 Correct 42 ms 35532 KB Output is correct
23 Correct 30 ms 27128 KB Output is correct
24 Correct 90 ms 70848 KB Output is correct
25 Correct 73 ms 61148 KB Output is correct
26 Correct 87 ms 66684 KB Output is correct
27 Correct 87 ms 68956 KB Output is correct