oj.uz

Submission #810238

# Submission time Handle Problem Language Result Execution time Memory
810238 2023-08-06T07:23:07 Z vjudge1 Railway Trip 2 (JOI22_ho_t4) C++17
16 / 100
 2000 ms 21476 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;
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);
        }else {
            x = min(l + k - 1 , r - 1);
            for(j = l; j <= x; j++)
                b[j] = max(b[j] , r);
            vc.pb({l , x , r});
        }
    }
    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:35:26: warning: unused variable 'z' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
Main.cpp:35:29: warning: unused variable 's' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                             ^
Main.cpp:35:37: warning: unused variable 'f' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
Main.cpp:35:61: warning: unused variable 'mn' [-Wunused-variable]
   35 |     ll q , i , j , m ,n, z ,s = 0 , f , l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                             ^~
Main.cpp:35:74: warning: unused variable 'mx' [-Wunused-variable]
   35 |     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 14 ms 12116 KB Output is correct
2 Correct 16 ms 12136 KB Output is correct
3 Correct 6 ms 12076 KB Output is correct
4 Correct 13 ms 12140 KB Output is correct
5 Correct 14 ms 12116 KB Output is correct
6 Correct 14 ms 12116 KB Output is correct
7 Correct 11 ms 12076 KB Output is correct
8 Correct 6 ms 12104 KB Output is correct
9 Correct 14 ms 12132 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 12 ms 12068 KB Output is correct
12 Correct 10 ms 12132 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12116 KB Output is correct
2 Correct 16 ms 12136 KB Output is correct
3 Correct 6 ms 12076 KB Output is correct
4 Correct 13 ms 12140 KB Output is correct
5 Correct 14 ms 12116 KB Output is correct
6 Correct 14 ms 12116 KB Output is correct
7 Correct 11 ms 12076 KB Output is correct
8 Correct 6 ms 12104 KB Output is correct
9 Correct 14 ms 12132 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 12 ms 12068 KB Output is correct
12 Correct 10 ms 12132 KB Output is correct
13 Correct 448 ms 12296 KB Output is correct
14 Correct 428 ms 12344 KB Output is correct
15 Correct 7 ms 12208 KB Output is correct
16 Correct 364 ms 12288 KB Output is correct
17 Correct 367 ms 12280 KB Output is correct
18 Correct 454 ms 12284 KB Output is correct
19 Correct 399 ms 12284 KB Output is correct
20 Correct 392 ms 12244 KB Output is correct
21 Correct 7 ms 12244 KB Output is correct
22 Correct 440 ms 12292 KB Output is correct
23 Correct 300 ms 12244 KB Output is correct
24 Correct 252 ms 12280 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 20828 KB Output is correct
2 Correct 42 ms 21148 KB Output is correct
3 Correct 44 ms 21440 KB Output is correct
4 Correct 39 ms 21180 KB Output is correct
5 Execution timed out 2071 ms 18416 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 21416 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 2062 ms 21476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12116 KB Output is correct
2 Correct 16 ms 12136 KB Output is correct
3 Correct 6 ms 12076 KB Output is correct
4 Correct 13 ms 12140 KB Output is correct
5 Correct 14 ms 12116 KB Output is correct
6 Correct 14 ms 12116 KB Output is correct
7 Correct 11 ms 12076 KB Output is correct
8 Correct 6 ms 12104 KB Output is correct
9 Correct 14 ms 12132 KB Output is correct
10 Correct 7 ms 12116 KB Output is correct
11 Correct 12 ms 12068 KB Output is correct
12 Correct 10 ms 12132 KB Output is correct
13 Correct 448 ms 12296 KB Output is correct
14 Correct 428 ms 12344 KB Output is correct
15 Correct 7 ms 12208 KB Output is correct
16 Correct 364 ms 12288 KB Output is correct
17 Correct 367 ms 12280 KB Output is correct
18 Correct 454 ms 12284 KB Output is correct
19 Correct 399 ms 12284 KB Output is correct
20 Correct 392 ms 12244 KB Output is correct
21 Correct 7 ms 12244 KB Output is correct
22 Correct 440 ms 12292 KB Output is correct
23 Correct 300 ms 12244 KB Output is correct
24 Correct 252 ms 12280 KB Output is correct
25 Correct 44 ms 20828 KB Output is correct
26 Correct 42 ms 21148 KB Output is correct
27 Correct 44 ms 21440 KB Output is correct
28 Correct 39 ms 21180 KB Output is correct
29 Execution timed out 2071 ms 18416 KB Time limit exceeded
30 Halted 0 ms 0 KB -