oj.uz

답안 #810319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810319 2023-08-06T08:25:53 Z vjudge1 Railway Trip 2 (JOI22_ho_t4) C++17
8 / 100
 29 ms 732 KB 
#ifdef Home
#define _GLIBCXX_DEBUG
#endif // Home

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

int mtx[333][333];

main() {
#ifdef Home
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // Home
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, m;
    cin >> n >> k >> m;
    for(int l, r; m --> 0;) {
        cin >> l >> r;
        if(l < r) {
            for(int i = l; i < min(l + k, r); ++ i) {
                for(int j = i + 1; j <= r; ++ j) {
                    mtx[i][j] = 1;
                }
            }
        } else {
            for(int i = l; i > max(r, l - k); -- i) {
                for(int j = i - 1; j >= r; -- j) {
                    mtx[i][j] = 1;
                }
            }
        }
    }
    for(int i = 1; i <= n; ++ i) {
        for(int j = 1; j <= n; ++ j) {
            mtx[i][j] = (i == j || mtx[i][j]) ? mtx[i][j] : 333;
        }
    }
    for(int k = 1; k <= n; ++ k) {
        for(int i = 1; i <= n; ++ i) {
            for(int j = 1; j <= n; ++ j) {
                mtx[i][j] = min(mtx[i][j], mtx[i][k] + mtx[k][j]);
            }
        }
    }

    int q;
    cin >> q;
    for(int s, t; q --> 0;) {
        cin >> s >> t;
        cout << (mtx[s][t] == 333 ? -1 : mtx[s][t]) << '\n';
    }
}

Compilation message

Main.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main() {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 596 KB Output is correct
2 Correct 23 ms 712 KB Output is correct
3 Correct 23 ms 596 KB Output is correct
4 Correct 23 ms 724 KB Output is correct
5 Correct 23 ms 728 KB Output is correct
6 Correct 29 ms 732 KB Output is correct
7 Correct 26 ms 596 KB Output is correct
8 Correct 24 ms 596 KB Output is correct
9 Correct 24 ms 724 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 23 ms 720 KB Output is correct
12 Correct 22 ms 596 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 596 KB Output is correct
2 Correct 23 ms 712 KB Output is correct
3 Correct 23 ms 596 KB Output is correct
4 Correct 23 ms 724 KB Output is correct
5 Correct 23 ms 728 KB Output is correct
6 Correct 29 ms 732 KB Output is correct
7 Correct 26 ms 596 KB Output is correct
8 Correct 24 ms 596 KB Output is correct
9 Correct 24 ms 724 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 23 ms 720 KB Output is correct
12 Correct 22 ms 596 KB Output is correct
13 Runtime error 1 ms 468 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 596 KB Output is correct
2 Correct 23 ms 712 KB Output is correct
3 Correct 23 ms 596 KB Output is correct
4 Correct 23 ms 724 KB Output is correct
5 Correct 23 ms 728 KB Output is correct
6 Correct 29 ms 732 KB Output is correct
7 Correct 26 ms 596 KB Output is correct
8 Correct 24 ms 596 KB Output is correct
9 Correct 24 ms 724 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 23 ms 720 KB Output is correct
12 Correct 22 ms 596 KB Output is correct
13 Runtime error 1 ms 468 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -