Submission #526980

#	Time	Username	Problem	Language	Result	Execution time	Memory
526980		Lobo	Strange Device (APIO19_strange_device)	C++17	10 / 100	511 ms	16932 KiB

strange_device

#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
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30