oj.uz

Submission #526980

# Submission time Handle Problem Language Result Execution time Memory
526980 2022-02-16T18:49:20 Z Lobo Strange Device (APIO19_strange_device) C++17
10 / 100
 511 ms 16932 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 4e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 

void solve() {
    int n, a, b;
    cin >> n >> a >> b;
    int m;
    if(log2(a) + log2(b) > log2(inf)) {
        m = inf;
        vector<pair<int,int>> lr;

        for(int i = 1; i <= n; i++) {
            int l, r; cin >> l >> r;
            lr.pb(mp(l,r));
        }

        sort(all(lr));

        int l = 0;
        int r = -1;
        int ans = 0;
        for(auto x : lr) {
            int l1 = x.fr;
            int r1 = x.sc;

            if(l1 > r) {
                //conta o l r anterior e comeca um novo
                ans+= r-l+1;
                l = l1;
                r = r1;
            }
            r = max(r,r1);
        }

        ans+= r-l+1;

        cout << ans << endl;
    }
    else {
        m = a*b;

        vector<pair<int,int>> lr;
        for(int i = 1; i <= n; i++) {
            int l, r; cin >> l >> r;

            if(l/m != r/m) {
                //terminam em cantos diferentes
                l%= m;
                r%= m;
                //colocar l,m-1 e 0,r
                lr.pb(mp(l,m-1));
                lr.pb(mp(0,r));
            }
            else {
                l%= m;
                r%= m;
                lr.pb(mp(l,r));
            }
        }

        sort(all(lr));

        int l = 0;
        int r = -1;
        int ans = 0;
        for(auto x : lr) {
            int l1 = x.fr;
            int r1 = x.sc;

            if(l1 > r) {
                //conta o l r anterior e comeca um novo
                ans+= r-l+1;
                l = l1;
                r = r1;
            }
            r = max(r,r1);
        }

        ans+= r-l+1;

        cout << ans << endl;
    }


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 656 KB Output is correct
3 Correct 5 ms 592 KB Output is correct
4 Incorrect 1 ms 204 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 323 ms 16932 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 511 ms 16836 KB Output is correct
3 Incorrect 395 ms 16788 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 204 KB Output is correct
2 Correct 511 ms 16836 KB Output is correct
3 Incorrect 395 ms 16788 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 204 KB Output is correct
2 Correct 511 ms 16836 KB Output is correct
3 Incorrect 395 ms 16788 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 204 KB Output is correct
2 Correct 43 ms 2460 KB Output is correct
3 Correct 40 ms 2492 KB Output is correct
4 Correct 475 ms 16924 KB Output is correct
5 Correct 38 ms 2480 KB Output is correct
6 Correct 38 ms 2444 KB Output is correct
7 Correct 38 ms 2452 KB Output is correct
8 Correct 43 ms 2496 KB Output is correct
9 Correct 38 ms 2492 KB Output is correct
10 Correct 40 ms 2504 KB Output is correct
11 Correct 38 ms 2504 KB Output is correct
12 Correct 35 ms 2500 KB Output is correct
13 Correct 38 ms 2416 KB Output is correct
14 Correct 422 ms 16784 KB Output is correct
15 Incorrect 40 ms 2504 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 656 KB Output is correct
3 Correct 5 ms 592 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -