oj.uz

답안 #714228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714228 2023-03-24T06:46:39 Z vjudge1 Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 30412 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int n, q;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    vector<int>g[n + 1];
    pair<int, int>events[n + 1];
    for(int i = 1;i <= n;++i){
        cin >> events[i].first >> events[i].second;
    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= n;++j){
            if(i == j)continue;
            if(events[i].second >= events[j].first && events[i].second <= events[j].second){
                g[i].push_back(j);
            }
        }
    }
//    for(int i = 1;i <= n;++i){
//        cout << i << ": ";
//        for(int j : g[i]){
//            cout << j << " ";
//        }
//        cout << '\n';
//    }
    while(q--){
        int u, v;
        cin >> u >> v;
        queue<int>que;
        que.push(u);
        int dist[n + 1];
        for(int i = 1;i <= n;++i)dist[i] = -1;
        dist[u] = 0;
        while(!que.empty()){
            int cur = que.front();
            que.pop();
            for(int v : g[cur]){
                if(dist[v] == -1){
                    dist[v] = dist[cur] + 1;
                    que.push(v);
                }
            }
        }
        if(dist[v] == -1)cout << "impossible\n";
        else cout << dist[v] << '\n';
    }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1579 ms 3616 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 1 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 5 ms 356 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 20 ms 1976 KB Output is correct
8 Correct 24 ms 2900 KB Output is correct
9 Correct 93 ms 4364 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 5 ms 356 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 20 ms 1976 KB Output is correct
8 Correct 24 ms 2900 KB Output is correct
9 Correct 93 ms 4364 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 360 KB Output is correct
13 Correct 6 ms 372 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 10 ms 1108 KB Output is correct
16 Correct 27 ms 1972 KB Output is correct
17 Correct 21 ms 2900 KB Output is correct
18 Correct 95 ms 4356 KB Output is correct
19 Execution timed out 1578 ms 30412 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 1 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 5 ms 356 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 20 ms 1976 KB Output is correct
8 Correct 24 ms 2900 KB Output is correct
9 Correct 93 ms 4364 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 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 9 ms 1108 KB Output is correct
16 Correct 18 ms 1972 KB Output is correct
17 Correct 21 ms 2900 KB Output is correct
18 Correct 106 ms 4356 KB Output is correct
19 Execution timed out 1579 ms 3520 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1579 ms 3576 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 1579 ms 3616 KB Time limit exceeded
3 Halted 0 ms 0 KB -