oj.uz

Submission #262593

# Submission time Handle Problem Language Result Execution time Memory
262593 2020-08-13T04:54:22 Z ToMmyDong Strange Device (APIO19_strange_device) C++11
65 / 100
 1211 ms 52928 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef tmd
typedef __int128 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;
    assert(__gcd(a, b) == 1);

    lll cd_2 = __gcd(b, md);
    b /= cd_2;
    md /= cd_2;
    
    return ext_inv(b,md) * a % md;
}
signed main () {
    TIME(main);
    IOS();

    debug(RAND_MAX);
    //while (true) {

    ll n, a, b;
#ifdef tmd
    n = rand() % 10000+1;
    //a = ( ( ll(rand())<<32 ) + rand() ) % ll( 1e18 );
    a = rand()%100 + 1;
    b = rand()%3 + 1;
#else
    cin >> n >> a >> b;
#endif
    debug(n, a, b);

    lll sz = b*lll(a/__gcd(a,b+1));
    if (sz == 1) {
        cout << 1 << endl;
        //continue;
        return 0;
    }

    vector<pair<lll,lll>> seg;
    lll g = (b+1) % a;

    lll LS = 0;
    bool gg= false;
    for (int i=0; i<n; i++) {
        ll l, r;
#ifdef tmd
        l = LS + rand();
        r = l + rand() % (sz-1);
        LS = r;
#else        
        cin >> l >> r;
#endif
        if (r-l+1 >= sz) {
            cout << ll(sz) << endl;
            gg = true;
            break;
        } else {
            lll sft = (a+l%a+(l/b)%a-l%b%a)%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);
            }

        }
    }
    if (gg) {
        //continue;
        return 0;
    }
    sort(ALL(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);
    }

    cout << ll(ans) << endl;
    //}


    return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:157:9: warning: unused variable 'LS' [-Wunused-variable]
  157 |     lll LS = 0;
      |         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 10 ms 1280 KB Output is correct
3 Correct 9 ms 1280 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 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 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 9 ms 1280 KB Output is correct
17 Correct 95 ms 5744 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 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 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 1 ms 384 KB Output is correct
2 Correct 1 ms 400 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 466 ms 33856 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 715 ms 33344 KB Output is correct
3 Correct 700 ms 33480 KB Output is correct
4 Correct 717 ms 33344 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 715 ms 33344 KB Output is correct
3 Correct 700 ms 33480 KB Output is correct
4 Correct 717 ms 33344 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 753 ms 33344 KB Output is correct
7 Correct 738 ms 33472 KB Output is correct
8 Correct 739 ms 33348 KB Output is correct
9 Incorrect 843 ms 52928 KB Output isn't correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 715 ms 33344 KB Output is correct
3 Correct 700 ms 33480 KB Output is correct
4 Correct 717 ms 33344 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 79 ms 5096 KB Output is correct
7 Correct 77 ms 5104 KB Output is correct
8 Correct 77 ms 5096 KB Output is correct
9 Correct 79 ms 5100 KB Output is correct
10 Correct 86 ms 5260 KB Output is correct
11 Correct 90 ms 5096 KB Output is correct
12 Correct 87 ms 5096 KB Output is correct
13 Correct 98 ms 5096 KB Output is correct
14 Correct 70 ms 5096 KB Output is correct
15 Correct 111 ms 5096 KB Output is correct
16 Correct 103 ms 5096 KB Output is correct
17 Correct 131 ms 5156 KB Output is correct
18 Correct 893 ms 33520 KB Output is correct
19 Correct 1022 ms 33520 KB Output is correct
20 Correct 1113 ms 33508 KB Output is correct
21 Correct 92 ms 5096 KB Output is correct
22 Correct 79 ms 5224 KB Output is correct
23 Correct 181 ms 17440 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 104 ms 5352 KB Output is correct
3 Correct 111 ms 5096 KB Output is correct
4 Correct 1211 ms 33592 KB Output is correct
5 Correct 117 ms 5096 KB Output is correct
6 Correct 108 ms 5096 KB Output is correct
7 Correct 121 ms 5188 KB Output is correct
8 Correct 116 ms 5256 KB Output is correct
9 Correct 111 ms 5096 KB Output is correct
10 Correct 101 ms 5100 KB Output is correct
11 Correct 85 ms 5096 KB Output is correct
12 Correct 81 ms 5100 KB Output is correct
13 Correct 110 ms 5172 KB Output is correct
14 Correct 1098 ms 33344 KB Output is correct
15 Correct 93 ms 5224 KB Output is correct
16 Correct 776 ms 33344 KB Output is correct
17 Correct 917 ms 33604 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 1 ms 384 KB Output is correct
2 Correct 10 ms 1280 KB Output is correct
3 Correct 9 ms 1280 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 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 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 9 ms 1280 KB Output is correct
17 Correct 95 ms 5744 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 400 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 466 ms 33856 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 715 ms 33344 KB Output is correct
31 Correct 700 ms 33480 KB Output is correct
32 Correct 717 ms 33344 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 753 ms 33344 KB Output is correct
35 Correct 738 ms 33472 KB Output is correct
36 Correct 739 ms 33348 KB Output is correct
37 Incorrect 843 ms 52928 KB Output isn't correct