제출 #714313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714313		vjudge1	Event Hopping (BOI22_events)	C++17	10 / 100	27 ms	8276 KiB

events

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX 1005
int n, q;
pair<int, int>events[MAX];
bool check[MAX];
int dists[MAX][MAX];;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    vector<int>g[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';
//    }
    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
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30