oj.uz

Submission #887196

# Submission time Handle Problem Language Result Execution time Memory
887196 2023-12-14T03:26:50 Z Kutan Strange Device (APIO19_strange_device) C++14
100 / 100
 366 ms 71620 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 1e6 + 5;

int n;
ll A, B, l[N], r[N];

void readip(){
    cin >> n >> A >> B;
    REP(i, 1, n) cin >> l[i] >> r[i];
}

namespace sub1{
    bool check() {
        ll s = 0;
        REP(i, 1, n) s += r[i] - l[i] + 1;
        return s <= 1e6;
    }

    void solve() {
        vector<pair<ll, ll>> distinct;
        REP(i, 1, n) {
            for (ll x = l[i]; x <= r[i]; ++x) 
                distinct.eb((x + x / B) % A , x % B);
        }
        sort(ALL(distinct));
        distinct.erase(unique(ALL(distinct)), distinct.end());
        cout << distinct.size() << ln;
    }
};

const ll oo = 1e18 + 1;

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return a + b;
    return gcd(b % a, a);
}

namespace sub2{
    void solve() {
        vector<pair<ll,ll>> segment;
        ll cyc = oo / A >= (B + 1) ? A / gcd(A, B+1) * B : oo;
        // cout << cyc << ln;
        REP(i, 1, n) {
            if (r[i] - l[i] + 1 >= cyc) {
                cout << cyc << ln;
                return;
            }
            if (l[i] / cyc < r[i] / cyc)
                segment.eb(l[i] % cyc, cyc - 1), segment.eb(0, r[i] % cyc);
            else
                segment.eb(l[i] % cyc, r[i] % cyc);
        }
        ll Right = -1, Left = 0, res = 0;
        sort(ALL(segment));
        for (auto [l, r] : segment) {
            if (l > Right) {
                res += Right - Left + 1;
                Left = l, Right = r;
                continue;
            }
            maximize(Right, r);
        }
        res += Right - Left + 1;
        cout << res << ln;
    }
};
void solve(){       
    // if (sub1::check()) {
    //     sub1::solve();
    //     return;
    // }    

    // if (B == 1) {
    //     sub2::solve();
    //     return;
    // }

    sub2::solve();

    // int m = 8;
    // for (int i = 35; i <= 10000; i += m) {
    //     REP(j, 0, m - 1) cout << ((i + j)  * 2) % m << ' ';
    //     cout << ln;
    // }
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

strange_device.cpp: In function 'void readip()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:144:5: note: in expansion of macro 'REP'
  144 |     REP(i, 1, n) cin >> l[i] >> r[i];
      |     ^~~
strange_device.cpp: In function 'bool sub1::check()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:150:9: note: in expansion of macro 'REP'
  150 |         REP(i, 1, n) s += r[i] - l[i] + 1;
      |         ^~~
strange_device.cpp: In function 'void sub1::solve()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:156:9: note: in expansion of macro 'REP'
  156 |         REP(i, 1, n) {
      |         ^~~
strange_device.cpp: In function 'void sub2::solve()':
strange_device.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
strange_device.cpp:178:9: note: in expansion of macro 'REP'
  178 |         REP(i, 1, n) {
      |         ^~~
strange_device.cpp:190:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  190 |         for (auto [l, r] : segment) {
      |                   ^
strange_device.cpp: In function 'void file()':
strange_device.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 5 ms 3040 KB Output is correct
3 Correct 4 ms 2908 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2440 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 4 ms 2916 KB Output is correct
17 Correct 34 ms 8960 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 205 ms 32992 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 307 ms 34540 KB Output is correct
3 Correct 292 ms 32748 KB Output is correct
4 Correct 288 ms 33744 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 307 ms 34540 KB Output is correct
3 Correct 292 ms 32748 KB Output is correct
4 Correct 288 ms 33744 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 297 ms 33848 KB Output is correct
7 Correct 310 ms 71468 KB Output is correct
8 Correct 307 ms 70824 KB Output is correct
9 Correct 323 ms 70628 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 307 ms 34540 KB Output is correct
3 Correct 292 ms 32748 KB Output is correct
4 Correct 288 ms 33744 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 30 ms 8908 KB Output is correct
7 Correct 33 ms 12660 KB Output is correct
8 Correct 31 ms 12660 KB Output is correct
9 Correct 36 ms 12776 KB Output is correct
10 Correct 31 ms 12652 KB Output is correct
11 Correct 32 ms 12496 KB Output is correct
12 Correct 30 ms 12496 KB Output is correct
13 Correct 34 ms 12516 KB Output is correct
14 Correct 31 ms 12656 KB Output is correct
15 Correct 39 ms 13008 KB Output is correct
16 Correct 33 ms 12492 KB Output is correct
17 Correct 32 ms 12636 KB Output is correct
18 Correct 307 ms 71620 KB Output is correct
19 Correct 297 ms 71004 KB Output is correct
20 Correct 338 ms 70620 KB Output is correct
21 Correct 33 ms 12496 KB Output is correct
22 Correct 28 ms 12492 KB Output is correct
23 Correct 91 ms 32992 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 32 ms 8920 KB Output is correct
3 Correct 33 ms 12544 KB Output is correct
4 Correct 362 ms 71000 KB Output is correct
5 Correct 35 ms 12496 KB Output is correct
6 Correct 34 ms 12496 KB Output is correct
7 Correct 32 ms 12636 KB Output is correct
8 Correct 34 ms 12508 KB Output is correct
9 Correct 34 ms 12492 KB Output is correct
10 Correct 36 ms 12524 KB Output is correct
11 Correct 33 ms 12504 KB Output is correct
12 Correct 31 ms 12512 KB Output is correct
13 Correct 35 ms 12492 KB Output is correct
14 Correct 365 ms 70848 KB Output is correct
15 Correct 33 ms 12640 KB Output is correct
16 Correct 304 ms 70108 KB Output is correct
17 Correct 309 ms 71356 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 5 ms 3040 KB Output is correct
3 Correct 4 ms 2908 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2440 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 4 ms 2916 KB Output is correct
17 Correct 34 ms 8960 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 205 ms 32992 KB Output is correct
29 Correct 0 ms 2396 KB Output is correct
30 Correct 307 ms 34540 KB Output is correct
31 Correct 292 ms 32748 KB Output is correct
32 Correct 288 ms 33744 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 297 ms 33848 KB Output is correct
35 Correct 310 ms 71468 KB Output is correct
36 Correct 307 ms 70824 KB Output is correct
37 Correct 323 ms 70628 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 30 ms 8908 KB Output is correct
40 Correct 33 ms 12660 KB Output is correct
41 Correct 31 ms 12660 KB Output is correct
42 Correct 36 ms 12776 KB Output is correct
43 Correct 31 ms 12652 KB Output is correct
44 Correct 32 ms 12496 KB Output is correct
45 Correct 30 ms 12496 KB Output is correct
46 Correct 34 ms 12516 KB Output is correct
47 Correct 31 ms 12656 KB Output is correct
48 Correct 39 ms 13008 KB Output is correct
49 Correct 33 ms 12492 KB Output is correct
50 Correct 32 ms 12636 KB Output is correct
51 Correct 307 ms 71620 KB Output is correct
52 Correct 297 ms 71004 KB Output is correct
53 Correct 338 ms 70620 KB Output is correct
54 Correct 33 ms 12496 KB Output is correct
55 Correct 28 ms 12492 KB Output is correct
56 Correct 91 ms 32992 KB Output is correct
57 Correct 0 ms 2392 KB Output is correct
58 Correct 32 ms 8920 KB Output is correct
59 Correct 33 ms 12544 KB Output is correct
60 Correct 362 ms 71000 KB Output is correct
61 Correct 35 ms 12496 KB Output is correct
62 Correct 34 ms 12496 KB Output is correct
63 Correct 32 ms 12636 KB Output is correct
64 Correct 34 ms 12508 KB Output is correct
65 Correct 34 ms 12492 KB Output is correct
66 Correct 36 ms 12524 KB Output is correct
67 Correct 33 ms 12504 KB Output is correct
68 Correct 31 ms 12512 KB Output is correct
69 Correct 35 ms 12492 KB Output is correct
70 Correct 365 ms 70848 KB Output is correct
71 Correct 33 ms 12640 KB Output is correct
72 Correct 304 ms 70108 KB Output is correct
73 Correct 309 ms 71356 KB Output is correct
74 Correct 1 ms 2396 KB Output is correct
75 Correct 1 ms 2396 KB Output is correct
76 Correct 1 ms 2396 KB Output is correct
77 Correct 0 ms 2396 KB Output is correct
78 Correct 2 ms 2392 KB Output is correct
79 Correct 4 ms 3164 KB Output is correct
80 Correct 351 ms 71456 KB Output is correct
81 Correct 366 ms 71588 KB Output is correct
82 Correct 328 ms 70884 KB Output is correct
83 Correct 329 ms 69800 KB Output is correct
84 Correct 342 ms 71516 KB Output is correct
85 Correct 332 ms 71544 KB Output is correct
86 Correct 92 ms 33476 KB Output is correct
87 Correct 1 ms 2392 KB Output is correct