oj.uz

Submission #880751

# Submission time Handle Problem Language Result Execution time Memory
880751 2023-11-30T01:26:33 Z cpptowin Tents (JOI18_tents) C++17
100 / 100
 163 ms 197208 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
const int mod = 1e9 + 7;
int dp[N][N];
int DP(int n,int m,bool ok)
{
    if(dp[n][m] != -1) return dp[n][m];
    int &now = dp[n][m];
    if(n < 1 or m < 1) {
        now = ok;
        return now;
    }
    now = 0;
    now = (now + DP(n - 1,m,ok)) % mod;
    now = (now + 4 * m * DP(n - 1,m - 1,1)) % mod;
    now = (now + m * (m - 1) / 2 * DP(n - 1,m - 2,1)) % mod;
    now = (now + m * (n - 1) * DP(n - 2,m - 1,1)) % mod;
    return now;
}
// From (N, M) we can:
// 1) do nothing and go to (N-1, M)
// 2) put random tent in N-th row in any direction 4*M * (N-1, M-1)
// 3) put 2 tents in N-th row in M*(M-1)/2 * (N-1, M-2)
// 4) put 2 tents in same column s.t. on is in N-th row in M*(N-1)*(N-2, M-1) ways
int n,m;
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> m;
    memset(dp,-1,sizeof dp);
    // dp[0][0] = 1;
    cout << DP(n,m,0);
}

Compilation message

tents.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
tents.cpp: In function 'int main()':
tents.cpp:50:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
tents.cpp:51:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 196712 KB Output is correct
2 Correct 23 ms 196692 KB Output is correct
3 Correct 23 ms 196700 KB Output is correct
4 Correct 23 ms 196808 KB Output is correct
5 Correct 23 ms 196696 KB Output is correct
6 Correct 24 ms 196700 KB Output is correct
7 Correct 23 ms 196812 KB Output is correct
8 Correct 24 ms 196692 KB Output is correct
9 Correct 24 ms 196688 KB Output is correct
10 Correct 24 ms 196700 KB Output is correct
11 Correct 24 ms 196812 KB Output is correct
12 Correct 24 ms 196892 KB Output is correct

Subtask #2
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 196712 KB Output is correct
2 Correct 23 ms 196692 KB Output is correct
3 Correct 23 ms 196700 KB Output is correct
4 Correct 23 ms 196808 KB Output is correct
5 Correct 23 ms 196696 KB Output is correct
6 Correct 24 ms 196700 KB Output is correct
7 Correct 23 ms 196812 KB Output is correct
8 Correct 24 ms 196692 KB Output is correct
9 Correct 24 ms 196688 KB Output is correct
10 Correct 24 ms 196700 KB Output is correct
11 Correct 24 ms 196812 KB Output is correct
12 Correct 24 ms 196892 KB Output is correct
13 Correct 23 ms 196700 KB Output is correct
14 Correct 24 ms 196896 KB Output is correct
15 Correct 120 ms 197208 KB Output is correct
16 Correct 25 ms 196700 KB Output is correct
17 Correct 32 ms 196956 KB Output is correct
18 Correct 43 ms 197000 KB Output is correct
19 Correct 130 ms 196944 KB Output is correct
20 Correct 105 ms 196944 KB Output is correct
21 Correct 70 ms 196952 KB Output is correct
22 Correct 75 ms 196952 KB Output is correct
23 Correct 50 ms 196956 KB Output is correct
24 Correct 163 ms 197140 KB Output is correct
25 Correct 125 ms 196944 KB Output is correct
26 Correct 144 ms 197124 KB Output is correct
27 Correct 160 ms 197128 KB Output is correct