oj.uz

Submission #81736

# Submission time Handle Problem Language Result Execution time Memory
81736 2018-10-26T11:50:50 Z Saboon Kangaroo (CEOI16_kangaroo) C++14
51 / 100
 693 ms 525312 KB 
#include <iostream>
#include <sstream>
#include <queue>
#include <stack>
#include <vector>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <iomanip>
#define F first
#define S second
#define PB push_back
#define PF push_front
#define MP make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int maxn = 210 + 37;
const int mod = 1e9 + 7;

ll dp[maxn][maxn][maxn][3], par[maxn][maxn][maxn][3];

int main() {
    ios_base::sync_with_stdio(false);
    int n, s, t;
    cin >> n >> s >> t;
    dp[2][1][2][1] = 1;
    dp[2][2][1][0] = 1;
    par[2][1][2][1] = 1;
    par[2][2][2][1] = 1;
    par[2][2][1][0] = 1;
    for (int i = 3; i <= n; i++) {
        for (int st = 1; st <= i; st ++) {
            for (int en = 1; en <= i; en ++) {
                if (st != en) {
                    if (en > st) {
                        dp[i][st][en][1] = (dp[i][st][en][1] + par[i - 1][i - 1][en - 1][0] - par[i - 1][st - 1][en - 1][0] + mod + mod) % mod;
                        dp[i][st][en][0] = (dp[i][st][en][0] + par[i - 1][st - 1][en - 1][1]) % mod;
                    }
                    else {
                        dp[i][st][en][1] = (dp[i][st][en][1] + par[i - 1][i - 1][en][0] - par[i - 1][st - 1][en][0] + mod + mod) % mod;
                        dp[i][st][en][0] = (dp[i][st][en][0] + par[i - 1][st - 1][en][1] + mod) % mod;
                    }
//                  cout << i << " " << st << " " << en << " right " << dp[i][st][en][1] << endl;
//                  cout << i << " " << st << " " << en << " left " << dp[i][st][en][0] << endl;
                }
                par[i][st][en][1] = (par[i][st - 1][en][1] + dp[i][st][en][1]) % mod;
                par[i][st][en][0] = (par[i][st - 1][en][0] + dp[i][st][en][0]) % mod;
            }
        }
    }
    cout << (dp[n][s][t][1] + dp[n][s][t][0]) % mod << endl;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 756 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 756 KB Output is correct
3 Correct 5 ms 3616 KB Output is correct
4 Correct 10 ms 8188 KB Output is correct
5 Correct 11 ms 8188 KB Output is correct
6 Correct 10 ms 8188 KB Output is correct
7 Correct 10 ms 8188 KB Output is correct
8 Correct 10 ms 8188 KB Output is correct
9 Correct 9 ms 8200 KB Output is correct
10 Correct 10 ms 8200 KB Output is correct
11 Correct 9 ms 8200 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 756 KB Output is correct
3 Correct 5 ms 3616 KB Output is correct
4 Correct 10 ms 8188 KB Output is correct
5 Correct 11 ms 8188 KB Output is correct
6 Correct 10 ms 8188 KB Output is correct
7 Correct 10 ms 8188 KB Output is correct
8 Correct 10 ms 8188 KB Output is correct
9 Correct 9 ms 8200 KB Output is correct
10 Correct 10 ms 8200 KB Output is correct
11 Correct 9 ms 8200 KB Output is correct
12 Correct 242 ms 228976 KB Output is correct
13 Correct 231 ms 228976 KB Output is correct
14 Correct 258 ms 228976 KB Output is correct
15 Correct 256 ms 231296 KB Output is correct
16 Correct 250 ms 231296 KB Output is correct
17 Correct 266 ms 231296 KB Output is correct
18 Correct 204 ms 231296 KB Output is correct
19 Correct 243 ms 231296 KB Output is correct
20 Correct 243 ms 231296 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 756 KB Output is correct
3 Correct 5 ms 3616 KB Output is correct
4 Correct 10 ms 8188 KB Output is correct
5 Correct 11 ms 8188 KB Output is correct
6 Correct 10 ms 8188 KB Output is correct
7 Correct 10 ms 8188 KB Output is correct
8 Correct 10 ms 8188 KB Output is correct
9 Correct 9 ms 8200 KB Output is correct
10 Correct 10 ms 8200 KB Output is correct
11 Correct 9 ms 8200 KB Output is correct
12 Correct 242 ms 228976 KB Output is correct
13 Correct 231 ms 228976 KB Output is correct
14 Correct 258 ms 228976 KB Output is correct
15 Correct 256 ms 231296 KB Output is correct
16 Correct 250 ms 231296 KB Output is correct
17 Correct 266 ms 231296 KB Output is correct
18 Correct 204 ms 231296 KB Output is correct
19 Correct 243 ms 231296 KB Output is correct
20 Correct 243 ms 231296 KB Output is correct
21 Runtime error 693 ms 525312 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -