oj.uz

Submission #955215

# Submission time Handle Problem Language Result Execution time Memory
955215 2024-03-29T17:20:44 Z amine_aroua Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
 2000 ms 16876 KB 
#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;
    if(K == 1 && Q != 1)
    {
        while(Q--)
        {
            int S , T;
            cin>>S>>T;
            queue<int> q;
            q.push(S);
            vi dist(N + 1 , INF);
            vector<bool> vis(N + 1 , 0);
            dist[S] = 0;
            while(!q.empty())
            {
                int cur = q.front();
                q.pop();
                if(vis[cur])
                    continue;
                vis[cur] = 1;
                if(cur == T)
                    break;
                int mn = INF , mx = -INF;
                int mnL , mxR;
                for(int u = adj[cur][0] ; u <= adj[cur][1]; u++)
                {
                    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;
                    }
                }
                q.push(mnL);
                q.push(mxR);
            }
            cout<<(dist[T] == INF ? -1 : dist[T])<<nl;
        }
    }
    else
    {
        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;
                if(cur == T)
                    break;
                int mn = INF , mx = -INF;
                int mnL = -1, mxR = -1;
                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<int> to_erase;
                for(auto it = it1 ; it!= it2; it++)
                {
                    int u = *it;
                    if(u == mnL || u == mxR)
                        continue;
                    to_erase.pb(u);
                }
                for(auto it : to_erase)
                    free.erase(it);
                if(mnL != -1)
                    q.push(mnL);
                if(mxR != -1)
                    q.push(mxR);
                free.erase(cur);
            }
            cout<<(dist[T] >= INF ? -1 : dist[T])<<nl;
        }
    }

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 11 ms 348 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 11 ms 348 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 1803 ms 632 KB Output is correct
14 Correct 638 ms 620 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 374 ms 728 KB Output is correct
17 Correct 16 ms 600 KB Output is correct
18 Correct 423 ms 1000 KB Output is correct
19 Correct 465 ms 604 KB Output is correct
20 Correct 440 ms 604 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 444 ms 604 KB Output is correct
23 Correct 418 ms 600 KB Output is correct
24 Correct 338 ms 848 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 15884 KB Output is correct
2 Correct 53 ms 15440 KB Output is correct
3 Correct 71 ms 16060 KB Output is correct
4 Correct 50 ms 15428 KB Output is correct
5 Correct 126 ms 16060 KB Output is correct
6 Correct 80 ms 15428 KB Output is correct
7 Correct 108 ms 16600 KB Output is correct
8 Correct 71 ms 15996 KB Output is correct
9 Correct 71 ms 16088 KB Output is correct
10 Correct 91 ms 15424 KB Output is correct
11 Correct 98 ms 15412 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2055 ms 16876 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 2094 ms 16436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 11 ms 348 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 1803 ms 632 KB Output is correct
14 Correct 638 ms 620 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 374 ms 728 KB Output is correct
17 Correct 16 ms 600 KB Output is correct
18 Correct 423 ms 1000 KB Output is correct
19 Correct 465 ms 604 KB Output is correct
20 Correct 440 ms 604 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 444 ms 604 KB Output is correct
23 Correct 418 ms 600 KB Output is correct
24 Correct 338 ms 848 KB Output is correct
25 Correct 60 ms 15884 KB Output is correct
26 Correct 53 ms 15440 KB Output is correct
27 Correct 71 ms 16060 KB Output is correct
28 Correct 50 ms 15428 KB Output is correct
29 Correct 126 ms 16060 KB Output is correct
30 Correct 80 ms 15428 KB Output is correct
31 Correct 108 ms 16600 KB Output is correct
32 Correct 71 ms 15996 KB Output is correct
33 Correct 71 ms 16088 KB Output is correct
34 Correct 91 ms 15424 KB Output is correct
35 Correct 98 ms 15412 KB Output is correct
36 Execution timed out 2055 ms 16876 KB Time limit exceeded
37 Halted 0 ms 0 KB -