oj.uz

Submission #559542

# Submission time Handle Problem Language Result Execution time Memory
559542 2022-05-10T06:46:59 Z zaneyu Tents (JOI18_tents) C++14
100 / 100
 89 ms 70860 KB 
/*input
100 100
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef unsigned long long int ll;

#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=3e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
ll dp[maxn][maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP1(i,n){
        REP1(j,m){
            if(j>=2) dp[i][j]=(dp[i-1][j-2]+1)*j*(j-1)/2%MOD;
            dp[i][j]+=(dp[i-1][j-1]+1)*4*j%MOD;
            dp[i][j]+=dp[i-1][j];
            if(i>=2) dp[i][j]+=(dp[i-2][j-1]+1)*j*(i-1)%MOD;
            dp[i][j]%=MOD;
        }
    }
    cout<<dp[n][m];
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 708 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 708 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 6 ms 9556 KB Output is correct
15 Correct 58 ms 55032 KB Output is correct
16 Correct 4 ms 4052 KB Output is correct
17 Correct 16 ms 12756 KB Output is correct
18 Correct 19 ms 17064 KB Output is correct
19 Correct 66 ms 62936 KB Output is correct
20 Correct 52 ms 50764 KB Output is correct
21 Correct 36 ms 33660 KB Output is correct
22 Correct 44 ms 35336 KB Output is correct
23 Correct 24 ms 27016 KB Output is correct
24 Correct 81 ms 70860 KB Output is correct
25 Correct 72 ms 61224 KB Output is correct
26 Correct 76 ms 66524 KB Output is correct
27 Correct 89 ms 68940 KB Output is correct