oj.uz

Submission #211458

# Submission time Handle Problem Language Result Execution time Memory
211458 2020-03-20T12:00:19 Z VEGAnn Strange Device (APIO19_strange_device) C++14
5 / 100
 787 ms 524292 KB 
#include <bits/stdc++.h>
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define pll pair<ll, ll>
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
vector<pll> vc;
vector<pll> seg;
int n;
ll A, B;

int main(){

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#else
    ios_base::sync_with_stdio(0); cin.tie(0);
#endif // _LOCAL

    cin >> n >> A >> B;

    if (B <= ll(1e6)){

        ll fi = A;

        while (fi <= ll(1e18) && ((fi + fi / B) % A != 0 || fi % B != 0))
            fi += A;

        seg.clear();

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

            if (r - l + 1 >= fi){
                seg.PB(MP(0, fi - 1));
                continue;
            }

            ll vl = ((l - 1) / fi) * fi + fi;

            if (vl > r){
                vl -= fi;
                seg.PB(MP(l - vl, r - vl));
            } else {
                vl -= fi;
                seg.PB(MP(l - vl, fi - 1));
                vl += fi;
                seg.PB(MP(0ll, r - vl));
            }
        }

        sort(all(seg));

        ll lst = -1, ans = 0;

        for (pll cr : seg)
            if (cr.ft > lst){
                ans += cr.sd - cr.ft + 1ll;
                lst = cr.sd;
            } else {

                ans += max(lst, cr.sd) - lst;
                lst = max(lst, cr.sd);
            }

        cout << ans << '\n';

        return 0;
    }

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

        for (ll t = l; t <= r; t++)
            vc.PB(MP((t + t / B) % A, t % B));
    }

    sort(all(vc));
    vc.resize(unique(all(vc)) - vc.begin());

    cout << sz(vc);

    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Runtime error 616 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 444 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 445 ms 33300 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 532 ms 17080 KB Output is correct
3 Incorrect 540 ms 17388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 532 ms 17080 KB Output is correct
3 Incorrect 540 ms 17388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 532 ms 17080 KB Output is correct
3 Incorrect 540 ms 17388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 61 ms 2884 KB Output is correct
3 Runtime error 787 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

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