oj.uz

Submission #955183

# Submission time Handle Problem Language Result Execution time Memory
955183 2024-03-29T15:24:19 Z amine_aroua Railway Trip 2 (JOI22_ho_t4) C++17
16 / 100
 2000 ms 7812 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

signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    int N , K , M;
    cin>>N>>K>>M;
    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)
        {
            forr(j , A , min(B-1 , A + K - 1))
            {
                adj[j][1] = max(B , adj[j][1]);
            }
        }
        else
        {
            forn(j , A , max(B + 1 , A - K + 1))
            {
                adj[j][0] = min(adj[j][0] , B);
            }
        }
    }
    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 0 ms 348 KB Output is correct
4 Correct 1 ms 476 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 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 0 ms 348 KB Output is correct
4 Correct 1 ms 476 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1560 ms 816 KB Output is correct
14 Correct 516 ms 560 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 584 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 16 ms 348 KB Output is correct
20 Correct 26 ms 564 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 24 ms 604 KB Output is correct
23 Correct 27 ms 616 KB Output is correct
24 Correct 8 ms 604 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1835 ms 6748 KB Output is correct
2 Correct 832 ms 7640 KB Output is correct
3 Execution timed out 2052 ms 7812 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 2016 ms 5720 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 2050 ms 5724 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 0 ms 348 KB Output is correct
4 Correct 1 ms 476 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1560 ms 816 KB Output is correct
14 Correct 516 ms 560 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 11 ms 584 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 12 ms 348 KB Output is correct
19 Correct 16 ms 348 KB Output is correct
20 Correct 26 ms 564 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 24 ms 604 KB Output is correct
23 Correct 27 ms 616 KB Output is correct
24 Correct 8 ms 604 KB Output is correct
25 Correct 1835 ms 6748 KB Output is correct
26 Correct 832 ms 7640 KB Output is correct
27 Execution timed out 2052 ms 7812 KB Time limit exceeded
28 Halted 0 ms 0 KB -