oj.uz

Submission #1044799

# Submission time Handle Problem Language Result Execution time Memory
1044799 2024-08-05T13:40:29 Z vjudge1 Strange Device (APIO19_strange_device) C++17
10 / 100
 368 ms 63060 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 21
const ll MOD = 1e9 + 7;
const ll MAXN = 3e4 + 100;

#define int long long
set<pair<int,int>> st;
void add_seg(int l, int r) {
    st.insert({l, r});
    return ;
}

signed main() {
    fast
    ll n, A, B, mx = -1;
    cin >> n >> A >> B;

    if ((((long long)1e9) * ((long long)1e9) + A - 1LL) / A <= B && A * B != 1e18) {
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int l, r;
            cin >> l >> r;
            add_seg(l, r);
        }

        for (auto u : st) {
            ans += max(0LL, (u.s - max(mx + 1, u.f)) + 1);
            mx = max(mx, u.s);
        }
        cout << ans << "\n";
        return 0;
    }

    A *= B;

    for (int i = 0; i < n; i++) {
        int l, r;
        cin >> l >> r;

        if (r - l + 1 >= A) {
            cout << A << "\n";
            return 0;
        }

        int x = l % A;
        int y = r % A;
        if (y < x) {
            add_seg(x, A-1);
            add_seg(0, y);
        } else
            add_seg(x, y);
    }

    ll ans = 0;
    for (auto u : st) {
        ans += max(0LL, u.s - max(mx + 1, u.f) + 1);
        mx = max(mx, u.s);
    }
    cout << ans << "\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 123 ms 348 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 328 ms 62924 KB Output is correct
3 Incorrect 353 ms 62944 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 328 ms 62924 KB Output is correct
3 Incorrect 353 ms 62944 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 328 ms 62924 KB Output is correct
3 Incorrect 353 ms 62944 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 33 ms 6488 KB Output is correct
3 Correct 34 ms 6480 KB Output is correct
4 Correct 368 ms 63060 KB Output is correct
5 Correct 35 ms 6484 KB Output is correct
6 Correct 33 ms 6480 KB Output is correct
7 Correct 37 ms 6692 KB Output is correct
8 Correct 34 ms 6492 KB Output is correct
9 Correct 35 ms 6484 KB Output is correct
10 Correct 30 ms 6492 KB Output is correct
11 Correct 31 ms 6688 KB Output is correct
12 Correct 33 ms 6488 KB Output is correct
13 Correct 33 ms 6688 KB Output is correct
14 Correct 364 ms 62804 KB Output is correct
15 Incorrect 32 ms 6480 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -