Submission #556489

#	Time	Username	Problem	Language	Result	Execution time	Memory
556489		InternetPerson10	Boat (APIO16_boat)	C++17	9 / 100	10 ms	8404 KiB

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 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42