제출 #382548

#제출 시각아이디문제언어결과실행 시간메모리
382548talant117408이상한 기계 (APIO19_strange_device)C++17
100 / 100
543 ms42716 KiB
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;

typedef long long ll;
typedef long double bigInt;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

const int mod = 1e9+7;

ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}

ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}

ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}

ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

void usaco(string s) {
    freopen((s+".in").c_str(), "r", stdin);
    freopen((s+".out").c_str(), "w", stdout);
}

ll n, a, b;

ll A(ll x) {
    return (x+x/b)%a;
}

ll B(ll x) {
    return x%b;
}

bool check(bigInt a, bigInt b) {
    return a*b > ll(1e18);
}

int main() {
    do_not_disturb
    //~ usaco("dirtraverse");
    
    cin >> n >> a >> b;
    vector <pll> v(n), segs;
    for (auto &to : v) cin >> to.first >> to.second;
    a = a/__gcd(a, b+1);
    ll t = (check(a, b) ? (ll)1e18 : a*b);
    bool flag = 0;
    for (auto to : v) {
        if (to.first/t == to.second/t) {
            segs.pb(mp(to.first%t, to.second%t));
        }
        else if (to.first/t+1 == to.second/t) {
            segs.pb(mp(to.first%t, t-1));
            segs.pb(mp(0, to.second%t));
        }
        else {
            flag = 1;
        }
    }
    if (flag) cout << t << endl;
    else {
        ll ans = 0;
        sort(all(segs));
        for (int i = 0, j = 0; i < sz(segs); i = j) {
            auto l = segs[i].first, r = segs[i].second;
            for ( ; j < sz(segs) && segs[j].first <= r; j++) {
                r = max(r, segs[j].second);
            }
            ans += r-l+1;
        }
        cout << ans << endl;
    }
    
    return 0;
}

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

strange_device.cpp: In function 'void usaco(std::string)':
strange_device.cpp:61:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   61 |     freopen((s+".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:62:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   62 |     freopen((s+".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...