oj.uz

Submission #955192

# Submission time Handle Problem Language Result Execution time Memory
955192 2024-03-29T15:57:25 Z amine_aroua Railway Trip 2 (JOI22_ho_t4) C++17
16 / 100
 2000 ms 11000 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;
    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;
    }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1468 ms 624 KB Output is correct
14 Correct 539 ms 628 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 11 ms 628 KB Output is correct
17 Correct 17 ms 604 KB Output is correct
18 Correct 10 ms 604 KB Output is correct
19 Correct 15 ms 640 KB Output is correct
20 Correct 26 ms 644 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 33 ms 604 KB Output is correct
23 Correct 27 ms 604 KB Output is correct
24 Correct 9 ms 600 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1979 ms 10836 KB Output is correct
2 Correct 853 ms 10836 KB Output is correct
3 Execution timed out 2054 ms 10580 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2054 ms 10836 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 2021 ms 11000 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1468 ms 624 KB Output is correct
14 Correct 539 ms 628 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 11 ms 628 KB Output is correct
17 Correct 17 ms 604 KB Output is correct
18 Correct 10 ms 604 KB Output is correct
19 Correct 15 ms 640 KB Output is correct
20 Correct 26 ms 644 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 33 ms 604 KB Output is correct
23 Correct 27 ms 604 KB Output is correct
24 Correct 9 ms 600 KB Output is correct
25 Correct 1979 ms 10836 KB Output is correct
26 Correct 853 ms 10836 KB Output is correct
27 Execution timed out 2054 ms 10580 KB Time limit exceeded
28 Halted 0 ms 0 KB -