oj.uz

답안 #61963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61963 2018-07-27T06:54:53 Z gusfring Tents (JOI18_tents) C++14
100 / 100
 1185 ms 71628 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
int n, m;
ll dp[3010][3010], MOD = 1e9+7;

int mod(ll x){ return x % MOD; }
int main() {
  int i, j;
  scanf("%d%d",&n,&m);
  for(int i=0; i<=m; ++i) dp[0][i] = 1;
  for(int i=0; i<=n; ++i) dp[i][0] = 1;
  for(int i=1; i<=n; ++i)
		for(int j=1; j<=m; ++j){
			dp[i][j] = dp[i - 1][j];
			dp[i][j] = mod(dp[i][j] + mod(dp[i - 1][j - 1] * 4 * j));
			dp[i][j] = mod(dp[i][j] + mod(dp[i - 2][j - 1] * j * (i - 1)));
			dp[i][j] = mod(dp[i][j] + mod(dp[i - 1][j - 2] * mod(j * (j - 1) / 2)));
		}
  printf("%lld\n", (dp[n][m] - 1 + MOD) % MOD);
  return 0;
}

Compilation message

tents.cpp: In function 'int main()':
tents.cpp:12:7: warning: unused variable 'i' [-Wunused-variable]
   int i, j;
       ^
tents.cpp:12:10: warning: unused variable 'j' [-Wunused-variable]
   int i, j;
          ^
tents.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
48.0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 472 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 3 ms 1184 KB Output is correct
5 Correct 5 ms 1184 KB Output is correct
6 Correct 7 ms 1620 KB Output is correct
7 Correct 6 ms 1620 KB Output is correct
8 Correct 7 ms 1620 KB Output is correct
9 Correct 4 ms 1620 KB Output is correct
10 Correct 9 ms 1996 KB Output is correct
11 Correct 3 ms 1996 KB Output is correct
12 Correct 17 ms 2536 KB Output is correct

Subtask #2
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 472 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 3 ms 1184 KB Output is correct
5 Correct 5 ms 1184 KB Output is correct
6 Correct 7 ms 1620 KB Output is correct
7 Correct 6 ms 1620 KB Output is correct
8 Correct 7 ms 1620 KB Output is correct
9 Correct 4 ms 1620 KB Output is correct
10 Correct 9 ms 1996 KB Output is correct
11 Correct 3 ms 1996 KB Output is correct
12 Correct 17 ms 2536 KB Output is correct
13 Correct 3 ms 2536 KB Output is correct
14 Correct 13 ms 10056 KB Output is correct
15 Correct 726 ms 55756 KB Output is correct
16 Correct 51 ms 55756 KB Output is correct
17 Correct 167 ms 55756 KB Output is correct
18 Correct 208 ms 55756 KB Output is correct
19 Correct 811 ms 63380 KB Output is correct
20 Correct 592 ms 63380 KB Output is correct
21 Correct 488 ms 63380 KB Output is correct
22 Correct 457 ms 63380 KB Output is correct
23 Correct 259 ms 63380 KB Output is correct
24 Correct 1167 ms 71628 KB Output is correct
25 Correct 870 ms 71628 KB Output is correct
26 Correct 1040 ms 71628 KB Output is correct
27 Correct 1185 ms 71628 KB Output is correct