oj.uz

Submission #1030902

# Submission time Handle Problem Language Result Execution time Memory
1030902 2024-07-22T11:44:04 Z Antekb Tower (JOI24_tower) C++17
100 / 100
 193 ms 21444 KB 
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

using se=pair<pair<ll, ll>, ll>;
bool from_both_sides;

void insert(set<se> &S, ll l, ll r, ll c){
    vector<se> todo;
    auto it=S.lower_bound(se(mp(mp(l, 0), 0)));
    if(it!=S.begin())it--;
    while(it!=S.end() && it->st.st<=r){
        todo.pb(*it);
        it++;
    }
    for(auto i : todo){
        ll L=i.st.st, R=i.st.nd, C=i.nd;
        if(L>r || R<l)continue;
        S.erase(i);
        if(L<l){
            S.insert(mp(mp(L, l-1), C));
        }
        if(R>r){
            S.insert(mp(mp(r+1, R), C+max(0ll, r+1-L)));
        }
    }
    S.insert(se(mp(l, r),  c));
}
ll pytaj(set<se> &S, ll x, ll D){
    auto it=S.lower_bound(mp(mp(x%D+1,0), 0));
    deb(x, D);
    if(it==S.begin())return x%D;
    it--;
    deb(x, D, *it);
    if(x%D<=it->st.nd){
        deb("a");
        if(it->st.st==0 && from_both_sides){
            it=S.end();
            it--;
            return x%D+D-it->st.st+1+it->nd;
        }
        return x%D-it->st.st+1+it->nd;
    }
    else return x%D;
}
void solve() {
	int n, q;
    cin>>n>>q;
    ll A, B, D;
    cin>>D>>A>>B;
    vector<pair<ll ,ll>> seg;
    for(int i=0; i<n; i++){
        ll l, r;
        cin>>l>>r;
        r=max(r, D-1);
        if(i==0){
            seg.pb(mp(l, r));
        }
        else {
            if(l<=seg.back().nd+1){
                seg.back().nd=max(seg.back().nd, r);
            }
            else seg.pb(mp(l, r));
            int t=lower_bound(all(seg), mp(r+2-D,0ll))-seg.begin();
            t--;
            if(t>=0){
                seg.back().nd=max(seg.back().nd, seg[t].nd+D);
            }
        }
        if(seg.back().nd-seg.back().st>=D-1)seg.back().nd=1e12;
        deb(seg);
    }
    B-=A*D;
    n=seg.size();
    vector<pair<ll, int> > Q;
    vector<ll> res(q);
    for(int i=0; i<q; i++){
        ll x;
        cin>>x;
        int t=lower_bound(all(seg), mp(x+1, 0ll))-seg.begin();
        t--;
        if(t>=0 && seg[t].nd>=x){
            res[i]=-1;
            continue;
        }
        Q.pb(mp(x, i));
        res[i]=x*A;
    }
    if(B>0){
        vector<ll> odp(n);
        for(int i=0; i<n; i++){
            int t=lower_bound(all(seg), mp(seg[i].nd+2-D,0ll))-seg.begin();
            if(t==0)odp[i]=1;
            else{
                odp[i]=odp[t-1]+1;
            }
        }
        for(auto &[x, id] : Q){
            int t=lower_bound(all(seg), mp(x+1, 0ll))-seg.begin();
            t--;
            if(t>=0)res[id]+=B*odp[t];
        }
    }
    else{
        deb(A, B, D, Q);
        set<se> S;
        sort(all(Q));
        reverse(all(Q));
        seg.pb(mp(2e12, 2e12));
        for(auto &[l, r] : seg){
            while(Q.size() && Q.back().st<l){
                ll x=Q.back().st;
                int id=Q.back().nd;
                Q.pop_back();
                res[id]+=B*((x-pytaj(S, x, D))/D);
            }
            if(l>1e12){
                break;
            }
            ll val=pytaj(S, l-1, D);
            deb(l, r, val);
            if(l/D==r/D){
                insert(S, l%D, r%D, val);
                if(l%D==0 || r%D==D-1)from_both_sides=0;
            }
            else{
                insert(S, l%D, D-1, val);
                insert(S, 0, r%D, val+D-(l%D));
                from_both_sides=1;
            }
            deb("S");
            for(auto &i:S){
                deb(i);
            }
        }
    }
    for(int i=0; i<q; i++){
        cout<<res[i]<<"\n";
    }
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int tt = 1;
	// cin >> tt;
	FOR(te, 0, tt) solve();
	return 0;
}

Compilation message

Main.cpp:17:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
Main.cpp:17:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
Main.cpp:17:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
Main.cpp:19:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
Main.cpp:19:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~
Main.cpp: In function 'void solve()':
Main.cpp:156:23: warning: unused variable 'i' [-Wunused-variable]
  156 |             for(auto &i:S){
      |                       ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 47 ms 5784 KB Output is correct
4 Correct 46 ms 5448 KB Output is correct
5 Correct 43 ms 6888 KB Output is correct
6 Correct 45 ms 6784 KB Output is correct
7 Correct 47 ms 6896 KB Output is correct
8 Correct 130 ms 15292 KB Output is correct
9 Correct 129 ms 16824 KB Output is correct
10 Correct 109 ms 15724 KB Output is correct
11 Correct 116 ms 15296 KB Output is correct
12 Correct 129 ms 17340 KB Output is correct
13 Correct 53 ms 8648 KB Output is correct
14 Correct 63 ms 8784 KB Output is correct
15 Correct 42 ms 6480 KB Output is correct
16 Correct 80 ms 15812 KB Output is correct
17 Correct 55 ms 8592 KB Output is correct
18 Correct 54 ms 8904 KB Output is correct
19 Correct 39 ms 9172 KB Output is correct
20 Correct 38 ms 7380 KB Output is correct
21 Correct 24 ms 8660 KB Output is correct
22 Correct 40 ms 8896 KB Output is correct
23 Correct 38 ms 7636 KB Output is correct
24 Correct 42 ms 8384 KB Output is correct
25 Correct 60 ms 8124 KB Output is correct
26 Correct 40 ms 8384 KB Output is correct
27 Correct 39 ms 7360 KB Output is correct
28 Correct 41 ms 8336 KB Output is correct
29 Correct 42 ms 7892 KB Output is correct
30 Correct 42 ms 9052 KB Output is correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 7524 KB Output is correct
2 Correct 38 ms 6880 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 164 ms 13196 KB Output is correct
5 Correct 161 ms 11200 KB Output is correct
6 Correct 162 ms 11200 KB Output is correct
7 Correct 162 ms 11016 KB Output is correct
8 Correct 169 ms 12104 KB Output is correct
9 Correct 174 ms 11708 KB Output is correct
10 Correct 171 ms 11968 KB Output is correct
11 Correct 164 ms 11712 KB Output is correct
12 Correct 193 ms 11708 KB Output is correct
13 Correct 184 ms 13140 KB Output is correct
14 Correct 75 ms 3744 KB Output is correct
15 Correct 62 ms 2896 KB Output is correct
16 Correct 63 ms 2732 KB Output is correct
17 Correct 171 ms 10684 KB Output is correct
18 Correct 158 ms 11580 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 47 ms 5784 KB Output is correct
4 Correct 46 ms 5448 KB Output is correct
5 Correct 43 ms 6888 KB Output is correct
6 Correct 45 ms 6784 KB Output is correct
7 Correct 47 ms 6896 KB Output is correct
8 Correct 130 ms 15292 KB Output is correct
9 Correct 129 ms 16824 KB Output is correct
10 Correct 109 ms 15724 KB Output is correct
11 Correct 116 ms 15296 KB Output is correct
12 Correct 129 ms 17340 KB Output is correct
13 Correct 53 ms 8648 KB Output is correct
14 Correct 63 ms 8784 KB Output is correct
15 Correct 42 ms 6480 KB Output is correct
16 Correct 80 ms 15812 KB Output is correct
17 Correct 55 ms 8592 KB Output is correct
18 Correct 54 ms 8904 KB Output is correct
19 Correct 39 ms 9172 KB Output is correct
20 Correct 38 ms 7380 KB Output is correct
21 Correct 24 ms 8660 KB Output is correct
22 Correct 40 ms 8896 KB Output is correct
23 Correct 38 ms 7636 KB Output is correct
24 Correct 42 ms 8384 KB Output is correct
25 Correct 60 ms 8124 KB Output is correct
26 Correct 40 ms 8384 KB Output is correct
27 Correct 39 ms 7360 KB Output is correct
28 Correct 41 ms 8336 KB Output is correct
29 Correct 42 ms 7892 KB Output is correct
30 Correct 42 ms 9052 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 38 ms 7524 KB Output is correct
49 Correct 38 ms 6880 KB Output is correct
50 Correct 2 ms 360 KB Output is correct
51 Correct 164 ms 13196 KB Output is correct
52 Correct 161 ms 11200 KB Output is correct
53 Correct 162 ms 11200 KB Output is correct
54 Correct 162 ms 11016 KB Output is correct
55 Correct 169 ms 12104 KB Output is correct
56 Correct 174 ms 11708 KB Output is correct
57 Correct 171 ms 11968 KB Output is correct
58 Correct 164 ms 11712 KB Output is correct
59 Correct 193 ms 11708 KB Output is correct
60 Correct 184 ms 13140 KB Output is correct
61 Correct 75 ms 3744 KB Output is correct
62 Correct 62 ms 2896 KB Output is correct
63 Correct 63 ms 2732 KB Output is correct
64 Correct 171 ms 10684 KB Output is correct
65 Correct 158 ms 11580 KB Output is correct
66 Correct 170 ms 18400 KB Output is correct
67 Correct 176 ms 18880 KB Output is correct
68 Correct 162 ms 20484 KB Output is correct
69 Correct 177 ms 18116 KB Output is correct
70 Correct 116 ms 19132 KB Output is correct
71 Correct 117 ms 18880 KB Output is correct
72 Correct 131 ms 17980 KB Output is correct
73 Correct 112 ms 18384 KB Output is correct
74 Correct 193 ms 20160 KB Output is correct
75 Correct 176 ms 21184 KB Output is correct
76 Correct 106 ms 15432 KB Output is correct
77 Correct 125 ms 19768 KB Output is correct
78 Correct 90 ms 11808 KB Output is correct
79 Correct 177 ms 20976 KB Output is correct
80 Correct 176 ms 18112 KB Output is correct
81 Correct 182 ms 18600 KB Output is correct
82 Correct 179 ms 21444 KB Output is correct
83 Correct 64 ms 10324 KB Output is correct
84 Correct 82 ms 10324 KB Output is correct
85 Correct 60 ms 10280 KB Output is correct
86 Correct 68 ms 11096 KB Output is correct
87 Correct 65 ms 10292 KB Output is correct