Submission #556489

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
556489	2022-05-03T08:53:36 Z	InternetPerson10	Boat (APIO16_boat)	C++17	9 / 100	10 ms	8404 KB

boat

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

const ll MOD = 1e9 + 7;
ll BIG = 1000002;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    bool st1 = true;
    ll mi = MOD;
    for(int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        mi = min(mi, a[i]);
        mi = min(mi, b[i]);
        if(a[i] != b[i]) st1 = false;
    }
    mi--;
    for(int i = 0; i < n; i++) {
        a[i] -= mi;
        b[i] -= mi;
    }
    if(st1) {
        vector<ll> sums(n, 1);
        for(int i = 1; i < n; i++) {
            for(int j = 0; j < i; j++) {
                if(a[j] < a[i]) sums[i] += sums[j];
                sums[i] %= MOD;
            }
        }
        ll ans = 0;
        for(int i = 0; i < n; i++) ans += sums[i];
        cout << ans % MOD << '\n';
        return 0;
    }
    vector<unsigned int> nums(BIG);
    nums[0] = 1;
    for(int i = 0; i < n; i++) {
        ll g = 0;
        for(int j = 0; j < a[i]; j++) {
            g += nums[j];
            g %= MOD;
        }
        for(int j = a[i]; j <= b[i]; j++) {
            ll x = g;
            g += nums[j];
            nums[j] += x;
            nums[j] += MOD;
            nums[j] %= MOD;
            g %= MOD;
        }
    }
    ll ans = 0;
    for(int i = 1; i < BIG; i++) {
        ans += nums[i];
        ans %= MOD;
    }
    cout << ans << '\n';
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	2 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	2 ms	212 KB	Output is correct

Subtask #2

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	2 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	2 ms	212 KB	Output is correct
21	Runtime error	10 ms	8376 KB	Execution killed with signal 11
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	9 ms	8404 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	2 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	2 ms	212 KB	Output is correct
21	Runtime error	10 ms	8376 KB	Execution killed with signal 11
22	Halted	0 ms	0 KB	-