oj.uz

Submission #663069

# Submission time Handle Problem Language Result Execution time Memory
663069 2022-11-26T15:23:03 Z Ai7081 Strange Device (APIO19_strange_device) C++17
0 / 100
 393 ms 16796 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, ll>

const ll inf = 1e18+5;

ll n, a, b, loop, l, r;
vector<pii> v;

ll gcd(ll c1, ll c2) {
    if (!(max(c1,c2)%min(c1,c2))) return min(c1, c2);
    return gcd(min(c1,c2), max(c1,c2)%min(c1,c2));
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> a >> b;
    a/=gcd(a,b+1);
    while (a>0) {
        loop += (a%10)*b;
        if (loop>inf) break;
        a/=10;
    }
    while (n--) {
        cin >> l >> r, l%=loop, r%=loop;
        if (l>r) v.push_back({0,r}), v.push_back({l,loop-1});
        else v.push_back({l,r});
    }
    sort(v.begin(), v.end());
    ll out=0, ma=-1;
    for (auto [x,y]:v) out += (ma<x ? y-x+1 : max((ll)0,y-ma)), ma=max(ma,y);
    cout << out;
    return 0;
}

/*
3 3 3
4 4
7 9
17 18
ans: 4

3 5 10
1 20
50 68
89 98
ans: 31

1 1000000000000000 1000000000000000000
100000 1000000
*/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 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 212 KB Output is correct
2 Incorrect 393 ms 16796 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 30.0

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