oj.uz

Submission #262570

# Submission time Handle Problem Language Result Execution time Memory
262570 2020-08-13T04:31:00 Z ToMmyDong Strange Device (APIO19_strange_device) C++11
65 / 100
 1022 ms 69096 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef tmd
typedef long long lll;
#else
typedef __int128 lll;
#endif
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) static_cast<int>(i.size())
#define FOR(i, j, k, in) for (int i=j; i < (k) ; i+=in)
#define RFOR(i, j, k, in) for (int i=j; i >= (k) ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i, j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(), _a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
template<typename T, typename S>
istream &operator >> (istream &is, pair<T, S> &p) {
    return is >> p.X >> p.Y;
}
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do {\
    fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T> void _do(T &&_x) {cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x, S &&..._t) {cerr <<_x <<" ,"; _do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s, const pair<_a, _b> &_p) {return _s << "(" << _p.X << "," << _p.Y << ")";}
template<typename It> ostream& _OUTC(ostream &_s, It _ita, It _itb)
{
    _s << "{";
    for (It _it=_ita; _it != _itb; _it++) {
        _s <<(_it == _ita?"":",")<< *_it;
    }
    _s << "}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s, const vector<_a> &_c) {return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,2> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,3> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,4> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const array<_a,5> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const set<_a> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s, const deque<_a> &_c) {return _OUTC(_s, ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s, const map<_a,_b> &_c) {return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif

const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 2e5 + 5;

void extGCD(lll A,lll B,lll &x,lll &y) { // A p coprime
    if (B == 0) {
        x = 1;
        y = 0;
        assert(A == 1);
        return;
    }
    lll xx,yy;
    extGCD(B,A%B,xx,yy);
    x = yy;
    y = xx - A/B*yy;
    return;
}

lll ext_inv (lll a, lll p) { // a, p co-prime
    lll x, y;
    extGCD(a,p, x, y);
    x %= p;
    if (x < 0) {
        x += p;
    }
    assert(a * x % p);
    return x;
}

lll di (lll a, lll b, lll md) {
    if (a == 0) {
        return 0;
    }
    assert(b != 0);
    lll cd = __gcd(a, b);
    a /= cd;
    b /= cd;
    return ext_inv(b,md) * a % md;
}
signed main () {
    TIME(main);
    IOS();

    ll n, a, b;
    cin >> n >> a >> b;


    lll sz = b*lll(a/__gcd(a,b+1));
    lll aw = a/__gcd(a,b+1);
#ifdef tmd
    for (int i=0; i<sz; i++) {
        debug(i, (i+i/b)%a, i%b);
    }
#endif
    debug(a, aw);

    vector<pair<lll,lll>> seg;
    lll g = (b+1) % a;
    for (int i=0; i<n; i++) {
        ll l, r;
        cin >> l >> r;
        if (r-l+1 >= sz) {
            cout << ll(sz) << endl;
            return 0;
        } else {
            debug(l, l/b, l%b);
            lll sft = (a+l%a+(l/b)%a-l%b%a)%a;
            debug(sft, g, a);
            lll rw = di(sft, g, a);
            lll st = l%b + b*rw;
            lll ed = st + r-l;
            st %= sz;
            ed %= sz;
            if (ed < st) {
                seg.eb(0, ed);
                seg.eb(st, sz-1);
            } else {
                seg.eb(st, ed);
            }

        }
    }
    sort(ALL(seg));
    debug(seg);

    lll lst = -1;
    lll ans = 0;
    for (auto p : seg) {
        ans += max(lll(0), p.Y - max(lst+1, p.X) + 1);
        lst = max(lst, p.Y);
        debug(ans);
    }

    cout << ll(ans) << endl;


    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:132:9: warning: unused variable 'aw' [-Wunused-variable]
  132 |     lll aw = a/__gcd(a,b+1);
      |         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 9 ms 1024 KB Output is correct
3 Correct 8 ms 1408 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 8 ms 1408 KB Output is correct
17 Correct 81 ms 5476 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 444 ms 39108 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 665 ms 33376 KB Output is correct
3 Correct 653 ms 53080 KB Output is correct
4 Correct 667 ms 52932 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 665 ms 33376 KB Output is correct
3 Correct 653 ms 53080 KB Output is correct
4 Correct 667 ms 52932 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 712 ms 53060 KB Output is correct
7 Correct 681 ms 52928 KB Output is correct
8 Correct 673 ms 52924 KB Output is correct
9 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 665 ms 33376 KB Output is correct
3 Correct 653 ms 53080 KB Output is correct
4 Correct 667 ms 52932 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 73 ms 7396 KB Output is correct
7 Correct 75 ms 7276 KB Output is correct
8 Correct 72 ms 7276 KB Output is correct
9 Correct 78 ms 7276 KB Output is correct
10 Correct 74 ms 7276 KB Output is correct
11 Correct 74 ms 7348 KB Output is correct
12 Correct 75 ms 7272 KB Output is correct
13 Correct 83 ms 7396 KB Output is correct
14 Correct 62 ms 7276 KB Output is correct
15 Correct 94 ms 7424 KB Output is correct
16 Correct 94 ms 7404 KB Output is correct
17 Correct 97 ms 7272 KB Output is correct
18 Correct 760 ms 69084 KB Output is correct
19 Correct 842 ms 52808 KB Output is correct
20 Correct 929 ms 53084 KB Output is correct
21 Correct 83 ms 7276 KB Output is correct
22 Correct 72 ms 7272 KB Output is correct
23 Correct 180 ms 26836 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 87 ms 4588 KB Output is correct
3 Correct 117 ms 7372 KB Output is correct
4 Correct 1022 ms 69096 KB Output is correct
5 Correct 98 ms 7524 KB Output is correct
6 Correct 93 ms 7276 KB Output is correct
7 Correct 102 ms 7540 KB Output is correct
8 Correct 119 ms 7268 KB Output is correct
9 Correct 103 ms 7388 KB Output is correct
10 Correct 84 ms 7272 KB Output is correct
11 Correct 78 ms 7276 KB Output is correct
12 Correct 65 ms 7272 KB Output is correct
13 Correct 94 ms 7392 KB Output is correct
14 Correct 993 ms 69060 KB Output is correct
15 Correct 79 ms 7272 KB Output is correct
16 Correct 727 ms 52692 KB Output is correct
17 Correct 807 ms 52544 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 9 ms 1024 KB Output is correct
3 Correct 8 ms 1408 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 8 ms 1408 KB Output is correct
17 Correct 81 ms 5476 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 444 ms 39108 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 665 ms 33376 KB Output is correct
31 Correct 653 ms 53080 KB Output is correct
32 Correct 667 ms 52932 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 712 ms 53060 KB Output is correct
35 Correct 681 ms 52928 KB Output is correct
36 Correct 673 ms 52924 KB Output is correct
37 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)