oj.uz

Submission #531646

# Submission time Handle Problem Language Result Execution time Memory
531646 2022-03-01T07:46:16 Z wiwiho Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 539 ms 96376 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

#define lc (2 * id + 1)
#define rc (2 * id + 2)

int n;

pii onion(pii a, pii b){
    return mp(min(a.F, b.F), max(a.S, b.S));
}

bool inside(pii r, int p){
    return r.F <= p && p <= r.S;
}

struct SegmentTree{
    
    vector<pii> st;

    void build(vector<pii>& v, int L = 1, int R = n, int id = 0){
        if(L == R){
            st[id] = v[L];
            return;
        }
        int M = (L + R) / 2;
        build(v, L, M, lc);
        build(v, M + 1, R, rc);
        st[id] = onion(st[lc], st[rc]);
    }

    pii query(int l, int r, int L = 1, int R = n, int id = 0){
        //assert(max(l, L) <= min(r, R));
        if(l <= L && R <= r) return st[id];
        int M = (L + R) / 2;
        if(r <= M) return query(l, r, L, M, lc);
        else if(l > M) return query(l, r, M + 1, R, rc);
        else return onion(query(l, r, L, M, lc), query(l, r, M + 1, R, rc));
    }

    void init(vector<pii>& v){
        st.resize(4 * n);
        build(v);
    }

};

int main(){
    StarBurstStream

    int K;
    cin >> n >> K;

    vector<vector<int>> el(n + 2), er(n + 2);
    int m;
    cin >> m;
    for(int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        if(a < b){
            er[a].eb(b);
            er[min(b + 1, a + K)].eb(-b);
        }
        else{
            el[max(b, a - K + 1)].eb(b);
            el[a + 1].eb(-b);
        }
    }

    const int SZ = 20;
    vector<vector<pii>> go(SZ, vector<pii>(n + 1));
    multiset<int> sl, sr;
    for(int i = 1; i <= n; i++){
        for(int j : el[i]){
            if(j > 0) sl.insert(j);
            else sl.erase(sl.find(-j));
        }
        for(int j : er[i]){
            if(j > 0) sr.insert(j);
            else sr.erase(sr.find(-j));
        }
        int l = sl.empty() ? i : *sl.begin();
        int r = sr.empty() ? i : *sr.rbegin();
        assert(l <= r);
        go[0][i] = mp(l, r);
    }

    vector<SegmentTree> st(SZ);
    st[0].init(go[0]);
    //cerr << "test " << 0 << " ";
    //printv(go[0], cerr);
    for(int i = 1; i < SZ; i++){
        for(int j = 1; j <= n; j++){
            go[i][j] = st[i - 1].query(go[i - 1][j].F, go[i - 1][j].S);
        }
        st[i].init(go[i]);
        //cerr << "test " << i << " ";
        //printv(go[i], cerr);
    }

    int q;
    cin >> q;
    while(q--){

        int s, t;
        cin >> s >> t;

        if(!inside(go[SZ - 1][s], t)){
            cout << "-1\n";
            continue;
        }
        
        int ans = 0;
        pii now = mp(s, s);
        for(int i = SZ - 1; i >= 0; i--){
            pii nxt = st[i].query(now.F, now.S);
            if(!inside(nxt, t)){
                ans += 1 << i;
                now = nxt;
            }
        }
        
        cout << ans + 1 << "\n";
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 572 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 572 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 10 ms 1988 KB Output is correct
14 Correct 7 ms 1996 KB Output is correct
15 Correct 4 ms 1988 KB Output is correct
16 Correct 4 ms 2064 KB Output is correct
17 Correct 6 ms 2112 KB Output is correct
18 Correct 4 ms 2124 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 4 ms 2116 KB Output is correct
21 Correct 3 ms 1996 KB Output is correct
22 Correct 7 ms 2112 KB Output is correct
23 Correct 6 ms 1996 KB Output is correct
24 Correct 6 ms 1976 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 86244 KB Output is correct
2 Correct 267 ms 86256 KB Output is correct
3 Correct 295 ms 86576 KB Output is correct
4 Correct 251 ms 86176 KB Output is correct
5 Correct 211 ms 91252 KB Output is correct
6 Correct 307 ms 89620 KB Output is correct
7 Correct 162 ms 95112 KB Output is correct
8 Correct 140 ms 88468 KB Output is correct
9 Correct 138 ms 89688 KB Output is correct
10 Correct 297 ms 88908 KB Output is correct
11 Correct 255 ms 88928 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 91496 KB Output is correct
2 Correct 403 ms 94156 KB Output is correct
3 Correct 506 ms 91500 KB Output is correct
4 Correct 230 ms 96376 KB Output is correct
5 Correct 291 ms 93208 KB Output is correct
6 Correct 287 ms 93980 KB Output is correct
7 Correct 403 ms 89268 KB Output is correct
8 Correct 391 ms 89352 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 90016 KB Output is correct
2 Correct 539 ms 86764 KB Output is correct
3 Correct 505 ms 85176 KB Output is correct
4 Correct 470 ms 84276 KB Output is correct
5 Correct 351 ms 83892 KB Output is correct
6 Correct 375 ms 83572 KB Output is correct
7 Correct 302 ms 91640 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 6 ms 1996 KB Output is correct
10 Correct 333 ms 90724 KB Output is correct
11 Correct 349 ms 92356 KB Output is correct
12 Correct 379 ms 89532 KB Output is correct
13 Correct 362 ms 92296 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 7 ms 1996 KB Output is correct
16 Correct 310 ms 87556 KB Output is correct
17 Correct 531 ms 87992 KB Output is correct
18 Correct 469 ms 87768 KB Output is correct
19 Correct 445 ms 87996 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 572 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 10 ms 1988 KB Output is correct
14 Correct 7 ms 1996 KB Output is correct
15 Correct 4 ms 1988 KB Output is correct
16 Correct 4 ms 2064 KB Output is correct
17 Correct 6 ms 2112 KB Output is correct
18 Correct 4 ms 2124 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 4 ms 2116 KB Output is correct
21 Correct 3 ms 1996 KB Output is correct
22 Correct 7 ms 2112 KB Output is correct
23 Correct 6 ms 1996 KB Output is correct
24 Correct 6 ms 1976 KB Output is correct
25 Correct 333 ms 86244 KB Output is correct
26 Correct 267 ms 86256 KB Output is correct
27 Correct 295 ms 86576 KB Output is correct
28 Correct 251 ms 86176 KB Output is correct
29 Correct 211 ms 91252 KB Output is correct
30 Correct 307 ms 89620 KB Output is correct
31 Correct 162 ms 95112 KB Output is correct
32 Correct 140 ms 88468 KB Output is correct
33 Correct 138 ms 89688 KB Output is correct
34 Correct 297 ms 88908 KB Output is correct
35 Correct 255 ms 88928 KB Output is correct
36 Correct 359 ms 91496 KB Output is correct
37 Correct 403 ms 94156 KB Output is correct
38 Correct 506 ms 91500 KB Output is correct
39 Correct 230 ms 96376 KB Output is correct
40 Correct 291 ms 93208 KB Output is correct
41 Correct 287 ms 93980 KB Output is correct
42 Correct 403 ms 89268 KB Output is correct
43 Correct 391 ms 89352 KB Output is correct
44 Correct 318 ms 90016 KB Output is correct
45 Correct 539 ms 86764 KB Output is correct
46 Correct 505 ms 85176 KB Output is correct
47 Correct 470 ms 84276 KB Output is correct
48 Correct 351 ms 83892 KB Output is correct
49 Correct 375 ms 83572 KB Output is correct
50 Correct 302 ms 91640 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 6 ms 1996 KB Output is correct
53 Correct 333 ms 90724 KB Output is correct
54 Correct 349 ms 92356 KB Output is correct
55 Correct 379 ms 89532 KB Output is correct
56 Correct 362 ms 92296 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 7 ms 1996 KB Output is correct
59 Correct 310 ms 87556 KB Output is correct
60 Correct 531 ms 87992 KB Output is correct
61 Correct 469 ms 87768 KB Output is correct
62 Correct 445 ms 87996 KB Output is correct
63 Correct 442 ms 86560 KB Output is correct
64 Correct 539 ms 86632 KB Output is correct
65 Correct 468 ms 86492 KB Output is correct
66 Correct 233 ms 91984 KB Output is correct
67 Correct 462 ms 89932 KB Output is correct
68 Correct 418 ms 88508 KB Output is correct
69 Correct 306 ms 93704 KB Output is correct
70 Correct 359 ms 89136 KB Output is correct
71 Correct 531 ms 89164 KB Output is correct