oj.uz

Submission #444453

# Submission time Handle Problem Language Result Execution time Memory
444453 2021-07-14T05:43:09 Z cpp219 Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 60 ms 32016 KB 
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 2e3 + 9;
const ll Log2 = 20;
const ll mod = 1e9 + 7;

ll n,s,e,dp[N][N];

ll f(ll pos,ll g){
    if (pos == n + 1) return !g;
    if (dp[pos][g] != -1) return dp[pos][g];
    ll ans = 0;
    if (pos > e){
        if (g) ans = f(pos + 1,g - 1);
        ans = (ans + f(pos + 1,g + 1) * g * (g + 1))%mod;
    }
    else if (pos == e) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod;
    else if (pos > s){
        if (g) ans = f(pos + 1,g - 1);
        ans = (ans + f(pos + 1,g + 1) * (g + 1) * (g + 1))%mod;
    }
    else if (pos == s) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod;
    else if (pos < s){
        if (g) ans = f(pos + 1,g - 1);
        ans = (ans + f(pos + 1,g + 1) * (g + 2) * (g + 1))%mod;
    }
    return dp[pos][g] = ans;
}

int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    cin>>n>>s>>e; memset(dp,-1,sizeof(dp));
    if (s > e) swap(s,e);
    cout<<f(2,0);
}

Compilation message

kangaroo.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
kangaroo.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
kangaroo.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
kangaroo.cpp: In function 'int main()':
kangaroo.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 16 ms 31812 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 16 ms 31812 KB Output is correct
3 Correct 17 ms 31820 KB Output is correct
4 Correct 19 ms 31820 KB Output is correct
5 Correct 17 ms 31824 KB Output is correct
6 Correct 17 ms 31888 KB Output is correct
7 Correct 16 ms 31824 KB Output is correct
8 Correct 18 ms 31900 KB Output is correct
9 Correct 17 ms 31860 KB Output is correct
10 Correct 19 ms 31820 KB Output is correct
11 Correct 16 ms 31828 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 16 ms 31812 KB Output is correct
3 Correct 17 ms 31820 KB Output is correct
4 Correct 19 ms 31820 KB Output is correct
5 Correct 17 ms 31824 KB Output is correct
6 Correct 17 ms 31888 KB Output is correct
7 Correct 16 ms 31824 KB Output is correct
8 Correct 18 ms 31900 KB Output is correct
9 Correct 17 ms 31860 KB Output is correct
10 Correct 19 ms 31820 KB Output is correct
11 Correct 16 ms 31828 KB Output is correct
12 Correct 16 ms 31892 KB Output is correct
13 Correct 17 ms 31792 KB Output is correct
14 Correct 17 ms 31824 KB Output is correct
15 Correct 17 ms 31820 KB Output is correct
16 Correct 17 ms 31796 KB Output is correct
17 Correct 17 ms 31820 KB Output is correct
18 Correct 18 ms 31792 KB Output is correct
19 Correct 17 ms 31868 KB Output is correct
20 Correct 16 ms 31820 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31820 KB Output is correct
2 Correct 16 ms 31812 KB Output is correct
3 Correct 17 ms 31820 KB Output is correct
4 Correct 19 ms 31820 KB Output is correct
5 Correct 17 ms 31824 KB Output is correct
6 Correct 17 ms 31888 KB Output is correct
7 Correct 16 ms 31824 KB Output is correct
8 Correct 18 ms 31900 KB Output is correct
9 Correct 17 ms 31860 KB Output is correct
10 Correct 19 ms 31820 KB Output is correct
11 Correct 16 ms 31828 KB Output is correct
12 Correct 16 ms 31892 KB Output is correct
13 Correct 17 ms 31792 KB Output is correct
14 Correct 17 ms 31824 KB Output is correct
15 Correct 17 ms 31820 KB Output is correct
16 Correct 17 ms 31796 KB Output is correct
17 Correct 17 ms 31820 KB Output is correct
18 Correct 18 ms 31792 KB Output is correct
19 Correct 17 ms 31868 KB Output is correct
20 Correct 16 ms 31820 KB Output is correct
21 Correct 22 ms 31944 KB Output is correct
22 Correct 20 ms 31948 KB Output is correct
23 Correct 22 ms 31888 KB Output is correct
24 Correct 59 ms 32008 KB Output is correct
25 Correct 52 ms 31948 KB Output is correct
26 Correct 60 ms 32016 KB Output is correct
27 Correct 57 ms 32012 KB Output is correct
28 Correct 37 ms 31980 KB Output is correct