oj.uz

Submission #252016

# Submission time Handle Problem Language Result Execution time Memory
252016 2020-07-23T17:00:31 Z DS007 Boat (APIO16_boat) C++14
9 / 100
 980 ms 20180 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 500, mod = 1e9 + 7;
int a[N], b[N];
int dp[2][N * N * 3];
int n;

int solveTestCase() {
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i] >> b[i];

    vector<int> v = {0};
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= n; j++)
            v.push_back(a[i] + j), v.push_back(a[i] - j), v.push_back(b[i] + j), v.push_back(b[i] - j);
    }

    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    for (int i = 0; i < n; i++) {
        a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
        b[i] = lower_bound(v.begin(), v.end(), b[i]) - v.begin();
    }

    dp[0][0] = 1;
    for (int i = a[0]; i <= b[0]; i++)
        dp[0][i] = 1;

    for (int i = 1; i < n; i++) {
        dp[i%2][0] = 1;
        int sum = 0;
        for (int j = 0; j < a[i]; j++)
            dp[i%2][j] = dp[(i - 1)%2][j], sum += dp[(i - 1)%2][j], sum %= mod;
        for (int j = b[i] + 1; j < N * N * 3; j++)
            dp[i%2][j] = dp[(i - 1)%2][j];

        for (int j = a[i]; j <= b[i]; j++)
            sum +=  dp[(i - 1)%2][j], sum %= mod, dp[i%2][j] = sum;
    }

    int ans = 0;
    for (int i = 1; i < N * N * 3; i++)
        ans += dp[(n - 1)%2][i], ans %= mod;

    cout << ans;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    //cin >> t;
    while (t--)
        solveTestCase();
}

Compilation message

boat.cpp: In function 'long long int solveTestCase()':
boat.cpp:50:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 20052 KB Output is correct
2 Correct 927 ms 20048 KB Output is correct
3 Correct 929 ms 20052 KB Output is correct
4 Correct 980 ms 20052 KB Output is correct
5 Correct 960 ms 20052 KB Output is correct
6 Correct 926 ms 20056 KB Output is correct
7 Correct 916 ms 20180 KB Output is correct
8 Correct 908 ms 20056 KB Output is correct
9 Correct 969 ms 20052 KB Output is correct
10 Correct 967 ms 20060 KB Output is correct
11 Correct 957 ms 20052 KB Output is correct
12 Correct 917 ms 20052 KB Output is correct
13 Correct 914 ms 20056 KB Output is correct
14 Correct 939 ms 20052 KB Output is correct
15 Correct 933 ms 20052 KB Output is correct
16 Correct 560 ms 20052 KB Output is correct
17 Correct 708 ms 20056 KB Output is correct
18 Correct 660 ms 20044 KB Output is correct
19 Correct 710 ms 20052 KB Output is correct
20 Correct 543 ms 20052 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 20052 KB Output is correct
2 Correct 927 ms 20048 KB Output is correct
3 Correct 929 ms 20052 KB Output is correct
4 Correct 980 ms 20052 KB Output is correct
5 Correct 960 ms 20052 KB Output is correct
6 Correct 926 ms 20056 KB Output is correct
7 Correct 916 ms 20180 KB Output is correct
8 Correct 908 ms 20056 KB Output is correct
9 Correct 969 ms 20052 KB Output is correct
10 Correct 967 ms 20060 KB Output is correct
11 Correct 957 ms 20052 KB Output is correct
12 Correct 917 ms 20052 KB Output is correct
13 Correct 914 ms 20056 KB Output is correct
14 Correct 939 ms 20052 KB Output is correct
15 Correct 933 ms 20052 KB Output is correct
16 Correct 560 ms 20052 KB Output is correct
17 Correct 708 ms 20056 KB Output is correct
18 Correct 660 ms 20044 KB Output is correct
19 Correct 710 ms 20052 KB Output is correct
20 Correct 543 ms 20052 KB Output is correct
21 Correct 509 ms 20052 KB Output is correct
22 Correct 661 ms 20056 KB Output is correct
23 Correct 547 ms 20052 KB Output is correct
24 Correct 528 ms 20056 KB Output is correct
25 Correct 524 ms 20052 KB Output is correct
26 Correct 507 ms 20052 KB Output is correct
27 Correct 494 ms 20052 KB Output is correct
28 Correct 600 ms 20056 KB Output is correct
29 Correct 516 ms 20052 KB Output is correct
30 Incorrect 895 ms 20052 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 107 ms 12540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 20052 KB Output is correct
2 Correct 927 ms 20048 KB Output is correct
3 Correct 929 ms 20052 KB Output is correct
4 Correct 980 ms 20052 KB Output is correct
5 Correct 960 ms 20052 KB Output is correct
6 Correct 926 ms 20056 KB Output is correct
7 Correct 916 ms 20180 KB Output is correct
8 Correct 908 ms 20056 KB Output is correct
9 Correct 969 ms 20052 KB Output is correct
10 Correct 967 ms 20060 KB Output is correct
11 Correct 957 ms 20052 KB Output is correct
12 Correct 917 ms 20052 KB Output is correct
13 Correct 914 ms 20056 KB Output is correct
14 Correct 939 ms 20052 KB Output is correct
15 Correct 933 ms 20052 KB Output is correct
16 Correct 560 ms 20052 KB Output is correct
17 Correct 708 ms 20056 KB Output is correct
18 Correct 660 ms 20044 KB Output is correct
19 Correct 710 ms 20052 KB Output is correct
20 Correct 543 ms 20052 KB Output is correct
21 Correct 509 ms 20052 KB Output is correct
22 Correct 661 ms 20056 KB Output is correct
23 Correct 547 ms 20052 KB Output is correct
24 Correct 528 ms 20056 KB Output is correct
25 Correct 524 ms 20052 KB Output is correct
26 Correct 507 ms 20052 KB Output is correct
27 Correct 494 ms 20052 KB Output is correct
28 Correct 600 ms 20056 KB Output is correct
29 Correct 516 ms 20052 KB Output is correct
30 Incorrect 895 ms 20052 KB Output isn't correct
31 Halted 0 ms 0 KB -