제출 #225965

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

strange_device

#include <bits/stdc++.h>
using namespace std;

#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 1e6 + 5;
const ll inf = 2e18;
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        if (fopen("VLJUM.INP", "r")){
                freopen("VLJUM.INP", "r", stdin);
                freopen("VLJUM.OUT", "w", stdout);
        }
        ll n;
        ll a, b;
        cin >> n >> a >> b;
        ll m = a / __gcd(a, b + 1);
        m = (inf / m < b ? inf : b * m);
        map<ll, ll> mem;
        for (int i = 1; i <= n; i++) {
            ll l, r;
            cin >> l >> r;
            r++;
            if (r - l >= m) {
                    cout << m << endl;
                    return 0;
            }
            l %= m;
            r %= m;
            if (l < r){
                    mem[l]++;
                    mem[r]--;
            }
            else {
                    mem[0]++;
                    mem[r]--;
                    mem[l]++;
                    mem[m]--;
            }
        }
        ll cur = 0, cnt = 0;
        ll now = 0;
        for (auto j : mem) {
            cnt += (now > 0) * (j.first - cur);
            cur = j.first;
            now += j.second;
        }
        cout << cnt << endl;
}
/*
*/

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

strange_device.cpp: In function 'int main()':
strange_device.cpp:14:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen("VLJUM.INP", "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:15:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen("VLJUM.OUT", "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• 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