제출 #741871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741871		becaido	이상한 기계 (APIO19_strange_device)	C++17	100 / 100	474 ms	53404 KiB

strange_device

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const ll INF = 2e18;

int n;
ll a, b, len, ans;
vector<pair<ll, ll>> v;

void solve() {
    cin >> n >> a >> b;
    len = a / gcd(a, b + 1);
    if ((__int128) len * b >= INF) len = INF;
    else len *= b;
    while (n--) {
        ll l, r;
        cin >> l >> r;
        if (r - l + 1 >= len) {
            cout << len << '\n';
            return;
        }
        if (l % len <= r % len) v.pb(l % len, r % len);
        else v.pb(l % len, len - 1), v.pb(0, r % len);
    }
    sort(v.begin(), v.end());
    ll R = -1;
    for (auto [l, r] : v) {
        if (l > R) R = l;
        if (r >= R) {
            ans += r - R + 1;
            R = r + 1;
        }
    }
    cout << ans << '\n';
}

int main() {
    Waimai;
    solve();
}

• 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