Submission #955204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955204	2024-03-29T16:38:27 Z	amine_aroua	Railway Trip 2 (JOI22_ho_t4)	C++17	11 / 100	2000 ms	18644 KB

Main

#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)

// HERE IS THE SOLUTION
vi mxTree , mnTree;
int n;
void build()
{
    while(__builtin_popcount(n) != 1)
        n++;
    mxTree.assign(2*n , 0);
    mnTree.assign(2*n , n + 1);
}
void upd(int node , int L , int R , int l , int  r , int x , bool type)
{
    if(l <= L && R <= r)
    {
        if(!type)
            mxTree[node] = max(mxTree[node] , x);
        else
            mnTree[node] = min(mnTree[node] , x);
        return ;
    }
    if(l > R || L > r)
        return ;
    int mid = (L + R)/2;
    upd(2*node , L , mid , l , r , x ,  type);
    upd(2*node + 1 , mid + 1 , R , l , r , x , type);
}
int getMax(int i)
{
    int ans = i;
    for(int j = (i + n); j>= 1;j/=2)
    {
        ans = max(ans , mxTree[j]);
    }
    return ans;
}
int getMin(int i)
{
    int ans = i;
    for(int j = (i + n); j>= 1;j/=2)
    {
        ans = min(ans , mnTree[j]);
    }
    return ans;
}

signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    int N , K , M;
    cin>>N>>K>>M;
    n = N +1;
    build();
    vector<vi> adj(N + 1);
    forr(i , 1  , N)
    {
        adj[i] = {i , i};
    }
    fore(i , M)
    {
        int A , B;
        cin>>A>>B;
        if(A < B)
        {
            upd(1 , 0 , n - 1 , A , min(B - 1 , A + K - 1) , B , 0);
        }
        else
        {
            upd(1 , 0 , n - 1 , max(B + 1 , A - K + 1) , A , B , 1);
        }
    }
    forr(i , 1 , N)
    {
        adj[i][0] = getMin(i);
        adj[i][1] = getMax(i);
    }
    int Q;
    cin>>Q;
    while(Q--)
    {
        int S , T;
        cin>>S>>T;
        queue<int> q;
        q.push(S);
        vi dist(N + 1 , INF);
        set<int> free;
        forr(i , 1 , N)
            free.insert(i);
        dist[S] = 0;
        while(!q.empty())
        {
            int cur = q.front();
            q.pop();
            if(!free.count(cur))
                continue;
            free.erase(cur);
            if(cur == T)
                break;
            int mn = INF , mx = -INF;
            int mnL , mxR;
            auto it1 = free.lower_bound(adj[cur][0]);
            auto it2 = free.upper_bound(adj[cur][1]);
            for(auto it = it1 ; it!= it2; it++)
            {
                int u = *it;
                if(dist[u] > dist[cur] + 1)
                    dist[u] = dist[cur] + 1;
                if(adj[u][0] < mn)
                {
                    mn = adj[u][0];
                    mnL = u;
                }
                if(adj[u][1] > mx)
                {
                    mx = adj[u][1];
                    mxR = u;
                }
            }
            vector<set<int>::iterator> to_erase;
            for(auto it = it1 ; it!= it2; it++)
            {
                int u = *it;
                if(u == mnL || u == mxR)
                    continue;
                to_erase.pb(it);
            }
            for(auto it : to_erase)
                free.erase(it);
            q.push(mnL);
            q.push(mxR);
        }
        cout<<(dist[T] == INF ? -1 : dist[T])<<nl;
    }
}

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	11 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	11 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	55 ms	15832 KB	Output is correct
2	Correct	53 ms	16468 KB	Output is correct
3	Correct	59 ms	17032 KB	Output is correct
4	Correct	45 ms	16284 KB	Output is correct
5	Correct	110 ms	18340 KB	Output is correct
6	Correct	81 ms	17748 KB	Output is correct
7	Correct	100 ms	18644 KB	Output is correct
8	Correct	68 ms	17100 KB	Output is correct
9	Correct	76 ms	17204 KB	Output is correct
10	Correct	90 ms	17788 KB	Output is correct
11	Correct	86 ms	17828 KB	Output is correct