oj.uz

Submission #992920

# Submission time Handle Problem Language Result Execution time Memory
992920 2024-06-05T08:20:38 Z 79brue Escape Route 2 (JOI24_escape2) C++17
54 / 100
 628 ms 822120 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll INF = 1e18;
const int DEPTH = 17;

struct segTree{
    int minV[400002], minIdx[400002];

    void init(int i, int l, int r, int *A){
        if(l==r){
            minV[i] = A[l], minIdx[i] = l;
            return;
        }
        int m = (l+r)>>1;
        init(i*2, l, m, A);
        init(i*2+1, m+1, r, A);
        if(minV[i*2] <= minV[i*2+1]) minV[i] = minV[i*2], minIdx[i] = minIdx[i*2];
        else minV[i] = minV[i*2+1], minIdx[i] = minIdx[i*2+1];
    }

    pair<int, int> query(int i, int l, int r, int s, int e){
        if(r<s || e<l) return make_pair(INT_MAX, -1);
        if(s<=l && r<=e) return make_pair(minV[i], minIdx[i]);
        int m = (l+r)>>1;
        return min(query(i*2, l, m, s, e), query(i*2+1, m+1, r, s, e));
    }
} tree;

struct dat{
    ll x, y;
    dat(){}
    dat(ll x, ll y): x(x), y(y){}
    bool operator<(const dat &r)const{
        if(x != r.x) return x < r.x;
        return y > r.y;
    }
    bool operator<(const ll &r)const{
        return x < r;
    }
};

struct Query{
    int l, r, idx;
    Query(){}
    Query(int l, int r, int idx): l(l), r(r), idx(idx){}
};

int n, q, K; ll T;
dat arr[100002], arrRev[100002];
int S[100002], E[100002], sz[100002], from[100002];

int nxtR[100002], dayR[100002], nxtL[100002], dayL[100002];
vector<int> childL[100002], childR[100002]; /// 왼쪽이 루트인 트리 / 오른쪽이 루트인 트리

vector<Query> queries[100002];
vector<ll> ql[100002];
ll ans[300002];

int listX[100002], listD[100002];
int pcnt = 0;
void dfsL(int x){
    listX[from[x]] = x;
    ql[x].reserve((int)queries[from[x]].size());
    for(Query &p: queries[from[x]]){
        ql[x].push_back((listD[from[x]] - listD[p.l]) * T + arr[x].x - arr[listX[p.l]].x);
        assert(++pcnt <= 50'000'000);
    }
    listD[from[x]+1] = listD[from[x]];
    for(int y: childL[x]){
        if(arrRev[x].x > arrRev[y].y) listD[from[x]+1]++;
        dfsL(y);
        if(arrRev[x].x > arrRev[y].y) listD[from[x]+1]--;
    }
}
void dfsR(int x){
    listX[from[x]] = x;
    for(int i=0; i<(int)queries[from[x]].size(); i++){
        Query p = queries[from[x]][i];
        ll qlv = ql[x][i], qrv = (listD[from[x]] - listD[p.r-1]) * T + arr[listX[p.r-1]].y - arr[x].y;
        ans[p.idx] = min(ans[p.idx], qlv + qrv + arr[x].y - arr[x].x);
    }
    listD[from[x]-1] = listD[from[x]];
    for(int y: childR[x]){
        if(arr[x].x < arr[y].y) listD[from[x]-1]++;
        dfsR(y);
        if(arr[x].x < arr[y].y) listD[from[x]-1]--;
    }
}

int main(){
    scanf("%d %lld", &n, &T);
    for(int i=1; i<n; i++){
        int s;
        scanf("%d", &s);

        vector<dat> vec;
        vec.resize(s);
        for(int j=0; j<s; j++) scanf("%lld %lld", &vec[j].x, &vec[j].y);

        sort(vec.begin(), vec.end());

        vector<dat> vec2;
        for(int j=0; j<s; j++){
            while(!vec2.empty() && vec2.back().y >= vec[j].y) vec2.pop_back();
            vec2.push_back(vec[j]);
        }
        sz[i] = (int)vec2.size();

        S[i] = E[i-1] + 1, E[i] = S[i] + sz[i] - 1;
        for(int j=0; j<sz[i]; j++) arr[S[i]+j] = vec2[j];
        for(int j=S[i]; j<=E[i]; j++) arrRev[j] = dat(arr[j].y, arr[j].x), from[j] = i;
    }
    tree.init(1, 1, n-1, sz);

    for(int d=1; d<=n-2; d++){
        for(int i=S[d]; i<=E[d]; i++){
            int L = S[d+1], R = E[d+1];
            if(arr[R].x >= arr[i].y) nxtR[i] = lower_bound(arr+L, arr+R+1, dat(arr[i].y, INF)) - arr;
            else nxtR[i] = L, dayR[i] = 1;
            childR[nxtR[i]].push_back(i);
        }
    }
    for(int d=3; d<=n; d++){
        for(int i=S[d-1]; i<=E[d-1]; i++){
            int L = S[d-2], R = E[d-2];
            if(arrRev[L].x <= arrRev[i].y) nxtL[i] = upper_bound(arrRev+L, arrRev+R+1, dat(arrRev[i].y, -INF)) - arrRev - 1;
            else nxtL[i] = R, dayL[i] = 1;
            childL[nxtL[i]].push_back(i);
        }
    }

    scanf("%d", &q);
    for(int i=1; i<=q; i++){
        int l, r;
        scanf("%d %d", &l, &r);
        int minIdx = tree.query(1, 1, n-1, l, r-1).second;
        queries[minIdx].push_back(Query(l, r, i));
        ans[i] = LLONG_MAX;
    }

    listD[1] = 0;
    for(int i=S[1]; i<=E[1]; i++) dfsL(i);
    listD[n-1] = 0;
    for(int i=S[n-1]; i<=E[n-1]; i++) dfsR(i);

    for(int i=1; i<=q; i++) printf("%lld\n", ans[i]);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |     scanf("%d %lld", &n, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         scanf("%d", &s);
      |         ~~~~~^~~~~~~~~~
Main.cpp:101:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |         for(int j=0; j<s; j++) scanf("%lld %lld", &vec[j].x, &vec[j].y);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:135:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
Main.cpp:138:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |         scanf("%d %d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 56 ms 27816 KB Output is correct
3 Correct 82 ms 28048 KB Output is correct
4 Correct 113 ms 30644 KB Output is correct
5 Correct 90 ms 27984 KB Output is correct
6 Correct 138 ms 30548 KB Output is correct
7 Correct 125 ms 30752 KB Output is correct
8 Correct 89 ms 28152 KB Output is correct
9 Correct 123 ms 30544 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 56 ms 27816 KB Output is correct
3 Correct 82 ms 28048 KB Output is correct
4 Correct 113 ms 30644 KB Output is correct
5 Correct 90 ms 27984 KB Output is correct
6 Correct 138 ms 30548 KB Output is correct
7 Correct 125 ms 30752 KB Output is correct
8 Correct 89 ms 28152 KB Output is correct
9 Correct 123 ms 30544 KB Output is correct
10 Correct 3 ms 18776 KB Output is correct
11 Correct 106 ms 39252 KB Output is correct
12 Correct 112 ms 38996 KB Output is correct
13 Correct 102 ms 36432 KB Output is correct
14 Correct 104 ms 36436 KB Output is correct
15 Correct 100 ms 29524 KB Output is correct
16 Correct 52 ms 31156 KB Output is correct
17 Correct 121 ms 30292 KB Output is correct
18 Correct 103 ms 29580 KB Output is correct
19 Correct 108 ms 30032 KB Output is correct
20 Correct 112 ms 29464 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 56 ms 27816 KB Output is correct
3 Correct 82 ms 28048 KB Output is correct
4 Correct 113 ms 30644 KB Output is correct
5 Correct 90 ms 27984 KB Output is correct
6 Correct 138 ms 30548 KB Output is correct
7 Correct 125 ms 30752 KB Output is correct
8 Correct 89 ms 28152 KB Output is correct
9 Correct 123 ms 30544 KB Output is correct
10 Correct 160 ms 44368 KB Output is correct
11 Correct 220 ms 52304 KB Output is correct
12 Correct 238 ms 52460 KB Output is correct
13 Correct 171 ms 49488 KB Output is correct
14 Correct 224 ms 52564 KB Output is correct
15 Correct 219 ms 52540 KB Output is correct
16 Correct 159 ms 44628 KB Output is correct
17 Correct 217 ms 52460 KB Output is correct
18 Correct 92 ms 41808 KB Output is correct
19 Correct 86 ms 41296 KB Output is correct
20 Correct 101 ms 42064 KB Output is correct
21 Correct 96 ms 42064 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 56 ms 27816 KB Output is correct
3 Correct 82 ms 28048 KB Output is correct
4 Correct 113 ms 30644 KB Output is correct
5 Correct 90 ms 27984 KB Output is correct
6 Correct 138 ms 30548 KB Output is correct
7 Correct 125 ms 30752 KB Output is correct
8 Correct 89 ms 28152 KB Output is correct
9 Correct 123 ms 30544 KB Output is correct
10 Correct 3 ms 18776 KB Output is correct
11 Correct 106 ms 39252 KB Output is correct
12 Correct 112 ms 38996 KB Output is correct
13 Correct 102 ms 36432 KB Output is correct
14 Correct 104 ms 36436 KB Output is correct
15 Correct 100 ms 29524 KB Output is correct
16 Correct 52 ms 31156 KB Output is correct
17 Correct 121 ms 30292 KB Output is correct
18 Correct 103 ms 29580 KB Output is correct
19 Correct 108 ms 30032 KB Output is correct
20 Correct 112 ms 29464 KB Output is correct
21 Correct 160 ms 44368 KB Output is correct
22 Correct 220 ms 52304 KB Output is correct
23 Correct 238 ms 52460 KB Output is correct
24 Correct 171 ms 49488 KB Output is correct
25 Correct 224 ms 52564 KB Output is correct
26 Correct 219 ms 52540 KB Output is correct
27 Correct 159 ms 44628 KB Output is correct
28 Correct 217 ms 52460 KB Output is correct
29 Correct 92 ms 41808 KB Output is correct
30 Correct 86 ms 41296 KB Output is correct
31 Correct 101 ms 42064 KB Output is correct
32 Correct 96 ms 42064 KB Output is correct
33 Correct 241 ms 50456 KB Output is correct
34 Correct 211 ms 50512 KB Output is correct
35 Correct 193 ms 46204 KB Output is correct
36 Correct 196 ms 46164 KB Output is correct
37 Correct 200 ms 37932 KB Output is correct
38 Correct 170 ms 39512 KB Output is correct
39 Correct 208 ms 45524 KB Output is correct
40 Correct 164 ms 36180 KB Output is correct
41 Correct 171 ms 39760 KB Output is correct
42 Correct 210 ms 45652 KB Output is correct
43 Correct 175 ms 36180 KB Output is correct
44 Correct 212 ms 38556 KB Output is correct
45 Correct 102 ms 35412 KB Output is correct
46 Correct 90 ms 29988 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9816 KB Output is correct
2 Correct 5 ms 9820 KB Output is correct
3 Correct 343 ms 235380 KB Output is correct
4 Correct 296 ms 240156 KB Output is correct
5 Correct 301 ms 238676 KB Output is correct
6 Correct 302 ms 234792 KB Output is correct
7 Correct 332 ms 238164 KB Output is correct
8 Correct 186 ms 129816 KB Output is correct
9 Correct 77 ms 22456 KB Output is correct
10 Runtime error 628 ms 822120 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 56 ms 27816 KB Output is correct
3 Correct 82 ms 28048 KB Output is correct
4 Correct 113 ms 30644 KB Output is correct
5 Correct 90 ms 27984 KB Output is correct
6 Correct 138 ms 30548 KB Output is correct
7 Correct 125 ms 30752 KB Output is correct
8 Correct 89 ms 28152 KB Output is correct
9 Correct 123 ms 30544 KB Output is correct
10 Correct 3 ms 18776 KB Output is correct
11 Correct 106 ms 39252 KB Output is correct
12 Correct 112 ms 38996 KB Output is correct
13 Correct 102 ms 36432 KB Output is correct
14 Correct 104 ms 36436 KB Output is correct
15 Correct 100 ms 29524 KB Output is correct
16 Correct 52 ms 31156 KB Output is correct
17 Correct 121 ms 30292 KB Output is correct
18 Correct 103 ms 29580 KB Output is correct
19 Correct 108 ms 30032 KB Output is correct
20 Correct 112 ms 29464 KB Output is correct
21 Correct 160 ms 44368 KB Output is correct
22 Correct 220 ms 52304 KB Output is correct
23 Correct 238 ms 52460 KB Output is correct
24 Correct 171 ms 49488 KB Output is correct
25 Correct 224 ms 52564 KB Output is correct
26 Correct 219 ms 52540 KB Output is correct
27 Correct 159 ms 44628 KB Output is correct
28 Correct 217 ms 52460 KB Output is correct
29 Correct 92 ms 41808 KB Output is correct
30 Correct 86 ms 41296 KB Output is correct
31 Correct 101 ms 42064 KB Output is correct
32 Correct 96 ms 42064 KB Output is correct
33 Correct 241 ms 50456 KB Output is correct
34 Correct 211 ms 50512 KB Output is correct
35 Correct 193 ms 46204 KB Output is correct
36 Correct 196 ms 46164 KB Output is correct
37 Correct 200 ms 37932 KB Output is correct
38 Correct 170 ms 39512 KB Output is correct
39 Correct 208 ms 45524 KB Output is correct
40 Correct 164 ms 36180 KB Output is correct
41 Correct 171 ms 39760 KB Output is correct
42 Correct 210 ms 45652 KB Output is correct
43 Correct 175 ms 36180 KB Output is correct
44 Correct 212 ms 38556 KB Output is correct
45 Correct 102 ms 35412 KB Output is correct
46 Correct 90 ms 29988 KB Output is correct
47 Correct 6 ms 9816 KB Output is correct
48 Correct 5 ms 9820 KB Output is correct
49 Correct 343 ms 235380 KB Output is correct
50 Correct 296 ms 240156 KB Output is correct
51 Correct 301 ms 238676 KB Output is correct
52 Correct 302 ms 234792 KB Output is correct
53 Correct 332 ms 238164 KB Output is correct
54 Correct 186 ms 129816 KB Output is correct
55 Correct 77 ms 22456 KB Output is correct
56 Runtime error 628 ms 822120 KB Execution killed with signal 6
57 Halted 0 ms 0 KB -