oj.uz

Submission #373552

# Submission time Handle Problem Language Result Execution time Memory
373552 2021-03-05T04:48:44 Z i_am_noob Tents (JOI18_tents) C++14
100 / 100
 80 ms 70892 KB 
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2,avx512f")
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;

#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
#define inf 1010000000
//#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
#define ceiling(a,b) (((a)+(b)-1)/(b))
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {static int cnt=0;cerr << x << endl;cnt++;if(cnt>1000) exit(0);}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 826
#endif

inline char readchar(){
    const int maxn=1000000;
    static char buf[maxn],*p=buf,*q=buf;
    if(p==q&&(q=(p=buf)+fread(buf,1,maxn,stdin))==buf) return EOF;
    else return *p++;
}
inline int readint(){
    int c=readchar(),x=0,neg=0;
    while((c<'0'||c>'9')&&c!='-'&&c!=EOF) c=readchar();
    if(c=='-') neg=1,c=readchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^'0'),c=readchar();
    return neg?-x:x;
}

const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod;
const int maxn=3005;
//i_am_noob
int n,m;
ll dp[maxn][maxn];

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    n=readint(),m=readint();
    rep(n+1) dp[i][0]=1;
    rep(m+1) dp[0][i]=1;
    rep(n+1) dp[i][1]=4*i+i*(i-1)/2+1;
    rep(m+1) dp[1][i]=4*i+i*(i-1)/2+1;
    rep2(i,2,n+1) rep2(j,2,m+1){
        dp[i][j]=dp[i-1][j]+4*j*dp[i-1][j-1]+j*(i-1)*dp[i-2][j-1]+j*(j-1)/2*dp[i-1][j-2];
        dp[i][j]%=MOD;
    }
    cout << (dp[n][m]-1+MOD)%MOD << "\n";
    return 0;
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 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 1 ms 1516 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 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 492 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 1 ms 1516 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 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 5 ms 9708 KB Output is correct
15 Correct 55 ms 55276 KB Output is correct
16 Correct 5 ms 4096 KB Output is correct
17 Correct 15 ms 12920 KB Output is correct
18 Correct 22 ms 17164 KB Output is correct
19 Correct 64 ms 63084 KB Output is correct
20 Correct 63 ms 51052 KB Output is correct
21 Correct 42 ms 33900 KB Output is correct
22 Correct 34 ms 35564 KB Output is correct
23 Correct 23 ms 27116 KB Output is correct
24 Correct 80 ms 70892 KB Output is correct
25 Correct 63 ms 61292 KB Output is correct
26 Correct 71 ms 66796 KB Output is correct
27 Correct 78 ms 69228 KB Output is correct