oj.uz

Submission #1022051

# Submission time Handle Problem Language Result Execution time Memory
1022051 2024-07-13T09:23:11 Z modwwe Tents (JOI18_tents) C++17
100 / 100
 131 ms 70992 KB 
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans ","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
 main()
{
#ifndef ONLINE_JUDGE
///  fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    //  modwwe
    phongbeo();
}
int fac[3001];
int invf[3001];
int dp[3003][3003];
int ipow(int x, int p){
	int  ret = 1, piv = x;
	while(p){
		if(p&1) ret *= piv;
		piv *= piv;
		ret %= mod2;
		piv %= mod2;
		p >>= 1;
	}
	return ret;
}
int bino(int x, int y){
	return fac[x] * (invf[x-y] * invf[y] % mod2) % mod2;
}
void phongbeo()
{
     cin>>n>>m;
      fac[0]=invf[0]=1;
          for(int i=1;i<=n;i++){
            fac[i]=(i*fac[i-1])%mod2;
            		invf[i] = ipow(fac[i], mod2 - 2);
            		 }
  dp[0][m]=1;
 for(int i=1;i<=n;i++)
     for(int j=0;j<m;j++)
     {
          dp[i][j]=(dp[i-1][j+1]*4*(j+1)+dp[i][j])%mod2;
          dp[i][j]=(dp[i-1][j+2]*(j+2)*(j+1)/2+dp[i][j])%mod2;
     if(i>=2)      dp[i][j]=(dp[i-2][j+1]*(j+1)*(i-1)+dp[i][j])%mod2;
     }
     s3=0;
     for(int i=1;i<=n;i++){
        s2=bino(n,i);
        for(int j=0;j<m;j++)
            s3=(s3+dp[i][j]*s2)%mod2;
     }
     cout<<s3%mod2;
}

Compilation message

tents.cpp:48:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 |  main()
      |  ^~~~
tents.cpp: In function 'void phongbeo()':
tents.cpp:84:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   84 |  for(int i=1;i<=n;i++)
      |  ^~~
tents.cpp:91:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   91 |      s3=0;
      |      ^~

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 9800 KB Output is correct
15 Correct 85 ms 55324 KB Output is correct
16 Correct 5 ms 4184 KB Output is correct
17 Correct 18 ms 12892 KB Output is correct
18 Correct 22 ms 17016 KB Output is correct
19 Correct 91 ms 63056 KB Output is correct
20 Correct 75 ms 51056 KB Output is correct
21 Correct 49 ms 33872 KB Output is correct
22 Correct 48 ms 35568 KB Output is correct
23 Correct 32 ms 27228 KB Output is correct
24 Correct 131 ms 70992 KB Output is correct
25 Correct 92 ms 61280 KB Output is correct
26 Correct 103 ms 66640 KB Output is correct
27 Correct 123 ms 68944 KB Output is correct