oj.uz

Submission #992906

# Submission time Handle Problem Language Result Execution time Memory
992906 2024-06-05T08:15:41 Z 79brue Escape Route 2 (JOI24_escape2) C++17
54 / 100
 987 ms 1048576 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[300002], listD[300002];
void dfsL(int x){
    listX[from[x]] = x;
    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);
    }
    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:91:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     scanf("%d %lld", &n, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d", &s);
      |         ~~~~~^~~~~~~~~~
Main.cpp:98:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         for(int j=0; j<s; j++) scanf("%lld %lld", &vec[j].x, &vec[j].y);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:132:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
Main.cpp:135:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |         scanf("%d %d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22872 KB Output is correct
2 Correct 55 ms 37820 KB Output is correct
3 Correct 93 ms 35028 KB Output is correct
4 Correct 135 ms 38676 KB Output is correct
5 Correct 104 ms 34808 KB Output is correct
6 Correct 116 ms 38480 KB Output is correct
7 Correct 119 ms 38588 KB Output is correct
8 Correct 115 ms 35140 KB Output is correct
9 Correct 117 ms 38468 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22872 KB Output is correct
2 Correct 55 ms 37820 KB Output is correct
3 Correct 93 ms 35028 KB Output is correct
4 Correct 135 ms 38676 KB Output is correct
5 Correct 104 ms 34808 KB Output is correct
6 Correct 116 ms 38480 KB Output is correct
7 Correct 119 ms 38588 KB Output is correct
8 Correct 115 ms 35140 KB Output is correct
9 Correct 117 ms 38468 KB Output is correct
10 Correct 3 ms 22876 KB Output is correct
11 Correct 106 ms 49484 KB Output is correct
12 Correct 110 ms 49564 KB Output is correct
13 Correct 116 ms 45008 KB Output is correct
14 Correct 105 ms 44772 KB Output is correct
15 Correct 116 ms 36688 KB Output is correct
16 Correct 61 ms 41416 KB Output is correct
17 Correct 108 ms 37712 KB Output is correct
18 Correct 101 ms 36320 KB Output is correct
19 Correct 113 ms 37732 KB Output is correct
20 Correct 112 ms 36400 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22872 KB Output is correct
2 Correct 55 ms 37820 KB Output is correct
3 Correct 93 ms 35028 KB Output is correct
4 Correct 135 ms 38676 KB Output is correct
5 Correct 104 ms 34808 KB Output is correct
6 Correct 116 ms 38480 KB Output is correct
7 Correct 119 ms 38588 KB Output is correct
8 Correct 115 ms 35140 KB Output is correct
9 Correct 117 ms 38468 KB Output is correct
10 Correct 170 ms 49620 KB Output is correct
11 Correct 218 ms 58848 KB Output is correct
12 Correct 244 ms 58964 KB Output is correct
13 Correct 190 ms 54832 KB Output is correct
14 Correct 284 ms 58960 KB Output is correct
15 Correct 223 ms 58888 KB Output is correct
16 Correct 151 ms 49748 KB Output is correct
17 Correct 224 ms 58964 KB Output is correct
18 Correct 106 ms 45100 KB Output is correct
19 Correct 102 ms 44356 KB Output is correct
20 Correct 98 ms 45400 KB Output is correct
21 Correct 108 ms 45376 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22872 KB Output is correct
2 Correct 55 ms 37820 KB Output is correct
3 Correct 93 ms 35028 KB Output is correct
4 Correct 135 ms 38676 KB Output is correct
5 Correct 104 ms 34808 KB Output is correct
6 Correct 116 ms 38480 KB Output is correct
7 Correct 119 ms 38588 KB Output is correct
8 Correct 115 ms 35140 KB Output is correct
9 Correct 117 ms 38468 KB Output is correct
10 Correct 3 ms 22876 KB Output is correct
11 Correct 106 ms 49484 KB Output is correct
12 Correct 110 ms 49564 KB Output is correct
13 Correct 116 ms 45008 KB Output is correct
14 Correct 105 ms 44772 KB Output is correct
15 Correct 116 ms 36688 KB Output is correct
16 Correct 61 ms 41416 KB Output is correct
17 Correct 108 ms 37712 KB Output is correct
18 Correct 101 ms 36320 KB Output is correct
19 Correct 113 ms 37732 KB Output is correct
20 Correct 112 ms 36400 KB Output is correct
21 Correct 170 ms 49620 KB Output is correct
22 Correct 218 ms 58848 KB Output is correct
23 Correct 244 ms 58964 KB Output is correct
24 Correct 190 ms 54832 KB Output is correct
25 Correct 284 ms 58960 KB Output is correct
26 Correct 223 ms 58888 KB Output is correct
27 Correct 151 ms 49748 KB Output is correct
28 Correct 224 ms 58964 KB Output is correct
29 Correct 106 ms 45100 KB Output is correct
30 Correct 102 ms 44356 KB Output is correct
31 Correct 98 ms 45400 KB Output is correct
32 Correct 108 ms 45376 KB Output is correct
33 Correct 221 ms 63136 KB Output is correct
34 Correct 231 ms 63060 KB Output is correct
35 Correct 207 ms 57600 KB Output is correct
36 Correct 241 ms 57428 KB Output is correct
37 Correct 184 ms 46672 KB Output is correct
38 Correct 185 ms 45740 KB Output is correct
39 Correct 228 ms 52560 KB Output is correct
40 Correct 167 ms 44196 KB Output is correct
41 Correct 168 ms 46672 KB Output is correct
42 Correct 214 ms 53056 KB Output is correct
43 Correct 187 ms 44224 KB Output is correct
44 Correct 195 ms 47156 KB Output is correct
45 Correct 90 ms 39748 KB Output is correct
46 Correct 81 ms 35408 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 331 ms 343888 KB Output is correct
4 Correct 337 ms 343220 KB Output is correct
5 Correct 338 ms 340560 KB Output is correct
6 Correct 332 ms 325452 KB Output is correct
7 Correct 329 ms 326988 KB Output is correct
8 Correct 195 ms 187472 KB Output is correct
9 Correct 57 ms 33364 KB Output is correct
10 Runtime error 987 ms 1048576 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22872 KB Output is correct
2 Correct 55 ms 37820 KB Output is correct
3 Correct 93 ms 35028 KB Output is correct
4 Correct 135 ms 38676 KB Output is correct
5 Correct 104 ms 34808 KB Output is correct
6 Correct 116 ms 38480 KB Output is correct
7 Correct 119 ms 38588 KB Output is correct
8 Correct 115 ms 35140 KB Output is correct
9 Correct 117 ms 38468 KB Output is correct
10 Correct 3 ms 22876 KB Output is correct
11 Correct 106 ms 49484 KB Output is correct
12 Correct 110 ms 49564 KB Output is correct
13 Correct 116 ms 45008 KB Output is correct
14 Correct 105 ms 44772 KB Output is correct
15 Correct 116 ms 36688 KB Output is correct
16 Correct 61 ms 41416 KB Output is correct
17 Correct 108 ms 37712 KB Output is correct
18 Correct 101 ms 36320 KB Output is correct
19 Correct 113 ms 37732 KB Output is correct
20 Correct 112 ms 36400 KB Output is correct
21 Correct 170 ms 49620 KB Output is correct
22 Correct 218 ms 58848 KB Output is correct
23 Correct 244 ms 58964 KB Output is correct
24 Correct 190 ms 54832 KB Output is correct
25 Correct 284 ms 58960 KB Output is correct
26 Correct 223 ms 58888 KB Output is correct
27 Correct 151 ms 49748 KB Output is correct
28 Correct 224 ms 58964 KB Output is correct
29 Correct 106 ms 45100 KB Output is correct
30 Correct 102 ms 44356 KB Output is correct
31 Correct 98 ms 45400 KB Output is correct
32 Correct 108 ms 45376 KB Output is correct
33 Correct 221 ms 63136 KB Output is correct
34 Correct 231 ms 63060 KB Output is correct
35 Correct 207 ms 57600 KB Output is correct
36 Correct 241 ms 57428 KB Output is correct
37 Correct 184 ms 46672 KB Output is correct
38 Correct 185 ms 45740 KB Output is correct
39 Correct 228 ms 52560 KB Output is correct
40 Correct 167 ms 44196 KB Output is correct
41 Correct 168 ms 46672 KB Output is correct
42 Correct 214 ms 53056 KB Output is correct
43 Correct 187 ms 44224 KB Output is correct
44 Correct 195 ms 47156 KB Output is correct
45 Correct 90 ms 39748 KB Output is correct
46 Correct 81 ms 35408 KB Output is correct
47 Correct 3 ms 22876 KB Output is correct
48 Correct 3 ms 22876 KB Output is correct
49 Correct 331 ms 343888 KB Output is correct
50 Correct 337 ms 343220 KB Output is correct
51 Correct 338 ms 340560 KB Output is correct
52 Correct 332 ms 325452 KB Output is correct
53 Correct 329 ms 326988 KB Output is correct
54 Correct 195 ms 187472 KB Output is correct
55 Correct 57 ms 33364 KB Output is correct
56 Runtime error 987 ms 1048576 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -