oj.uz

Submission #363855

# Submission time Handle Problem Language Result Execution time Memory
363855 2021-02-07T11:34:57 Z Mahdi_Shokoufi Strange Device (APIO19_strange_device) C++17
5 / 100
 704 ms 81096 KB 
//In the name of Allah
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair

typedef long long ll;

const ll inf = 1e18 + 10;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, a, b;
    cin >> n >> a >> b;
    ll p = (inf / b < a / __gcd(a, b + 1) ? inf : a / __gcd(a, b + 1) * b);
    set < pair < ll , ll > > st;
    for (int i = 0; i < n; i ++){
        ll l, r;
        cin >> l >> r;
        if (p <= r - l + 1)
            return cout << p, 0;
        l %= p; r %= p;
        if (l <= r)
            st.insert(mp(l, -r));
        else
            st.insert(mp(l, -p + 1)), st.insert(mp(0, r));
    }
    ll ans = 0, mx = -1;
    for (auto itr = st.begin(); itr != st.end(); itr ++){
        ll x = itr -> first, y = -(itr -> second);
        ans += max(0LL, y - max(mx + 1, x) + 1);
        mx = max(mx, y);
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 7 ms 1388 KB Output is correct
3 Incorrect 7 ms 1388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 620 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 701 ms 68648 KB Output is correct
3 Incorrect 698 ms 80624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 701 ms 68648 KB Output is correct
3 Incorrect 698 ms 80624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 701 ms 68648 KB Output is correct
3 Incorrect 698 ms 80624 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 69 ms 10348 KB Output is correct
3 Correct 71 ms 10348 KB Output is correct
4 Correct 704 ms 81096 KB Output is correct
5 Correct 81 ms 10348 KB Output is correct
6 Correct 93 ms 10348 KB Output is correct
7 Correct 67 ms 10348 KB Output is correct
8 Correct 67 ms 10348 KB Output is correct
9 Correct 68 ms 10348 KB Output is correct
10 Correct 65 ms 10348 KB Output is correct
11 Correct 65 ms 10348 KB Output is correct
12 Incorrect 68 ms 10348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 7 ms 1388 KB Output is correct
3 Incorrect 7 ms 1388 KB Output isn't correct
4 Halted 0 ms 0 KB -