oj.uz

Submission #236312

# Submission time Handle Problem Language Result Execution time Memory
236312 2020-06-01T09:22:42 Z LittleFlowers__ Tents (JOI18_tents) C++17
0 / 100
 5 ms 1152 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=3010,
          M=1000000007;

int m,n;
int f[N][N];

void add(int &a,int b){
    a+=b;
    if(a>=M) a-=M;
}

main(){
    #define task "1"
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);

    m=in,n=in;
    forinc(i,0,m) forinc(j,0,n) if(i>0 && j>0){
        add(f[i][j],f[i-1][j]);
        add(f[i][j],f[i-1][j-1]*j*4);
        if(i>1 && j>0) add(f[i][j],f[i-2][j-1]*(i-1)*j);
        if(j>1 && i>0) add(f[i][j],f[i-1][j-2]*j*(j-1)/2);
    } else f[i][j]=1;
    cout<<(f[m][n]-1+M)%M;
}

Compilation message

tents.cpp:34:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Incorrect 5 ms 640 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Incorrect 5 ms 640 KB Output isn't correct
6 Halted 0 ms 0 KB -