Submission #413220

#	Time	Username	Problem	Language	Result	Execution time	Memory
413220		arayi	Strange Device (APIO19_strange_device)	C++17	100 / 100	603 ms	53376 KiB

strange_device

//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>   
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };


const int N = 1e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 550;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template<class T>
void maxi(T& a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T& a, T b)
{
    a = min(a, b);
}



int n;
lli A, B, x;
int main()
{
    fastio;
    cin >> n >> A >> B;
    x = A / gcd(A, B + 1LL);
    if (x > mod * mod / B) x = 1e18 + 1LL;
    else x *= B;
    vector<pair<lli, lli> > fp;
    //cout << x << endl;
    for (int i = 0; i < n; i++)
    {
        lli l, r;
        cin >> l >> r;
        if (r - l >= x)
        {
            cout << x << endl;
            return 0;
        }
        if (l % x > r % x) fp.ad(MP(l % x, x - 1LL)), fp.ad(MP(0, r % x));
        else fp.ad(MP(l % x, r % x));
    }
    sort(all(fp));
    lli mx = -1, ans = x;
    for (int i = 0; i < fp.size(); i++)
    {
        //cout << fp[i] << endl;
        ans -= max(0LL, fp[i].fr - mx - 1LL);
        maxi(mx, fp[i].sc);
    }
    ans -= max(0LL, x - mx - 1LL);
    cout << ans << endl;
    return 0;
}

/*
* 
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Compilation message (stderr)

strange_device.cpp: In function 'int main()':
strange_device.cpp:122:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for (int i = 0; i < fp.size(); i++)
      |                     ~~^~~~~~~~~~~

• 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