oj.uz

Submission #1061623

# Submission time Handle Problem Language Result Execution time Memory
1061623 2024-08-16T11:18:23 Z new_acc Escape Route 2 (JOI24_escape2) C++14
90 / 100
 3000 ms 155112 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e5+10;
const int SS=1<<1;
const int INFi=2e9;
const ll INFl=1e16;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=2027865967;
const ll p=70032301;
const ull p2=913;
const int L=17;
int n,m;
vector<pair<int,int>> t[N];
vi t2[N],naj[N][L];
pair<int,ll> jp[N][L];
pair<int,int> num[N];
map<pair<int,int>, ll> mm;
ll zn(int a,int b){
    ll res=0,curr=0;
    int g=0;
    b--;
    if(num[a].fi==b){
        return t[b][num[a].se].se-t[b][num[a].se].fi;
    }
    for(int i=L-1;i>=0;i--){
        if(num[jp[a][i].fi].fi>=b) res=curr+jp[a][i].se,g=jp[a][i].fi;
        else{
            curr+=jp[a][i].se;
            a=jp[a][i].fi;
        }
    }
    res+=t[b][num[g].se].se-t[b][num[g].se].fi;
    return res;
}
void solve(){
    cin>>n>>m;
    vector<pair<int,int>> cr;
    int li=0;
    for(int i=1;i<n;i++){
        int a;
        cin>>a;
        cr.clear();
        while(a--){
            int x,d;
            cin>>x>>d;
            cr.push_back({x,d});
        }
        sort(cr.begin(),cr.end());
        reverse(cr.begin(),cr.end());
        while(cr.size()){
            while(t[i].size() and t[i].back().se>cr.back().se) t[i].pop_back();
            t[i].push_back(cr.back());
            cr.pop_back();
        }
        for(int i2=0;i2<t[i].size();i2++){
            t2[i].push_back(++li);
            num[li]={i,i2};
        }
    }
    num[li+1].fi=n;
    for(int i=0;i<L;i++) jp[li+1][i].fi=li+1;
    for(int i=1;i<n;i++){
        int curr=0;
        for(int i2=0;i2<t[i].size();i2++){
            while(curr<t[i+1].size() and t[i+1][curr].fi<t[i][i2].se) curr++;
            ll xd=t[i][i2].se-t[i][i2].fi;
            if(curr==t[i+1].size()){
                if(i<n-1) xd+=m-t[i][i2].se+t[i+1][0].fi,jp[t2[i][i2]][0].fi=t2[i+1][0];
                else jp[t2[i][i2]][0].fi=li+1;
            }else{
                xd+=t[i+1][curr].fi-t[i][i2].se;
                jp[t2[i][i2]][0].fi=t2[i+1][curr];
            }
            jp[t2[i][i2]][0].se=xd;
        }
    }
    for(int i2=1;i2<L;i2++){
        for(int i=1;i<=li;i++){
            int g=jp[i][i2].fi;
            jp[i][i2].se=jp[i][i2-1].se+jp[jp[i][i2-1].fi][i2-1].se;
            jp[i][i2].fi=jp[jp[i][i2-1].fi][i2-1].fi;
        }
    }
    for(int i=1;i<n;i++){
        for(int i2=0;i2<L;i2++){
            vector<pair<int,pair<ll,int>>> xd;
            for(auto u:t2[i])
                xd.push_back({jp[u][i2].fi,{jp[u][i2].se,u}});
            sort(xd.begin(),xd.end());
            for(int i3=0;i3<xd.size();i3++){
                if(i3==0 or xd[i3-1].fi!=xd[i3].fi)
                    naj[i][i2].push_back(xd[i3].se.se);
            }
        }
    }
    int q;
    cin>>q;
    for(int i=1;i<=q;i++){
        int a,b;
        cin>>a>>b;
        if(mm.count(make_pair(a,b))>0){
            cout<<mm[make_pair(a,b)]<<"\n";
            continue;
        }
        ll res=INFl;
        int xd=b-a-1;
        if(xd==0){
            for(auto u:t2[a]) res=min(res,zn(u,b));
            mm[make_pair(a,b)]=res;
            cout<<res<<"\n";
        }else{
            int ost=0;
            for(int i2=0;i2<L;i2++){
                if((1<<i2)<=xd) ost=i2;
            }
            for(auto u:naj[a][ost]) res=min(res,zn(u,b));
            mm[make_pair(a,b)]=res;
            cout<<res<<"\n";
        }
    } 
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    while(tt--) solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:63:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for(int i2=0;i2<t[i].size();i2++){
      |                      ~~^~~~~~~~~~~~
Main.cpp:72:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for(int i2=0;i2<t[i].size();i2++){
      |                      ~~^~~~~~~~~~~~
Main.cpp:73:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             while(curr<t[i+1].size() and t[i+1][curr].fi<t[i][i2].se) curr++;
      |                   ~~~~^~~~~~~~~~~~~~
Main.cpp:75:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             if(curr==t[i+1].size()){
      |                ~~~~^~~~~~~~~~~~~~~
Main.cpp:87:17: warning: unused variable 'g' [-Wunused-variable]
   87 |             int g=jp[i][i2].fi;
      |                 ^
Main.cpp:98:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<long long int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |             for(int i3=0;i3<xd.size();i3++){
      |                          ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 42 ms 50516 KB Output is correct
3 Correct 180 ms 64732 KB Output is correct
4 Correct 244 ms 70496 KB Output is correct
5 Correct 213 ms 65616 KB Output is correct
6 Correct 279 ms 70224 KB Output is correct
7 Correct 261 ms 70228 KB Output is correct
8 Correct 197 ms 64504 KB Output is correct
9 Correct 267 ms 70036 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 42 ms 50516 KB Output is correct
3 Correct 180 ms 64732 KB Output is correct
4 Correct 244 ms 70496 KB Output is correct
5 Correct 213 ms 65616 KB Output is correct
6 Correct 279 ms 70224 KB Output is correct
7 Correct 261 ms 70228 KB Output is correct
8 Correct 197 ms 64504 KB Output is correct
9 Correct 267 ms 70036 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 205 ms 56528 KB Output is correct
12 Correct 202 ms 56312 KB Output is correct
13 Correct 189 ms 56404 KB Output is correct
14 Correct 197 ms 56384 KB Output is correct
15 Correct 223 ms 63076 KB Output is correct
16 Correct 42 ms 50512 KB Output is correct
17 Correct 235 ms 68816 KB Output is correct
18 Correct 204 ms 63628 KB Output is correct
19 Correct 263 ms 68180 KB Output is correct
20 Correct 220 ms 62368 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 42 ms 50516 KB Output is correct
3 Correct 180 ms 64732 KB Output is correct
4 Correct 244 ms 70496 KB Output is correct
5 Correct 213 ms 65616 KB Output is correct
6 Correct 279 ms 70224 KB Output is correct
7 Correct 261 ms 70228 KB Output is correct
8 Correct 197 ms 64504 KB Output is correct
9 Correct 267 ms 70036 KB Output is correct
10 Correct 434 ms 129944 KB Output is correct
11 Correct 742 ms 153680 KB Output is correct
12 Correct 779 ms 153712 KB Output is correct
13 Correct 652 ms 149328 KB Output is correct
14 Correct 827 ms 154964 KB Output is correct
15 Correct 809 ms 154964 KB Output is correct
16 Correct 523 ms 131068 KB Output is correct
17 Correct 744 ms 155112 KB Output is correct
18 Correct 258 ms 130640 KB Output is correct
19 Correct 249 ms 129748 KB Output is correct
20 Correct 292 ms 130896 KB Output is correct
21 Correct 284 ms 130828 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 42 ms 50516 KB Output is correct
3 Correct 180 ms 64732 KB Output is correct
4 Correct 244 ms 70496 KB Output is correct
5 Correct 213 ms 65616 KB Output is correct
6 Correct 279 ms 70224 KB Output is correct
7 Correct 261 ms 70228 KB Output is correct
8 Correct 197 ms 64504 KB Output is correct
9 Correct 267 ms 70036 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 205 ms 56528 KB Output is correct
12 Correct 202 ms 56312 KB Output is correct
13 Correct 189 ms 56404 KB Output is correct
14 Correct 197 ms 56384 KB Output is correct
15 Correct 223 ms 63076 KB Output is correct
16 Correct 42 ms 50512 KB Output is correct
17 Correct 235 ms 68816 KB Output is correct
18 Correct 204 ms 63628 KB Output is correct
19 Correct 263 ms 68180 KB Output is correct
20 Correct 220 ms 62368 KB Output is correct
21 Correct 434 ms 129944 KB Output is correct
22 Correct 742 ms 153680 KB Output is correct
23 Correct 779 ms 153712 KB Output is correct
24 Correct 652 ms 149328 KB Output is correct
25 Correct 827 ms 154964 KB Output is correct
26 Correct 809 ms 154964 KB Output is correct
27 Correct 523 ms 131068 KB Output is correct
28 Correct 744 ms 155112 KB Output is correct
29 Correct 258 ms 130640 KB Output is correct
30 Correct 249 ms 129748 KB Output is correct
31 Correct 292 ms 130896 KB Output is correct
32 Correct 284 ms 130828 KB Output is correct
33 Correct 835 ms 112520 KB Output is correct
34 Correct 845 ms 112412 KB Output is correct
35 Correct 726 ms 105816 KB Output is correct
36 Correct 779 ms 105676 KB Output is correct
37 Correct 556 ms 112088 KB Output is correct
38 Correct 500 ms 115540 KB Output is correct
39 Correct 631 ms 130912 KB Output is correct
40 Correct 506 ms 98676 KB Output is correct
41 Correct 540 ms 113200 KB Output is correct
42 Correct 671 ms 133144 KB Output is correct
43 Correct 448 ms 105096 KB Output is correct
44 Correct 606 ms 109304 KB Output is correct
45 Correct 300 ms 112796 KB Output is correct
46 Correct 243 ms 95184 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 9 ms 47452 KB Output is correct
3 Correct 1724 ms 80368 KB Output is correct
4 Correct 1714 ms 80208 KB Output is correct
5 Correct 1681 ms 80280 KB Output is correct
6 Correct 1763 ms 80336 KB Output is correct
7 Correct 1780 ms 80324 KB Output is correct
8 Correct 147 ms 65192 KB Output is correct
9 Correct 119 ms 76240 KB Output is correct
10 Correct 106 ms 64668 KB Output is correct
11 Correct 287 ms 130644 KB Output is correct
12 Correct 274 ms 112728 KB Output is correct
13 Correct 207 ms 95356 KB Output is correct
14 Correct 221 ms 87444 KB Output is correct
15 Correct 194 ms 86788 KB Output is correct
16 Correct 175 ms 89496 KB Output is correct
17 Correct 220 ms 88712 KB Output is correct
18 Correct 224 ms 76904 KB Output is correct
19 Correct 179 ms 75820 KB Output is correct
20 Correct 212 ms 111376 KB Output is correct
21 Correct 235 ms 113456 KB Output is correct
22 Correct 175 ms 93084 KB Output is correct
23 Correct 222 ms 94976 KB Output is correct
24 Correct 251 ms 95312 KB Output is correct
25 Correct 223 ms 92436 KB Output is correct
26 Correct 267 ms 96728 KB Output is correct
27 Correct 285 ms 129816 KB Output is correct
28 Correct 354 ms 130704 KB Output is correct
29 Correct 311 ms 130904 KB Output is correct
30 Correct 136 ms 60144 KB Output is correct
31 Correct 46 ms 48956 KB Output is correct
32 Correct 128 ms 62004 KB Output is correct
33 Correct 67 ms 49700 KB Output is correct
34 Correct 127 ms 54628 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 42 ms 50516 KB Output is correct
3 Correct 180 ms 64732 KB Output is correct
4 Correct 244 ms 70496 KB Output is correct
5 Correct 213 ms 65616 KB Output is correct
6 Correct 279 ms 70224 KB Output is correct
7 Correct 261 ms 70228 KB Output is correct
8 Correct 197 ms 64504 KB Output is correct
9 Correct 267 ms 70036 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 205 ms 56528 KB Output is correct
12 Correct 202 ms 56312 KB Output is correct
13 Correct 189 ms 56404 KB Output is correct
14 Correct 197 ms 56384 KB Output is correct
15 Correct 223 ms 63076 KB Output is correct
16 Correct 42 ms 50512 KB Output is correct
17 Correct 235 ms 68816 KB Output is correct
18 Correct 204 ms 63628 KB Output is correct
19 Correct 263 ms 68180 KB Output is correct
20 Correct 220 ms 62368 KB Output is correct
21 Correct 434 ms 129944 KB Output is correct
22 Correct 742 ms 153680 KB Output is correct
23 Correct 779 ms 153712 KB Output is correct
24 Correct 652 ms 149328 KB Output is correct
25 Correct 827 ms 154964 KB Output is correct
26 Correct 809 ms 154964 KB Output is correct
27 Correct 523 ms 131068 KB Output is correct
28 Correct 744 ms 155112 KB Output is correct
29 Correct 258 ms 130640 KB Output is correct
30 Correct 249 ms 129748 KB Output is correct
31 Correct 292 ms 130896 KB Output is correct
32 Correct 284 ms 130828 KB Output is correct
33 Correct 835 ms 112520 KB Output is correct
34 Correct 845 ms 112412 KB Output is correct
35 Correct 726 ms 105816 KB Output is correct
36 Correct 779 ms 105676 KB Output is correct
37 Correct 556 ms 112088 KB Output is correct
38 Correct 500 ms 115540 KB Output is correct
39 Correct 631 ms 130912 KB Output is correct
40 Correct 506 ms 98676 KB Output is correct
41 Correct 540 ms 113200 KB Output is correct
42 Correct 671 ms 133144 KB Output is correct
43 Correct 448 ms 105096 KB Output is correct
44 Correct 606 ms 109304 KB Output is correct
45 Correct 300 ms 112796 KB Output is correct
46 Correct 243 ms 95184 KB Output is correct
47 Correct 7 ms 47452 KB Output is correct
48 Correct 9 ms 47452 KB Output is correct
49 Correct 1724 ms 80368 KB Output is correct
50 Correct 1714 ms 80208 KB Output is correct
51 Correct 1681 ms 80280 KB Output is correct
52 Correct 1763 ms 80336 KB Output is correct
53 Correct 1780 ms 80324 KB Output is correct
54 Correct 147 ms 65192 KB Output is correct
55 Correct 119 ms 76240 KB Output is correct
56 Correct 106 ms 64668 KB Output is correct
57 Correct 287 ms 130644 KB Output is correct
58 Correct 274 ms 112728 KB Output is correct
59 Correct 207 ms 95356 KB Output is correct
60 Correct 221 ms 87444 KB Output is correct
61 Correct 194 ms 86788 KB Output is correct
62 Correct 175 ms 89496 KB Output is correct
63 Correct 220 ms 88712 KB Output is correct
64 Correct 224 ms 76904 KB Output is correct
65 Correct 179 ms 75820 KB Output is correct
66 Correct 212 ms 111376 KB Output is correct
67 Correct 235 ms 113456 KB Output is correct
68 Correct 175 ms 93084 KB Output is correct
69 Correct 222 ms 94976 KB Output is correct
70 Correct 251 ms 95312 KB Output is correct
71 Correct 223 ms 92436 KB Output is correct
72 Correct 267 ms 96728 KB Output is correct
73 Correct 285 ms 129816 KB Output is correct
74 Correct 354 ms 130704 KB Output is correct
75 Correct 311 ms 130904 KB Output is correct
76 Correct 136 ms 60144 KB Output is correct
77 Correct 46 ms 48956 KB Output is correct
78 Correct 128 ms 62004 KB Output is correct
79 Correct 67 ms 49700 KB Output is correct
80 Correct 127 ms 54628 KB Output is correct
81 Execution timed out 3048 ms 84900 KB Time limit exceeded
82 Halted 0 ms 0 KB -