제출 #1352486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1352486		vahagng	Event Hopping (BOI22_events)	C++20	10 / 100	1596 ms	43504 KiB

events

#include <bits/stdc++.h>
using namespace std;

const int N = 5001;

int n, q, s[N], e[N];

int dist[N][N];

vector<int> adj[N];

int main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> s[i] >> e[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            if (s[j] <= e[i] && e[i] <= e[j]) {
                adj[i].push_back(j);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) dist[i][j] = INT_MAX;
        dist[i][i] = 0;
        queue<int> pq;
        pq.push(i);
        while (!pq.empty()) {
            auto node = pq.front();
            pq.pop();
            for(auto j : adj[node]){
                if(dist[i][j] == INT_MAX){
                    dist[i][j] = dist[i][node] + 1;
                    pq.push(j);
                }
            }
        }
    }
    while(q--){
        int u, v;
        cin >> u >> v;
        if(dist[u][v] == INT_MAX){
            cout << "impossible\n";
        }else{
            cout << dist[u][v] << endl;
        }
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30