oj.uz

답안 #1061657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061657 2024-08-16T11:30:47 Z new_acc Escape Route 2 (JOI24_escape2) C++14
90 / 100
 3000 ms 155068 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 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--;
    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;
            xd.clear();
            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(int i2=0;i2<t2[a].size();i2++){
                res=min(res,(ll)t[b-1][i2].se-(ll)t[b-1][i2].fi);
            }
            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:59: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]
   59 |         for(int i2=0;i2<t[i].size();i2++){
      |                      ~~^~~~~~~~~~~~
Main.cpp:68: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]
   68 |         for(int i2=0;i2<t[i].size();i2++){
      |                      ~~^~~~~~~~~~~~
Main.cpp:69: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]
   69 |             while(curr<t[i+1].size() and t[i+1][curr].fi<t[i][i2].se) curr++;
      |                   ~~~~^~~~~~~~~~~~~~
Main.cpp:71: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]
   71 |             if(curr==t[i+1].size()){
      |                ~~~~^~~~~~~~~~~~~~~
Main.cpp:83:17: warning: unused variable 'g' [-Wunused-variable]
   83 |             int g=jp[i][i2].fi;
      |                 ^
Main.cpp:95: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]
   95 |             for(int i3=0;i3<xd.size();i3++){
      |                          ~~^~~~~~~~~~
Main.cpp:113:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |             for(int i2=0;i2<t2[a].size();i2++){
      |                          ~~^~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47448 KB Output is correct
2 Correct 42 ms 50632 KB Output is correct
3 Correct 173 ms 64932 KB Output is correct
4 Correct 241 ms 70484 KB Output is correct
5 Correct 199 ms 65616 KB Output is correct
6 Correct 260 ms 70228 KB Output is correct
7 Correct 269 ms 70224 KB Output is correct
8 Correct 200 ms 64592 KB Output is correct
9 Correct 255 ms 70192 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47448 KB Output is correct
2 Correct 42 ms 50632 KB Output is correct
3 Correct 173 ms 64932 KB Output is correct
4 Correct 241 ms 70484 KB Output is correct
5 Correct 199 ms 65616 KB Output is correct
6 Correct 260 ms 70228 KB Output is correct
7 Correct 269 ms 70224 KB Output is correct
8 Correct 200 ms 64592 KB Output is correct
9 Correct 255 ms 70192 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 200 ms 56508 KB Output is correct
12 Correct 193 ms 56376 KB Output is correct
13 Correct 184 ms 56400 KB Output is correct
14 Correct 187 ms 56356 KB Output is correct
15 Correct 209 ms 63056 KB Output is correct
16 Correct 42 ms 50564 KB Output is correct
17 Correct 261 ms 68948 KB Output is correct
18 Correct 194 ms 63776 KB Output is correct
19 Correct 250 ms 68308 KB Output is correct
20 Correct 197 ms 62480 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47448 KB Output is correct
2 Correct 42 ms 50632 KB Output is correct
3 Correct 173 ms 64932 KB Output is correct
4 Correct 241 ms 70484 KB Output is correct
5 Correct 199 ms 65616 KB Output is correct
6 Correct 260 ms 70228 KB Output is correct
7 Correct 269 ms 70224 KB Output is correct
8 Correct 200 ms 64592 KB Output is correct
9 Correct 255 ms 70192 KB Output is correct
10 Correct 463 ms 129876 KB Output is correct
11 Correct 682 ms 153652 KB Output is correct
12 Correct 632 ms 153680 KB Output is correct
13 Correct 532 ms 149240 KB Output is correct
14 Correct 653 ms 155068 KB Output is correct
15 Correct 683 ms 154960 KB Output is correct
16 Correct 458 ms 131168 KB Output is correct
17 Correct 656 ms 155012 KB Output is correct
18 Correct 261 ms 130800 KB Output is correct
19 Correct 266 ms 129616 KB Output is correct
20 Correct 261 ms 130716 KB Output is correct
21 Correct 259 ms 130824 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47448 KB Output is correct
2 Correct 42 ms 50632 KB Output is correct
3 Correct 173 ms 64932 KB Output is correct
4 Correct 241 ms 70484 KB Output is correct
5 Correct 199 ms 65616 KB Output is correct
6 Correct 260 ms 70228 KB Output is correct
7 Correct 269 ms 70224 KB Output is correct
8 Correct 200 ms 64592 KB Output is correct
9 Correct 255 ms 70192 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 200 ms 56508 KB Output is correct
12 Correct 193 ms 56376 KB Output is correct
13 Correct 184 ms 56400 KB Output is correct
14 Correct 187 ms 56356 KB Output is correct
15 Correct 209 ms 63056 KB Output is correct
16 Correct 42 ms 50564 KB Output is correct
17 Correct 261 ms 68948 KB Output is correct
18 Correct 194 ms 63776 KB Output is correct
19 Correct 250 ms 68308 KB Output is correct
20 Correct 197 ms 62480 KB Output is correct
21 Correct 463 ms 129876 KB Output is correct
22 Correct 682 ms 153652 KB Output is correct
23 Correct 632 ms 153680 KB Output is correct
24 Correct 532 ms 149240 KB Output is correct
25 Correct 653 ms 155068 KB Output is correct
26 Correct 683 ms 154960 KB Output is correct
27 Correct 458 ms 131168 KB Output is correct
28 Correct 656 ms 155012 KB Output is correct
29 Correct 261 ms 130800 KB Output is correct
30 Correct 266 ms 129616 KB Output is correct
31 Correct 261 ms 130716 KB Output is correct
32 Correct 259 ms 130824 KB Output is correct
33 Correct 869 ms 112468 KB Output is correct
34 Correct 848 ms 112464 KB Output is correct
35 Correct 738 ms 105660 KB Output is correct
36 Correct 824 ms 105760 KB Output is correct
37 Correct 473 ms 112208 KB Output is correct
38 Correct 454 ms 115352 KB Output is correct
39 Correct 515 ms 130896 KB Output is correct
40 Correct 379 ms 98640 KB Output is correct
41 Correct 469 ms 113236 KB Output is correct
42 Correct 632 ms 132944 KB Output is correct
43 Correct 388 ms 105044 KB Output is correct
44 Correct 457 ms 109344 KB Output is correct
45 Correct 225 ms 112920 KB Output is correct
46 Correct 189 ms 95356 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47452 KB Output is correct
2 Correct 7 ms 47452 KB Output is correct
3 Correct 1586 ms 80216 KB Output is correct
4 Correct 1532 ms 80212 KB Output is correct
5 Correct 1556 ms 80352 KB Output is correct
6 Correct 1532 ms 80208 KB Output is correct
7 Correct 1547 ms 80172 KB Output is correct
8 Correct 142 ms 65244 KB Output is correct
9 Correct 114 ms 76280 KB Output is correct
10 Correct 99 ms 64680 KB Output is correct
11 Correct 262 ms 130584 KB Output is correct
12 Correct 241 ms 112720 KB Output is correct
13 Correct 213 ms 95144 KB Output is correct
14 Correct 222 ms 87260 KB Output is correct
15 Correct 198 ms 86628 KB Output is correct
16 Correct 163 ms 89424 KB Output is correct
17 Correct 182 ms 88808 KB Output is correct
18 Correct 201 ms 76908 KB Output is correct
19 Correct 161 ms 75692 KB Output is correct
20 Correct 154 ms 111500 KB Output is correct
21 Correct 229 ms 113232 KB Output is correct
22 Correct 142 ms 93100 KB Output is correct
23 Correct 184 ms 94880 KB Output is correct
24 Correct 231 ms 95156 KB Output is correct
25 Correct 189 ms 92688 KB Output is correct
26 Correct 279 ms 96608 KB Output is correct
27 Correct 274 ms 129708 KB Output is correct
28 Correct 272 ms 130764 KB Output is correct
29 Correct 301 ms 130896 KB Output is correct
30 Correct 128 ms 60100 KB Output is correct
31 Correct 48 ms 48860 KB Output is correct
32 Correct 129 ms 62172 KB Output is correct
33 Correct 65 ms 49652 KB Output is correct
34 Correct 126 ms 54752 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 47448 KB Output is correct
2 Correct 42 ms 50632 KB Output is correct
3 Correct 173 ms 64932 KB Output is correct
4 Correct 241 ms 70484 KB Output is correct
5 Correct 199 ms 65616 KB Output is correct
6 Correct 260 ms 70228 KB Output is correct
7 Correct 269 ms 70224 KB Output is correct
8 Correct 200 ms 64592 KB Output is correct
9 Correct 255 ms 70192 KB Output is correct
10 Correct 7 ms 47452 KB Output is correct
11 Correct 200 ms 56508 KB Output is correct
12 Correct 193 ms 56376 KB Output is correct
13 Correct 184 ms 56400 KB Output is correct
14 Correct 187 ms 56356 KB Output is correct
15 Correct 209 ms 63056 KB Output is correct
16 Correct 42 ms 50564 KB Output is correct
17 Correct 261 ms 68948 KB Output is correct
18 Correct 194 ms 63776 KB Output is correct
19 Correct 250 ms 68308 KB Output is correct
20 Correct 197 ms 62480 KB Output is correct
21 Correct 463 ms 129876 KB Output is correct
22 Correct 682 ms 153652 KB Output is correct
23 Correct 632 ms 153680 KB Output is correct
24 Correct 532 ms 149240 KB Output is correct
25 Correct 653 ms 155068 KB Output is correct
26 Correct 683 ms 154960 KB Output is correct
27 Correct 458 ms 131168 KB Output is correct
28 Correct 656 ms 155012 KB Output is correct
29 Correct 261 ms 130800 KB Output is correct
30 Correct 266 ms 129616 KB Output is correct
31 Correct 261 ms 130716 KB Output is correct
32 Correct 259 ms 130824 KB Output is correct
33 Correct 869 ms 112468 KB Output is correct
34 Correct 848 ms 112464 KB Output is correct
35 Correct 738 ms 105660 KB Output is correct
36 Correct 824 ms 105760 KB Output is correct
37 Correct 473 ms 112208 KB Output is correct
38 Correct 454 ms 115352 KB Output is correct
39 Correct 515 ms 130896 KB Output is correct
40 Correct 379 ms 98640 KB Output is correct
41 Correct 469 ms 113236 KB Output is correct
42 Correct 632 ms 132944 KB Output is correct
43 Correct 388 ms 105044 KB Output is correct
44 Correct 457 ms 109344 KB Output is correct
45 Correct 225 ms 112920 KB Output is correct
46 Correct 189 ms 95356 KB Output is correct
47 Correct 7 ms 47452 KB Output is correct
48 Correct 7 ms 47452 KB Output is correct
49 Correct 1586 ms 80216 KB Output is correct
50 Correct 1532 ms 80212 KB Output is correct
51 Correct 1556 ms 80352 KB Output is correct
52 Correct 1532 ms 80208 KB Output is correct
53 Correct 1547 ms 80172 KB Output is correct
54 Correct 142 ms 65244 KB Output is correct
55 Correct 114 ms 76280 KB Output is correct
56 Correct 99 ms 64680 KB Output is correct
57 Correct 262 ms 130584 KB Output is correct
58 Correct 241 ms 112720 KB Output is correct
59 Correct 213 ms 95144 KB Output is correct
60 Correct 222 ms 87260 KB Output is correct
61 Correct 198 ms 86628 KB Output is correct
62 Correct 163 ms 89424 KB Output is correct
63 Correct 182 ms 88808 KB Output is correct
64 Correct 201 ms 76908 KB Output is correct
65 Correct 161 ms 75692 KB Output is correct
66 Correct 154 ms 111500 KB Output is correct
67 Correct 229 ms 113232 KB Output is correct
68 Correct 142 ms 93100 KB Output is correct
69 Correct 184 ms 94880 KB Output is correct
70 Correct 231 ms 95156 KB Output is correct
71 Correct 189 ms 92688 KB Output is correct
72 Correct 279 ms 96608 KB Output is correct
73 Correct 274 ms 129708 KB Output is correct
74 Correct 272 ms 130764 KB Output is correct
75 Correct 301 ms 130896 KB Output is correct
76 Correct 128 ms 60100 KB Output is correct
77 Correct 48 ms 48860 KB Output is correct
78 Correct 129 ms 62172 KB Output is correct
79 Correct 65 ms 49652 KB Output is correct
80 Correct 126 ms 54752 KB Output is correct
81 Execution timed out 3044 ms 86968 KB Time limit exceeded
82 Halted 0 ms 0 KB -