oj.uz

답안 #316520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316520 2020-10-26T13:57:05 Z Dymo 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 68 ms 39672 KB 
#include<bits/stdc++.h>

using namespace std;


#define pb    push_back
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=3e3+50;
const ll mod =1e9+7;
const ll base=1e17;

ll dp[maxn][maxn];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("test.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout) ;
    }
    ll n, st, ed;
    cin>>n>>st>>ed;
    if (st>ed)
        swap(st,ed);
        st++;
        ed++;
    dp[1][0]=1;
    for (ll i=2; i<=n; i++)
    {
        for (ll j=0; j<=n; j++)
        {
            if (i!=st&&i!=ed)
            {

                // them 1 nhom loai 1;
                if (j)
                    dp[i][j]=(dp[i][j]+dp[i-1][j-1])%mod;
                // ghep 2 nhom loai 1;
               if (j>0)dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1)*j)%mod;
                // ghep nhom st va  nhom loai 1;
                if (i>st)
                {
                    dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod;
                }
                // ghep nhom ed va  nhom loai 1;
                if (i>ed)
                {
                    dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod;
                }
               // cout <<"WTF"<<endl;
            }
            else
            {
                /*if (i==3)
                {
                    cout <<"WTF"<<endl;
                }*/
                dp[i][j]=(dp[i][j]+dp[i-1][j])%mod;
               dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod;
            }
        }
    }
    // cout <<dp[2][0]<<" "<<dp[2][1]<<" "<<dp[2][2]<<endl;
    cout <<dp[n][0];
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:30:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   30 |     if (st>ed)
      |     ^~
kangaroo.cpp:32:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   32 |         st++;
      |         ^~
kangaroo.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   25 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
kangaroo.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   26 |         freopen("test.out", "w", stdout) ;
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 640 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct
14 Correct 2 ms 1408 KB Output is correct
15 Correct 2 ms 1408 KB Output is correct
16 Correct 2 ms 1408 KB Output is correct
17 Correct 2 ms 1408 KB Output is correct
18 Correct 2 ms 1280 KB Output is correct
19 Correct 2 ms 1408 KB Output is correct
20 Correct 2 ms 1408 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct
14 Correct 2 ms 1408 KB Output is correct
15 Correct 2 ms 1408 KB Output is correct
16 Correct 2 ms 1408 KB Output is correct
17 Correct 2 ms 1408 KB Output is correct
18 Correct 2 ms 1280 KB Output is correct
19 Correct 2 ms 1408 KB Output is correct
20 Correct 2 ms 1408 KB Output is correct
21 Correct 8 ms 6400 KB Output is correct
22 Correct 9 ms 7040 KB Output is correct
23 Correct 11 ms 7808 KB Output is correct
24 Correct 62 ms 39672 KB Output is correct
25 Correct 62 ms 39672 KB Output is correct
26 Correct 65 ms 39616 KB Output is correct
27 Correct 68 ms 39288 KB Output is correct
28 Correct 40 ms 23928 KB Output is correct