oj.uz

답안 #745837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745837 2023-05-21T08:37:16 Z vjudge1 Event Hopping (BOI22_events) C++14
10 / 100
 1500 ms 30332 KB 
#include <bits/stdc++.h>

using namespace std;



int main(){

    int n, q;
    cin >> n >> q;
    vector<pair<int, int> > inter(n);


    for (int i = 0; i < n; i++){
        cin >> inter[i].first >> inter[i].second;
    }
    vector<vector<int> > graph(n);

    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if (i == j) continue;
            if (inter[i].second <= inter[j].second && inter[i].second >= inter[j].first){
                graph[i].push_back(j);
            }
        }
    }

    // for (int i = 0; i < n; i++){
    //     for (int x : graph[i]) cout << x << " ";
    //     cout << endl;
    // }

    for (int i = 0; i < q; i++){
        int s, e;
        cin >> s >> e;
        s--, e--;

        queue<int> q;
        q.push(s);
        vector<int> tav(n, -1); 
        tav [s] = 0;
        while(!q.empty()){
            int pos = q.front();
            q.pop();
            for (int x : graph[pos]){
                if (tav[x] == -1){
                    tav[x] = tav[pos] + 1;
                    q.push(x);
                }
            }
        }
        if (tav[e] == -1) {
            cout << "impossible" << endl;
        }
        else cout << tav[e] << endl;
    }


    return 0;
}

/*

5 2
1 3
2 4
4 7
7 9
3 7
1 4
3 2

*/

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1556 ms 3820 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 12 ms 1108 KB Output is correct
7 Correct 19 ms 1944 KB Output is correct
8 Correct 20 ms 2900 KB Output is correct
9 Correct 84 ms 4308 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 12 ms 1108 KB Output is correct
7 Correct 19 ms 1944 KB Output is correct
8 Correct 20 ms 2900 KB Output is correct
9 Correct 84 ms 4308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 12 ms 1188 KB Output is correct
16 Correct 19 ms 1876 KB Output is correct
17 Correct 20 ms 3000 KB Output is correct
18 Correct 82 ms 4280 KB Output is correct
19 Execution timed out 1579 ms 30332 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 12 ms 1108 KB Output is correct
7 Correct 19 ms 1944 KB Output is correct
8 Correct 20 ms 2900 KB Output is correct
9 Correct 84 ms 4308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 7 ms 340 KB Output is correct
15 Correct 10 ms 1108 KB Output is correct
16 Correct 19 ms 1876 KB Output is correct
17 Correct 20 ms 2900 KB Output is correct
18 Correct 79 ms 4308 KB Output is correct
19 Execution timed out 1575 ms 5544 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1548 ms 3716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1556 ms 3820 KB Time limit exceeded
3 Halted 0 ms 0 KB -