oj.uz

Submission #1061598

# Submission time Handle Problem Language Result Execution time Memory
1061598 2024-08-16T11:07:26 Z new_acc Escape Route 2 (JOI24_escape2) C++14
23 / 100
 2650 ms 641840 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;
        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 161 ms 517716 KB Output is correct
2 Correct 219 ms 520536 KB Output is correct
3 Correct 349 ms 535376 KB Output is correct
4 Correct 441 ms 541448 KB Output is correct
5 Correct 393 ms 536604 KB Output is correct
6 Correct 484 ms 541088 KB Output is correct
7 Correct 466 ms 541056 KB Output is correct
8 Correct 407 ms 535124 KB Output is correct
9 Correct 509 ms 541060 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 517716 KB Output is correct
2 Correct 219 ms 520536 KB Output is correct
3 Correct 349 ms 535376 KB Output is correct
4 Correct 441 ms 541448 KB Output is correct
5 Correct 393 ms 536604 KB Output is correct
6 Correct 484 ms 541088 KB Output is correct
7 Correct 466 ms 541056 KB Output is correct
8 Correct 407 ms 535124 KB Output is correct
9 Correct 509 ms 541060 KB Output is correct
10 Correct 184 ms 517716 KB Output is correct
11 Correct 385 ms 527188 KB Output is correct
12 Correct 375 ms 527224 KB Output is correct
13 Correct 375 ms 526944 KB Output is correct
14 Correct 382 ms 526944 KB Output is correct
15 Incorrect 436 ms 533680 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 517716 KB Output is correct
2 Correct 219 ms 520536 KB Output is correct
3 Correct 349 ms 535376 KB Output is correct
4 Correct 441 ms 541448 KB Output is correct
5 Correct 393 ms 536604 KB Output is correct
6 Correct 484 ms 541088 KB Output is correct
7 Correct 466 ms 541056 KB Output is correct
8 Correct 407 ms 535124 KB Output is correct
9 Correct 509 ms 541060 KB Output is correct
10 Correct 756 ms 612176 KB Output is correct
11 Correct 1224 ms 640596 KB Output is correct
12 Correct 1169 ms 640476 KB Output is correct
13 Correct 971 ms 636168 KB Output is correct
14 Correct 1119 ms 641748 KB Output is correct
15 Correct 1031 ms 641764 KB Output is correct
16 Correct 730 ms 613348 KB Output is correct
17 Correct 1035 ms 641840 KB Output is correct
18 Correct 537 ms 615216 KB Output is correct
19 Correct 492 ms 614504 KB Output is correct
20 Correct 630 ms 615360 KB Output is correct
21 Correct 557 ms 615504 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 517716 KB Output is correct
2 Correct 219 ms 520536 KB Output is correct
3 Correct 349 ms 535376 KB Output is correct
4 Correct 441 ms 541448 KB Output is correct
5 Correct 393 ms 536604 KB Output is correct
6 Correct 484 ms 541088 KB Output is correct
7 Correct 466 ms 541056 KB Output is correct
8 Correct 407 ms 535124 KB Output is correct
9 Correct 509 ms 541060 KB Output is correct
10 Correct 184 ms 517716 KB Output is correct
11 Correct 385 ms 527188 KB Output is correct
12 Correct 375 ms 527224 KB Output is correct
13 Correct 375 ms 526944 KB Output is correct
14 Correct 382 ms 526944 KB Output is correct
15 Incorrect 436 ms 533680 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 517716 KB Output is correct
2 Correct 172 ms 517748 KB Output is correct
3 Correct 2465 ms 556508 KB Output is correct
4 Correct 2650 ms 556516 KB Output is correct
5 Correct 2412 ms 556548 KB Output is correct
6 Correct 2326 ms 556624 KB Output is correct
7 Correct 2523 ms 556400 KB Output is correct
8 Incorrect 339 ms 537168 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 517716 KB Output is correct
2 Correct 219 ms 520536 KB Output is correct
3 Correct 349 ms 535376 KB Output is correct
4 Correct 441 ms 541448 KB Output is correct
5 Correct 393 ms 536604 KB Output is correct
6 Correct 484 ms 541088 KB Output is correct
7 Correct 466 ms 541056 KB Output is correct
8 Correct 407 ms 535124 KB Output is correct
9 Correct 509 ms 541060 KB Output is correct
10 Correct 184 ms 517716 KB Output is correct
11 Correct 385 ms 527188 KB Output is correct
12 Correct 375 ms 527224 KB Output is correct
13 Correct 375 ms 526944 KB Output is correct
14 Correct 382 ms 526944 KB Output is correct
15 Incorrect 436 ms 533680 KB Output isn't correct
16 Halted 0 ms 0 KB -