oj.uz

Submission #864121

# Submission time Handle Problem Language Result Execution time Memory
864121 2023-10-22T05:48:02 Z prairie2022 Railway Trip 2 (JOI22_ho_t4) C++17
27 / 100
 2000 ms 10700 KB 
#include<bits/stdc++.h>
typedef long long ll;
#define fastio cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
using namespace std;
 
#define pii pair<int, int>
#define F first 
#define S second
 
inline bool between(int b, int a, int c){
    if(a<=b && b<=c) return 1;
    if(a>=b && b>=c) return 1;
    return 0;
}
 
int k;
inline int near(int s, pii p){
    if(between(s, p.F, p.S)){
        if(abs(s-p.F)<k) return s;
        if(p.F<s) return p.F+k-1;
        if(p.F>s) return p.F-k+1;
    }
    if(between(p.F, s, p.S)) return p.F;
    return 0;
}
 
int main(){
    fastio
    int n, m;
    cin >> n >> k >> m;
    vector<pii> rail(m);
    for(int i=0; i<m; i++)
        cin >> rail[i].F >> rail[i].S;
    int q, s, t;
    for(cin >> q; q; q--){
        cin >> s >> t;
        vector<vector<int>> way(n+1);
        for(int i=0; i<m; i++)
            way[near(s, rail[i])].push_back(rail[i].S);
        vector<int> dp(n+1, -1);
        dp[s] = 0;
        int l = s, r = s;
        queue<int> qu;
        for(qu.push(s); !qu.empty() && qu.front()!=t; qu.pop()){
            //cout << qu.front() << " : ";
            for(const int &w: way[qu.front()]){
                //cout << w << ' ';
                if(w>r){
                    for(int i=r+1; i<=w; i++){
                        dp[i] = dp[qu.front()]+1;
                        qu.push(i);
                    }
                    r = w;
                }
                else if(w<l){
                    for(int i=l-1; i>=w; i--){
                        dp[i] = dp[qu.front()]+1;
                        qu.push(i);
                    }
                    l = w;
                }
            }
            //cout << '\n';
        }
        cout << dp[t] << '\n';
    }
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 5 ms 484 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 484 KB Output is correct
7 Correct 3 ms 484 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 4 ms 484 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 187 ms 604 KB Output is correct
14 Correct 149 ms 588 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 154 ms 604 KB Output is correct
17 Correct 140 ms 1100 KB Output is correct
18 Correct 122 ms 604 KB Output is correct
19 Correct 154 ms 348 KB Output is correct
20 Correct 141 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 160 ms 604 KB Output is correct
23 Correct 150 ms 600 KB Output is correct
24 Correct 139 ms 584 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6864 KB Output is correct
2 Correct 15 ms 7000 KB Output is correct
3 Correct 18 ms 7772 KB Output is correct
4 Correct 14 ms 6796 KB Output is correct
5 Correct 31 ms 9176 KB Output is correct
6 Correct 31 ms 10448 KB Output is correct
7 Correct 30 ms 10700 KB Output is correct
8 Correct 17 ms 6604 KB Output is correct
9 Correct 17 ms 6872 KB Output is correct
10 Correct 32 ms 9296 KB Output is correct
11 Correct 35 ms 9676 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2043 ms 7180 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 10608 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 348 KB Output is correct
2 Correct 5 ms 484 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 484 KB Output is correct
7 Correct 3 ms 484 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 4 ms 484 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 187 ms 604 KB Output is correct
14 Correct 149 ms 588 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 154 ms 604 KB Output is correct
17 Correct 140 ms 1100 KB Output is correct
18 Correct 122 ms 604 KB Output is correct
19 Correct 154 ms 348 KB Output is correct
20 Correct 141 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 160 ms 604 KB Output is correct
23 Correct 150 ms 600 KB Output is correct
24 Correct 139 ms 584 KB Output is correct
25 Correct 15 ms 6864 KB Output is correct
26 Correct 15 ms 7000 KB Output is correct
27 Correct 18 ms 7772 KB Output is correct
28 Correct 14 ms 6796 KB Output is correct
29 Correct 31 ms 9176 KB Output is correct
30 Correct 31 ms 10448 KB Output is correct
31 Correct 30 ms 10700 KB Output is correct
32 Correct 17 ms 6604 KB Output is correct
33 Correct 17 ms 6872 KB Output is correct
34 Correct 32 ms 9296 KB Output is correct
35 Correct 35 ms 9676 KB Output is correct
36 Execution timed out 2043 ms 7180 KB Time limit exceeded
37 Halted 0 ms 0 KB -