oj.uz

답안 #674057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674057 2022-12-22T19:00:49 Z Kahou 이상한 기계 (APIO19_strange_device) C++14
5 / 100
 27 ms 8116 KB 
/* In the name of God, aka Allah */
// let this be mytemp.cpp
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll inf = 2e18;
const int N = 1e6 + 50;
ll n, A, B;
pii P[N];
map<ll, ll> mp;

void solve() {
        cin >> n >> A >> B;
        ll C = B+1;
        ll lcm = A*min((inf+A-1)/A, C/__gcd(A, C));

        for (int i = 1; i <= n; i++) {
                cin >> P[i].F >> P[i].S;
                P[i].S ++;
                P[i].F += P[i].F/B;
                P[i].S += P[i].S/B;
                if (P[i].S - P[i].F >= lcm) {
                        return cout << lcm - lcm/C << endl, void();
                }
                ll l = P[i].F % lcm, r = P[i].S % lcm;
                mp[l]++;
                mp[r]--;
                if (r < l) mp[0]++, mp[lcm]--;
        }
        ll ans = 0;
        ll bl = 0;
        ll pt = 0;
        for (pll x:mp) {
                if (!bl) pt = x.F;
                bl += x.S;
                if (!bl) {
                        ans += (x.F-x.F/C)-(pt-pt/C);
                }
        }
        cout << ans << endl;
}
int main() {
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        solve();
        return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 27 ms 8116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 27 ms 8116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 27 ms 8116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -