답안 #683677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683677	2023-01-19T05:23:54 Z	Nursik	이상한 기계 (APIO19_strange_device)	C++17	65 / 100	454 ms	31860 KB

strange_device

#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
 
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
#define bug cout << "bug\n";

const ll maxn = 1e6 + 5, maxm = 2e2 + 1;
const ll mod = 1e9 + 7, inf = 1e9, block = 550, hb = 126067, base = 1000050017,
         biginf = 5e18;
const ld eps = 1e-15;
using namespace std;

int n;
ll a, b, p;
ll l[maxn], r[maxn];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> a >> b;
    a = a / gcd(a, b + 1);
    if (a > 1e18 / b){
        p = 1e18;
    }
    else{
        p = a * b;
    }
    vector<pair<ll, ll>> v;
    for (int i = 1; i <= n; ++i){
        cin >> l[i] >> r[i];
        ll x = l[i] % p;
        ll y = r[i] % p;
        if (x <= y){
            if (y - x + 1 >= p){
                cout << p;
                exit(0);
            }
            v.pb(mp(x, y));
        }
        else{
            v.pb(mp(x, p - 1));
            v.pb(mp(0, y));
        }
    }
    sort(v.begin(), v.end());
    ll ans = 0, nxt = -1;
    for (auto it : v){
        ll lf = it.f, rg = it.s;
        if (nxt < lf){
            ans += rg - lf + 1;
            nxt = rg;
        }
        else if (nxt <= rg){
            ans += rg - nxt;
            nxt = rg;
        }
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	4 ms	852 KB	Output is correct
3	Correct	5 ms	852 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	5 ms	852 KB	Output is correct
17	Correct	52 ms	3588 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	387 ms	31656 KB	Output is correct
3	Correct	397 ms	31740 KB	Output is correct
4	Correct	376 ms	31676 KB	Output is correct

Subtask #5
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	387 ms	31656 KB	Output is correct
3	Correct	397 ms	31740 KB	Output is correct
4	Correct	376 ms	31676 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	374 ms	31632 KB	Output is correct
7	Correct	381 ms	31860 KB	Output is correct
8	Correct	454 ms	31696 KB	Output is correct
9	Correct	412 ms	31640 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	387 ms	31656 KB	Output is correct
3	Correct	397 ms	31740 KB	Output is correct
4	Correct	376 ms	31676 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	39 ms	3600 KB	Output is correct
7	Correct	39 ms	3536 KB	Output is correct
8	Correct	37 ms	3536 KB	Output is correct
9	Correct	40 ms	3536 KB	Output is correct
10	Correct	37 ms	3528 KB	Output is correct
11	Correct	41 ms	3544 KB	Output is correct
12	Correct	38 ms	3576 KB	Output is correct
13	Correct	44 ms	3500 KB	Output is correct
14	Correct	37 ms	3536 KB	Output is correct
15	Correct	41 ms	3496 KB	Output is correct
16	Correct	39 ms	3560 KB	Output is correct
17	Correct	40 ms	3644 KB	Output is correct
18	Correct	428 ms	31764 KB	Output is correct
19	Correct	370 ms	31636 KB	Output is correct
20	Correct	426 ms	31744 KB	Output is correct
21	Correct	39 ms	3536 KB	Output is correct
22	Correct	34 ms	3560 KB	Output is correct
23	Correct	119 ms	12664 KB	Output is correct

Subtask #7
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	40 ms	3548 KB	Output is correct
3	Correct	44 ms	3560 KB	Output is correct
4	Correct	440 ms	31652 KB	Output is correct
5	Correct	42 ms	3520 KB	Output is correct
6	Correct	42 ms	3536 KB	Output is correct
7	Correct	41 ms	3516 KB	Output is correct
8	Correct	45 ms	3600 KB	Output is correct
9	Correct	42 ms	3576 KB	Output is correct
10	Correct	40 ms	3576 KB	Output is correct
11	Correct	41 ms	3536 KB	Output is correct
12	Correct	37 ms	3524 KB	Output is correct
13	Correct	43 ms	3488 KB	Output is correct
14	Correct	438 ms	31848 KB	Output is correct
15	Correct	39 ms	3552 KB	Output is correct
16	Correct	380 ms	31664 KB	Output is correct
17	Correct	384 ms	31756 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #8
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	4 ms	852 KB	Output is correct
3	Correct	5 ms	852 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	5 ms	852 KB	Output is correct
17	Correct	52 ms	3588 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Incorrect	0 ms	212 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

답안 #683677

Compilation message