oj.uz

Submission #369550

# Submission time Handle Problem Language Result Execution time Memory
369550 2021-02-21T20:53:04 Z vaaven Tents (JOI18_tents) C++14
100 / 100
 93 ms 70892 KB 
//#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <stack>
#include <iomanip>
#include <bitset>
#include <map>
#include <cassert>
#include <array>
#include <queue>
#include <cstring>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define pqueue priority_queue
#define pb(x) push_back(x)
// #define endl '\n'
#define all(x) x.begin(), x.end()
 #define int long  long
      
using namespace std;
      
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
// typedef tuple<ll, ll, ll> tiii;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
      
const int inf = 1e9 + 228;
const ll infll = 1e18;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-14;
      
      
void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    cout.tie(0);
   // freopen("a.in", "r", stdin);
//    freopen("outputik.txt", "w", stdout);
}

int dp[3003][3003];

void solve(){
    int h, w;
    cin >> h >> w;
    assert(h <= 3001);
    assert(w <= 3001);
    dp[0][w] = 1;
    for(int i=1; i<=h; i++){
        for(int j=0; j<=w; j++){
            dp[i][j] += dp[i-1][j];
            dp[i][j] += dp[i-1][j+1] * (j+1) * 4;
            if(i >= 2){
                dp[i][j] += dp[i-2][j+1] * (j+1) * (i-1);
            }
            dp[i][j] += dp[i-1][j+2] * (j+2) * (j+1)/2;
            dp[i][j] %= mod;
        }
    }
    int ans = 0;
    for(int j=0; j<w; j++){
        ans += dp[h][j];
        ans %= mod;
    }
    cout << ans << endl;
}
  
signed main(){
    fast_io();
//    srand(time(NULL));
    cout << fixed << setprecision(10);
    int q = 1;
//    cin >> q;
    while(q--)
        solve();
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 2 ms 1772 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 2284 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 1388 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 2 ms 1772 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 2284 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 7 ms 9708 KB Output is correct
15 Correct 65 ms 55276 KB Output is correct
16 Correct 5 ms 4076 KB Output is correct
17 Correct 15 ms 12928 KB Output is correct
18 Correct 19 ms 17132 KB Output is correct
19 Correct 73 ms 63084 KB Output is correct
20 Correct 61 ms 50924 KB Output is correct
21 Correct 39 ms 33772 KB Output is correct
22 Correct 40 ms 35436 KB Output is correct
23 Correct 34 ms 27136 KB Output is correct
24 Correct 89 ms 70892 KB Output is correct
25 Correct 72 ms 61292 KB Output is correct
26 Correct 84 ms 66796 KB Output is correct
27 Correct 93 ms 68972 KB Output is correct