oj.uz

Submission #810246

# Submission time Handle Problem Language Result Execution time Memory
810246 2023-08-06T07:30:16 Z vjudge1 Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
 2000 ms 136744 KB 

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll  d[N] = {} , a[N] = {}, dp[N] ,  b[N] , c[N];

struct edge{
ll a , b, c;
};

vector<pair<int,int>>v[N] , v1 , v2;
vector<edge>vc;
multiset<ll>st[N][2] , st1[N][2];
void solve(){
    ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>k;
    cin>>m;
    for(i = 1; i <= n; i++)
        a[i] = b[i] = i;
    for(i = 1; i <= m; i++){
        cin>>l>>r;
        if(l > r){
            x = max(l - k + 1 , r + 1);
           // for(j = l ; j >= x; j--)
           //     a[j] = min(a[j] , r);
            st[l][0].insert(r);
            st[x][1].insert(r);
        }else {
            x = min(l + k - 1 , r - 1);
            st1[l][0].insert(r);
            st1[x][1].insert(r);
            //for(j = l; j <= x; j++)
            //    b[j] = max(b[j] , r);
            vc.pb({l , x , r});
        }
    }
    multiset<ll>v;
    for(i = n;  i >= 1; i--){
        for(auto it : st[i][0])
            v.insert(it);
        if(v.size())
        a[i] = min(a[i] , *v.begin());
        for(auto it : st[i][1])
            v.erase(v.find(it));
    }
    v.clear();
    for(i = 1;  i <= n; i++){
        for(auto it : st1[i][0])
            v.insert(it);
        if(v.size())
            b[i] = max(b[i] , *v.rbegin());
        for(auto it : st1[i][1])
            v.erase(v.find(it));
    }
    set<ll>st;
    cin>>q;
    while(q--){
        cin>>x>>y;
        set<ll>st;
        for(i = 1; i <= n; i++){
            d[i] = 1e9;
            st.insert(i);
        }
        queue<int>qq;
        qq.push(x);
        st.erase(x);
        d[x] = 0;
        while(!qq.empty()){
            i=  qq.front();
            qq.pop();
            auto it = st.lower_bound(i);
            while(st.size() && it != st.end() && *it <= b[i]){
                d[*it] = d[i] + 1;
                qq.push(*it);
                st.erase(it);
                it = st.lower_bound(i);
            }
            while(st.size() && *st.begin() < i){
                auto it = st.lower_bound(i);
                it--;
                if(*it < a[i])
                    break;
                d[*it] = d[i] + 1;
                qq.push(*it);
                st.erase(it);
            }
        }
        if(d[y] == 1e9)
            d[y] = -1;
        cout<<d[y]<<"\n";
    }

}

int main(){

     TL;
  /*   #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:36:16: warning: unused variable 'j' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
Main.cpp:36:26: warning: unused variable 'z' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
Main.cpp:36:29: warning: unused variable 's' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                             ^
Main.cpp:36:37: warning: unused variable 'f' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
Main.cpp:36:61: warning: unused variable 'mn' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                             ^~
Main.cpp:36:74: warning: unused variable 'mx' [-Wunused-variable]
   36 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                          ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 106068 KB Output is correct
2 Correct 52 ms 105968 KB Output is correct
3 Correct 45 ms 106060 KB Output is correct
4 Correct 58 ms 106076 KB Output is correct
5 Correct 57 ms 106052 KB Output is correct
6 Correct 51 ms 106068 KB Output is correct
7 Correct 51 ms 106048 KB Output is correct
8 Correct 44 ms 105992 KB Output is correct
9 Correct 49 ms 105956 KB Output is correct
10 Correct 44 ms 105888 KB Output is correct
11 Correct 50 ms 106024 KB Output is correct
12 Correct 52 ms 106188 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 106068 KB Output is correct
2 Correct 52 ms 105968 KB Output is correct
3 Correct 45 ms 106060 KB Output is correct
4 Correct 58 ms 106076 KB Output is correct
5 Correct 57 ms 106052 KB Output is correct
6 Correct 51 ms 106068 KB Output is correct
7 Correct 51 ms 106048 KB Output is correct
8 Correct 44 ms 105992 KB Output is correct
9 Correct 49 ms 105956 KB Output is correct
10 Correct 44 ms 105888 KB Output is correct
11 Correct 50 ms 106024 KB Output is correct
12 Correct 52 ms 106188 KB Output is correct
13 Correct 470 ms 106324 KB Output is correct
14 Correct 449 ms 106412 KB Output is correct
15 Correct 44 ms 106316 KB Output is correct
16 Correct 356 ms 106376 KB Output is correct
17 Correct 402 ms 106496 KB Output is correct
18 Correct 366 ms 106388 KB Output is correct
19 Correct 378 ms 106376 KB Output is correct
20 Correct 358 ms 106336 KB Output is correct
21 Correct 48 ms 106316 KB Output is correct
22 Correct 398 ms 106380 KB Output is correct
23 Correct 374 ms 106376 KB Output is correct
24 Correct 296 ms 106456 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 121420 KB Output is correct
2 Correct 111 ms 121648 KB Output is correct
3 Correct 119 ms 123252 KB Output is correct
4 Correct 130 ms 121112 KB Output is correct
5 Correct 267 ms 134292 KB Output is correct
6 Correct 211 ms 136396 KB Output is correct
7 Correct 246 ms 136240 KB Output is correct
8 Correct 183 ms 124800 KB Output is correct
9 Correct 151 ms 124832 KB Output is correct
10 Correct 214 ms 136476 KB Output is correct
11 Correct 224 ms 136420 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 121684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 136744 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 106068 KB Output is correct
2 Correct 52 ms 105968 KB Output is correct
3 Correct 45 ms 106060 KB Output is correct
4 Correct 58 ms 106076 KB Output is correct
5 Correct 57 ms 106052 KB Output is correct
6 Correct 51 ms 106068 KB Output is correct
7 Correct 51 ms 106048 KB Output is correct
8 Correct 44 ms 105992 KB Output is correct
9 Correct 49 ms 105956 KB Output is correct
10 Correct 44 ms 105888 KB Output is correct
11 Correct 50 ms 106024 KB Output is correct
12 Correct 52 ms 106188 KB Output is correct
13 Correct 470 ms 106324 KB Output is correct
14 Correct 449 ms 106412 KB Output is correct
15 Correct 44 ms 106316 KB Output is correct
16 Correct 356 ms 106376 KB Output is correct
17 Correct 402 ms 106496 KB Output is correct
18 Correct 366 ms 106388 KB Output is correct
19 Correct 378 ms 106376 KB Output is correct
20 Correct 358 ms 106336 KB Output is correct
21 Correct 48 ms 106316 KB Output is correct
22 Correct 398 ms 106380 KB Output is correct
23 Correct 374 ms 106376 KB Output is correct
24 Correct 296 ms 106456 KB Output is correct
25 Correct 121 ms 121420 KB Output is correct
26 Correct 111 ms 121648 KB Output is correct
27 Correct 119 ms 123252 KB Output is correct
28 Correct 130 ms 121112 KB Output is correct
29 Correct 267 ms 134292 KB Output is correct
30 Correct 211 ms 136396 KB Output is correct
31 Correct 246 ms 136240 KB Output is correct
32 Correct 183 ms 124800 KB Output is correct
33 Correct 151 ms 124832 KB Output is correct
34 Correct 214 ms 136476 KB Output is correct
35 Correct 224 ms 136420 KB Output is correct
36 Execution timed out 2068 ms 121684 KB Time limit exceeded
37 Halted 0 ms 0 KB -