Submission #766048

#	Time	Username	Problem	Language	Result	Execution time	Memory
766048		sysia	Railway Trip 2 (JOI22_ho_t4)	C++17	0 / 100	2079 ms	524288 KiB

Main

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, k; cin >> n >> k;
    vector<vector<int>>g(n+1);
    int m; cin >> m;
    while (m--){
        int a, b; cin >> a >> b;
        if (a < b){
            for (int i = a; i<=min(b-1, a + k-1); i++){
                for (int j = i+1; j<=b; j++){
                    g[i].emplace_back(j);
                }
            }
        } else {
            swap(a, b);
            for (int i = b; i>=max(a+1, b-k+1); i--){
                for (int j = i-1; j>=a; j--){
                    g[i].emplace_back(j);
                }
            }
        }
    }

    auto bfs = [&](int from, int to){
        queue<int>q;
        vector<int>dist(n+1, oo);
        dist[from] = 0;
        q.push(from);
        while (q.size()){
            int v = q.front(); q.pop();
            for (auto x: g[v]){
                if (dist[x] == oo){
                    dist[x] = dist[v]+1;
                    q.push(x);
                }
            }
        }
        return dist[to] == oo ? -1 : dist[to];
    };
    int q; cin >> q;
    while (q--){
        int a, b; cin >> a >> b;
        cout << bfs(a, b) << "\n";
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 25
• Subtask 5: 0 / 35
• Subtask 6: 0 / 13