oj.uz

Submission #595145

# Submission time Handle Problem Language Result Execution time Memory
595145 2022-07-13T11:54:56 Z dxz05 Railway Trip 2 (JOI22_ho_t4) C++14
0 / 100
 2000 ms 3396 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 5555;

int lf[N], rg[N];

ll f(ll x){
    return (x % 2 == 0 ? x / 2 : x * 3 + 1);
}

int dist(int x, int y){
    int cnt = 0;

    if (x <= y) {
        while (x < y) {
            if (x == rg[x]) return INF;
            x = rg[x];
            cnt++;
        }
    } else {
        while (x > y) {
            if (x == lf[x]) return INF;
            x = lf[x];
            cnt++;
        }
    }

    return cnt;
}

void solve(int TC) {
    int n, k, m;
    cin >> n >> k >> m;

    iota(lf + 1, lf + n + 1, 1);
    iota(rg + 1, rg + n + 1, 1);

    while (m--){
        int a, b;
        cin >> a >> b;

        if (a < b){
            for (int i = a; i < min(a + k, b); i++){
                rg[i] = max(rg[i], b);
            }
        } else {
            for (int i = a; i > max(a - k, b); i--){
                lf[i] = min(lf[i], b);
            }
        }

    }

    int q;
    cin >> q;

    while (q--){
        int s, t;
        cin >> s >> t;

        int ans = dist(s, t);
        for (int i = 1; i <= n; i++){
            ans = min(ans, dist(s, i) + dist(i, t));
        }

        if (ans >= INF) ans = -1;
        cout << ans << endl;
    }

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2053 ms 2112 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 2067 ms 3396 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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