oj.uz

Submission #172198

# Submission time Handle Problem Language Result Execution time Memory
172198 2019-12-31T14:51:04 Z ToMmyDong Worst Reporter 3 (JOI18_worst_reporter3) C++11
100 / 100
 527 ms 25476 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define SZ(i) int(i.size())
#ifdef tmd
#define IOS()
#define debug(...) fprintf(stderr,"#%d: %s = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
template<typename It> ostream& _printRng(ostream &os,It bg,It ed)
{
    os<<"{";
    for(It it=bg;it!=ed;it++) {
        os<<(it==bg?"":",")<<*it;
    }
    os<<"}";
    return os;
}
template<typename T> ostream &operator << (ostream &os,vector<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> ostream &operator << (ostream &os,deque<T> &v){return _printRng(os,v.begin(), v.end());}
template<typename T> void pary(T bg, T ed){_printRng(cerr,bg,ed);cerr<<endl;}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#define pary(...)
#endif

const int MAXN = 500005;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, q;
ll d[MAXN];

struct Data {
    ll l, r, d;
};

ostream& operator << (ostream &os, const Data &dt) {
    return os << "{" << dt.l << "," << dt.r << "," << dt.d << "}";
}

deque<Data> deq;
void build () {
    deq.push_back({0LL,0LL, 1});
    for (int i=1;i<=n;i++) {
        if (d[i] <= deq.back().d) {
            deq.back().r = i;
        } else {
            ll mul = (d[i] + deq.back().d - 1) / deq.back().d;
            deq.push_back({i,i, mul*deq.back().d});
        }
    }
}

ll qry (ll t, ll l, ll r) {
    ll sum = 0;
    for (const auto &D : deq) {
        ll mul = t / D.d;
        ll nL = -D.r + D.d * mul;
        ll nR = -D.l + D.d * mul;
        debug(D);
        debug(nL, nR, l, r);
        nL = max(nL, l);
        nR = min(nR, r);
        sum += max(0LL, (nR - nL) + 1);
    }
    return sum;
}
/*********************GoodLuck***********************/
int main () {
    IOS();

    cin >> n >> q;
    REP1 (i, n) {
        cin >> d[i];
    }
    build();
    debug(deq);

    while (q--) {
        ll t, l, r;
        cin >> t >> l >> r;
        cout << qry(t, l, r) << endl;
    }
}
/*
6 6
11
36
28
80
98
66
36 29 33
190 171 210
18 20 100
1000 900 1100
92 87 99
200 100 300
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 299 ms 22776 KB Output is correct
2 Correct 301 ms 21368 KB Output is correct
3 Correct 299 ms 22736 KB Output is correct
4 Correct 301 ms 22768 KB Output is correct
5 Correct 306 ms 22852 KB Output is correct
6 Correct 298 ms 22364 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 299 ms 22776 KB Output is correct
2 Correct 301 ms 21368 KB Output is correct
3 Correct 299 ms 22736 KB Output is correct
4 Correct 301 ms 22768 KB Output is correct
5 Correct 306 ms 22852 KB Output is correct
6 Correct 298 ms 22364 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 320 ms 20648 KB Output is correct
14 Correct 326 ms 22008 KB Output is correct
15 Correct 306 ms 20472 KB Output is correct
16 Correct 317 ms 21076 KB Output is correct
17 Correct 481 ms 25336 KB Output is correct
18 Correct 527 ms 25476 KB Output is correct
19 Correct 485 ms 25460 KB Output is correct
20 Correct 480 ms 25336 KB Output is correct
21 Correct 471 ms 25348 KB Output is correct
22 Correct 471 ms 25336 KB Output is correct
23 Correct 468 ms 25336 KB Output is correct
24 Correct 473 ms 25412 KB Output is correct
25 Correct 306 ms 22776 KB Output is correct
26 Correct 306 ms 22796 KB Output is correct
27 Correct 466 ms 24900 KB Output is correct
28 Correct 493 ms 25128 KB Output is correct
29 Correct 495 ms 24688 KB Output is correct
30 Correct 499 ms 24844 KB Output is correct
31 Correct 493 ms 25148 KB Output is correct
32 Correct 302 ms 21360 KB Output is correct
33 Correct 2 ms 376 KB Output is correct