oj.uz

답안 #1061615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061615 2024-08-16T11:14:46 Z new_acc Escape Route 2 (JOI24_escape2) C++14
90 / 100
 3000 ms 645220 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=1e6+10;
const int SS=1<<19;
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=20;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 517632 KB Output is correct
2 Correct 216 ms 520660 KB Output is correct
3 Correct 357 ms 535632 KB Output is correct
4 Correct 483 ms 542292 KB Output is correct
5 Correct 567 ms 537860 KB Output is correct
6 Correct 593 ms 542548 KB Output is correct
7 Correct 632 ms 542680 KB Output is correct
8 Correct 423 ms 537980 KB Output is correct
9 Correct 513 ms 542588 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 517632 KB Output is correct
2 Correct 216 ms 520660 KB Output is correct
3 Correct 357 ms 535632 KB Output is correct
4 Correct 483 ms 542292 KB Output is correct
5 Correct 567 ms 537860 KB Output is correct
6 Correct 593 ms 542548 KB Output is correct
7 Correct 632 ms 542680 KB Output is correct
8 Correct 423 ms 537980 KB Output is correct
9 Correct 513 ms 542588 KB Output is correct
10 Correct 207 ms 517624 KB Output is correct
11 Correct 398 ms 528468 KB Output is correct
12 Correct 420 ms 528292 KB Output is correct
13 Correct 399 ms 528212 KB Output is correct
14 Correct 384 ms 528212 KB Output is correct
15 Correct 442 ms 535120 KB Output is correct
16 Correct 216 ms 521460 KB Output is correct
17 Correct 415 ms 541124 KB Output is correct
18 Correct 383 ms 535636 KB Output is correct
19 Correct 458 ms 540496 KB Output is correct
20 Correct 381 ms 534288 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 517632 KB Output is correct
2 Correct 216 ms 520660 KB Output is correct
3 Correct 357 ms 535632 KB Output is correct
4 Correct 483 ms 542292 KB Output is correct
5 Correct 567 ms 537860 KB Output is correct
6 Correct 593 ms 542548 KB Output is correct
7 Correct 632 ms 542680 KB Output is correct
8 Correct 423 ms 537980 KB Output is correct
9 Correct 513 ms 542588 KB Output is correct
10 Correct 719 ms 614368 KB Output is correct
11 Correct 972 ms 643668 KB Output is correct
12 Correct 1020 ms 643668 KB Output is correct
13 Correct 840 ms 638704 KB Output is correct
14 Correct 1002 ms 644884 KB Output is correct
15 Correct 1038 ms 644948 KB Output is correct
16 Correct 721 ms 615760 KB Output is correct
17 Correct 1054 ms 645220 KB Output is correct
18 Correct 517 ms 617040 KB Output is correct
19 Correct 492 ms 616016 KB Output is correct
20 Correct 521 ms 617584 KB Output is correct
21 Correct 526 ms 617296 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 517632 KB Output is correct
2 Correct 216 ms 520660 KB Output is correct
3 Correct 357 ms 535632 KB Output is correct
4 Correct 483 ms 542292 KB Output is correct
5 Correct 567 ms 537860 KB Output is correct
6 Correct 593 ms 542548 KB Output is correct
7 Correct 632 ms 542680 KB Output is correct
8 Correct 423 ms 537980 KB Output is correct
9 Correct 513 ms 542588 KB Output is correct
10 Correct 207 ms 517624 KB Output is correct
11 Correct 398 ms 528468 KB Output is correct
12 Correct 420 ms 528292 KB Output is correct
13 Correct 399 ms 528212 KB Output is correct
14 Correct 384 ms 528212 KB Output is correct
15 Correct 442 ms 535120 KB Output is correct
16 Correct 216 ms 521460 KB Output is correct
17 Correct 415 ms 541124 KB Output is correct
18 Correct 383 ms 535636 KB Output is correct
19 Correct 458 ms 540496 KB Output is correct
20 Correct 381 ms 534288 KB Output is correct
21 Correct 719 ms 614368 KB Output is correct
22 Correct 972 ms 643668 KB Output is correct
23 Correct 1020 ms 643668 KB Output is correct
24 Correct 840 ms 638704 KB Output is correct
25 Correct 1002 ms 644884 KB Output is correct
26 Correct 1038 ms 644948 KB Output is correct
27 Correct 721 ms 615760 KB Output is correct
28 Correct 1054 ms 645220 KB Output is correct
29 Correct 517 ms 617040 KB Output is correct
30 Correct 492 ms 616016 KB Output is correct
31 Correct 521 ms 617584 KB Output is correct
32 Correct 526 ms 617296 KB Output is correct
33 Correct 1316 ms 594660 KB Output is correct
34 Correct 1269 ms 594584 KB Output is correct
35 Correct 1153 ms 586580 KB Output is correct
36 Correct 1133 ms 586692 KB Output is correct
37 Correct 771 ms 593948 KB Output is correct
38 Correct 677 ms 597332 KB Output is correct
39 Correct 798 ms 617300 KB Output is correct
40 Correct 650 ms 576540 KB Output is correct
41 Correct 763 ms 595028 KB Output is correct
42 Correct 883 ms 618384 KB Output is correct
43 Correct 713 ms 584272 KB Output is correct
44 Correct 816 ms 589704 KB Output is correct
45 Correct 517 ms 596488 KB Output is correct
46 Correct 477 ms 575768 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 517512 KB Output is correct
2 Correct 167 ms 517712 KB Output is correct
3 Correct 2726 ms 558092 KB Output is correct
4 Correct 2493 ms 558144 KB Output is correct
5 Correct 2644 ms 558204 KB Output is correct
6 Correct 2573 ms 557920 KB Output is correct
7 Correct 2369 ms 558016 KB Output is correct
8 Correct 349 ms 538944 KB Output is correct
9 Correct 316 ms 554068 KB Output is correct
10 Correct 282 ms 537768 KB Output is correct
11 Correct 510 ms 617044 KB Output is correct
12 Correct 454 ms 596344 KB Output is correct
13 Correct 463 ms 575800 KB Output is correct
14 Correct 437 ms 566972 KB Output is correct
15 Correct 390 ms 566368 KB Output is correct
16 Correct 361 ms 569184 KB Output is correct
17 Correct 405 ms 568400 KB Output is correct
18 Correct 399 ms 554988 KB Output is correct
19 Correct 384 ms 553560 KB Output is correct
20 Correct 352 ms 595540 KB Output is correct
21 Correct 411 ms 597204 KB Output is correct
22 Correct 327 ms 573876 KB Output is correct
23 Correct 367 ms 575628 KB Output is correct
24 Correct 442 ms 576512 KB Output is correct
25 Correct 376 ms 574372 KB Output is correct
26 Correct 448 ms 578772 KB Output is correct
27 Correct 458 ms 617236 KB Output is correct
28 Correct 498 ms 618320 KB Output is correct
29 Correct 520 ms 618452 KB Output is correct
30 Correct 280 ms 535176 KB Output is correct
31 Correct 240 ms 521688 KB Output is correct
32 Correct 288 ms 535636 KB Output is correct
33 Correct 223 ms 522972 KB Output is correct
34 Correct 255 ms 528212 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 517632 KB Output is correct
2 Correct 216 ms 520660 KB Output is correct
3 Correct 357 ms 535632 KB Output is correct
4 Correct 483 ms 542292 KB Output is correct
5 Correct 567 ms 537860 KB Output is correct
6 Correct 593 ms 542548 KB Output is correct
7 Correct 632 ms 542680 KB Output is correct
8 Correct 423 ms 537980 KB Output is correct
9 Correct 513 ms 542588 KB Output is correct
10 Correct 207 ms 517624 KB Output is correct
11 Correct 398 ms 528468 KB Output is correct
12 Correct 420 ms 528292 KB Output is correct
13 Correct 399 ms 528212 KB Output is correct
14 Correct 384 ms 528212 KB Output is correct
15 Correct 442 ms 535120 KB Output is correct
16 Correct 216 ms 521460 KB Output is correct
17 Correct 415 ms 541124 KB Output is correct
18 Correct 383 ms 535636 KB Output is correct
19 Correct 458 ms 540496 KB Output is correct
20 Correct 381 ms 534288 KB Output is correct
21 Correct 719 ms 614368 KB Output is correct
22 Correct 972 ms 643668 KB Output is correct
23 Correct 1020 ms 643668 KB Output is correct
24 Correct 840 ms 638704 KB Output is correct
25 Correct 1002 ms 644884 KB Output is correct
26 Correct 1038 ms 644948 KB Output is correct
27 Correct 721 ms 615760 KB Output is correct
28 Correct 1054 ms 645220 KB Output is correct
29 Correct 517 ms 617040 KB Output is correct
30 Correct 492 ms 616016 KB Output is correct
31 Correct 521 ms 617584 KB Output is correct
32 Correct 526 ms 617296 KB Output is correct
33 Correct 1316 ms 594660 KB Output is correct
34 Correct 1269 ms 594584 KB Output is correct
35 Correct 1153 ms 586580 KB Output is correct
36 Correct 1133 ms 586692 KB Output is correct
37 Correct 771 ms 593948 KB Output is correct
38 Correct 677 ms 597332 KB Output is correct
39 Correct 798 ms 617300 KB Output is correct
40 Correct 650 ms 576540 KB Output is correct
41 Correct 763 ms 595028 KB Output is correct
42 Correct 883 ms 618384 KB Output is correct
43 Correct 713 ms 584272 KB Output is correct
44 Correct 816 ms 589704 KB Output is correct
45 Correct 517 ms 596488 KB Output is correct
46 Correct 477 ms 575768 KB Output is correct
47 Correct 175 ms 517512 KB Output is correct
48 Correct 167 ms 517712 KB Output is correct
49 Correct 2726 ms 558092 KB Output is correct
50 Correct 2493 ms 558144 KB Output is correct
51 Correct 2644 ms 558204 KB Output is correct
52 Correct 2573 ms 557920 KB Output is correct
53 Correct 2369 ms 558016 KB Output is correct
54 Correct 349 ms 538944 KB Output is correct
55 Correct 316 ms 554068 KB Output is correct
56 Correct 282 ms 537768 KB Output is correct
57 Correct 510 ms 617044 KB Output is correct
58 Correct 454 ms 596344 KB Output is correct
59 Correct 463 ms 575800 KB Output is correct
60 Correct 437 ms 566972 KB Output is correct
61 Correct 390 ms 566368 KB Output is correct
62 Correct 361 ms 569184 KB Output is correct
63 Correct 405 ms 568400 KB Output is correct
64 Correct 399 ms 554988 KB Output is correct
65 Correct 384 ms 553560 KB Output is correct
66 Correct 352 ms 595540 KB Output is correct
67 Correct 411 ms 597204 KB Output is correct
68 Correct 327 ms 573876 KB Output is correct
69 Correct 367 ms 575628 KB Output is correct
70 Correct 442 ms 576512 KB Output is correct
71 Correct 376 ms 574372 KB Output is correct
72 Correct 448 ms 578772 KB Output is correct
73 Correct 458 ms 617236 KB Output is correct
74 Correct 498 ms 618320 KB Output is correct
75 Correct 520 ms 618452 KB Output is correct
76 Correct 280 ms 535176 KB Output is correct
77 Correct 240 ms 521688 KB Output is correct
78 Correct 288 ms 535636 KB Output is correct
79 Correct 223 ms 522972 KB Output is correct
80 Correct 255 ms 528212 KB Output is correct
81 Execution timed out 3093 ms 565084 KB Time limit exceeded
82 Halted 0 ms 0 KB -