oj.uz

답안 #556506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556506 2022-05-03T09:17:16 Z InternetPerson10 Boat (APIO16_boat) C++17
9 / 100
 19 ms 17164 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    vector<unsigned int> nums;
    nums.resize(BIG);
    nums[BIG - 1] = 3;
    map<int, int> m;
    bool st1 = true;
    for(int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
        m[a[i]]++;
        m[b[i]]--;
        if(a[i] != b[i]) st1 = false;
    }
    int x = 0;
    ll mi = 0;
    for(auto p : m) {
        if(x == 0) {
            mi += p.first - 1;
        }
        for(int i = 0; i < n; i++) {
            if(a[i] == p.first) a[i] -= mi;
            if(b[i] == p.first) b[i] -= mi;
        }
        x += p.second;
        if(x == 0) {
            mi -= p.first;
        }
    }
    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;
    }
    ll ma = 0;
    for(int i = 0; i < n; i++) {
        cout << a[i] << ' ' << b[i] << endl;
        ma = max(ma, a[i]);
        ma = max(ma, b[i]);
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 7 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8572 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 6 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 5 ms 8532 KB Output is correct
12 Correct 5 ms 8532 KB Output is correct
13 Correct 4 ms 8532 KB Output is correct
14 Correct 5 ms 8532 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 5 ms 8532 KB Output is correct
17 Correct 5 ms 8472 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 5 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 7 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8572 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 6 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 5 ms 8532 KB Output is correct
12 Correct 5 ms 8532 KB Output is correct
13 Correct 4 ms 8532 KB Output is correct
14 Correct 5 ms 8532 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 5 ms 8532 KB Output is correct
17 Correct 5 ms 8472 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 5 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct
21 Incorrect 19 ms 8532 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 17164 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8532 KB Output is correct
2 Correct 7 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 5 ms 8532 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 5 ms 8532 KB Output is correct
7 Correct 5 ms 8572 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 6 ms 8532 KB Output is correct
10 Correct 5 ms 8532 KB Output is correct
11 Correct 5 ms 8532 KB Output is correct
12 Correct 5 ms 8532 KB Output is correct
13 Correct 4 ms 8532 KB Output is correct
14 Correct 5 ms 8532 KB Output is correct
15 Correct 5 ms 8532 KB Output is correct
16 Correct 5 ms 8532 KB Output is correct
17 Correct 5 ms 8472 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 5 ms 8532 KB Output is correct
20 Correct 5 ms 8532 KB Output is correct
21 Incorrect 19 ms 8532 KB Output isn't correct
22 Halted 0 ms 0 KB -