oj.uz

답안 #714310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714310 2023-03-24T08:26:39 Z vjudge1 Event Hopping (BOI22_events) C++17
10 / 100
 41 ms 8276 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX 1001
int n, q;
pair<int, int>events[MAX];
bool check[MAX];
int dists[MAX][MAX];
vector<int>g[MAX];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    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';
//    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= n;++j){
            dists[i][j] = -1;
        }
    }
    for(int i = 1;i <= n;++i)check[i] = 0;
    for(int i = 0;i < q;++i){
        int u, v;
        cin >> u >> v;
        if(dists[u][v] != -1)cout << dists[u][v] << '\n';
        else if(dists[u][v] == -1 && check[u])cout << "impossible\n";
        else{
            queue<int>que;
            que.push(u);
            check[u] = 1;
            dists[u][u] = 0;
            while(!que.empty()){
                int cur = que.front();
                que.pop();
                for(int vv : g[cur]){
                    if(dists[u][vv] == -1){
                        dists[u][vv] = dists[u][cur] + 1;
                        que.push(vv);
                    }
                }
            }
            if(dists[u][v] == -1)cout << "impossible\n";
            else cout << dists[u][v] << '\n';
        }
    }
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 9 ms 4308 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 11 ms 4308 KB Output is correct
6 Correct 13 ms 5096 KB Output is correct
7 Correct 41 ms 5880 KB Output is correct
8 Correct 26 ms 6868 KB Output is correct
9 Correct 9 ms 8216 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 9 ms 4308 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 11 ms 4308 KB Output is correct
6 Correct 13 ms 5096 KB Output is correct
7 Correct 41 ms 5880 KB Output is correct
8 Correct 26 ms 6868 KB Output is correct
9 Correct 9 ms 8216 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 4308 KB Output is correct
13 Correct 7 ms 4208 KB Output is correct
14 Correct 8 ms 4308 KB Output is correct
15 Correct 13 ms 5076 KB Output is correct
16 Correct 26 ms 5800 KB Output is correct
17 Correct 27 ms 6868 KB Output is correct
18 Correct 9 ms 8276 KB Output is correct
19 Runtime error 1 ms 468 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 9 ms 4308 KB Output is correct
4 Correct 7 ms 4308 KB Output is correct
5 Correct 11 ms 4308 KB Output is correct
6 Correct 13 ms 5096 KB Output is correct
7 Correct 41 ms 5880 KB Output is correct
8 Correct 26 ms 6868 KB Output is correct
9 Correct 9 ms 8216 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 4220 KB Output is correct
13 Correct 7 ms 4308 KB Output is correct
14 Correct 7 ms 4308 KB Output is correct
15 Correct 12 ms 5076 KB Output is correct
16 Correct 23 ms 5896 KB Output is correct
17 Correct 35 ms 6956 KB Output is correct
18 Correct 9 ms 8276 KB Output is correct
19 Runtime error 1 ms 468 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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