답안 #824546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
824546	2023-08-14T07:31:15 Z	yusuf12360	Tents (JOI18_tents)	C++14	100 / 100	130 ms	141500 KB

tents

#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
const int MOD=1e9+7;
signed main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m; cin >> n >> m;
    vector<vector<int>> dp(n+1, vector<int>(m+1));
    vector<vector<int>> pre(n+1, vector<int>(m+1));
    dp[0][0]=1;
    for(int i=1; i<=n; i++) dp[i][0]=1;
    for(int j=1; j<=m; j++) dp[0][j]=1;
    for(int i=1; i<=n; i++) {
      for(int j=1; j<=m; j++) {
          if(i>=2) dp[i][j]=(dp[i][j]+i*(i-1)/2*dp[i-2][j-1])%MOD;
          if(j>=2) dp[i][j]=(dp[i][j]+i*(j-1)*dp[i-1][j-2])%MOD;
          dp[i][j]=(dp[i][j]+4LL*i*dp[i-1][j-1]%MOD)%MOD;
          dp[i][j]=(dp[i][j]+dp[i][j-1])%MOD;
    }
    }
    cout << dp[n][m]-1 << '\n';
    return 0;
}

Subtask #1

48.0 / 48.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	576 KB	Output is correct
6	Correct	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	960 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	2 ms	1748 KB	Output is correct

Subtask #2

52.0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	320 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	576 KB	Output is correct
6	Correct	1 ms	596 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	960 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	2 ms	1748 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	576 KB	Output is correct
15	Correct	95 ms	88120 KB	Output is correct
16	Correct	7 ms	5972 KB	Output is correct
17	Correct	19 ms	19932 KB	Output is correct
18	Correct	28 ms	24616 KB	Output is correct
19	Correct	97 ms	102624 KB	Output is correct
20	Correct	91 ms	82060 KB	Output is correct
21	Correct	52 ms	54088 KB	Output is correct
22	Correct	52 ms	53384 KB	Output is correct
23	Correct	30 ms	29856 KB	Output is correct
24	Correct	130 ms	141500 KB	Output is correct
25	Correct	100 ms	105020 KB	Output is correct
26	Correct	113 ms	120396 KB	Output is correct
27	Correct	127 ms	136004 KB	Output is correct