제출 #121093

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
121093		tri	이상한 기계 (APIO19_strange_device)	C++14	100 / 100	3077 ms	33468 KiB

strange_device

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

ll N, A, B;

int main() {
    cin >> N >> A >> B;
    ll gcd = __gcd(A, B + 1);
    ll AP = A / gcd;

    if (AP > (ll) 1e18 / B) {
        // period is so big it won't matter
        ll ans = 0;
        for (int i = 0; i < N; i++) {
            ll l, r;
            cin >> l >> r;
            ans += (r - l + 1);
        }
        cout << ans << endl;
        return 0;
    }

    ll P = AP * B;

    vector<pl> delts;

    for (int i = 0; i < N; i++) {
        ll l, r;
        cin >> l >> r;
        if (r - l + 1 >= P) {
            cout << P << endl;
            return 0;
        }

        l %= P;
        r %= P;

        if (l <= r) {
            delts.pb({l, +1});
            delts.pb({r + 1, -1});
        } else {
            delts.pb({l, +1});
            delts.pb({P, -1});
            delts.pb({0, +1});
            delts.pb({r + 1, -1});
        }
    }

    sort(delts.begin(), delts.end());

    int cAct = 0;
    ll ans = 0;
    for (int i = 0; i < delts.size(); i++) {
        cAct += delts[i].s;
        if (i + 1 < delts.size()) {
            ll dist = delts[i + 1].f - delts[i].f;
            if (cAct > 0) {
                ans += dist;
            }
        }
    }
    cout << ans << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

strange_device.cpp: In function 'int main()':
strange_device.cpp:67:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < delts.size(); i++) {
                     ~~^~~~~~~~~~~~~~
strange_device.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i + 1 < delts.size()) {
             ~~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 20 / 20
• Subtask 7: 20 / 20
• Subtask 8: 30 / 30