oj.uz

답안 #1077671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077671 2024-08-27T08:33:16 Z Martincho506 Tents (JOI18_tents) C++17
48 / 100
 2 ms 1628 KB 
#include<bits/stdc++.h>
using namespace std;

long long mod = 1000000007, vis[301][301], dp[301][301];

long long f(long long i, long long j)
{
    if(i == 0 || j == 0) return 1;
    if(i < 0 || j < 0) return 0;
    if(vis[i][j]) return dp[i][j];
    vis[i][j] = true;
    dp[i][j] = ((f(i-1, j)+4*j*f(i-1, j-1))%mod+(f(i-1, j-2)*j*(j-1)/2)%mod+(f(i-2, j-1)*j*(i-1))%mod)%mod;
    return dp[i][j];
}

int main()
{
    long long n, m;
    cin>>n>>m;
    cout<<f(n, m)-1;
    return 0;
}

Subtask #1
48.0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 604 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 1628 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 1628 KB Output is correct

Subtask #2
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 604 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 1628 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 1628 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Runtime error 1 ms 348 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -