oj.uz

Submission #721901

# Submission time Handle Problem Language Result Execution time Memory
721901 2023-04-11T08:38:43 Z MDSPro Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 30092 KB 
#include "bits/stdc++.h"
 
using namespace std;

const int INF = 1e9;

int main(){
    cin.tie(0)->sync_with_stdio(0);
 
    int n,q; cin >> n >> q;
    vector<tuple<int,int,int>> ev;
    for(int i = 0; i < n; ++i){
        int x,y; cin >> x >> y;
        ev.emplace_back(y,x,i+1);
    }
 
    sort(ev.begin(),ev.end());
 
    vector<int> nw_order(n+1);
    vector<int> left(n),right(n);
    for(int i = 0; i < n; ++i) {
        left[i] = get<1>(ev[i]);
        right[i] = get<0>(ev[i]);
        nw_order[get<2>(ev[i])] = i;
    }
    
    vector<vector<int>> g(n);
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            if(i == j) continue;
            if(left[j] <= right[i] && right[i] <= right[j]) {
                g[i].emplace_back(j);
            }
        }
    }

    auto get = [&](int a, int b){
        if(a == b) return 0;
        vector<int> dis(n,INF); dis[a] = 0;

        queue<int> q; q.push(a);
        while(!q.empty()){
            int mn = q.front(); q.pop();
            for(int z: g[mn]){
                if(dis[z] == INF){
                    dis[z] = dis[mn]+1;
                    q.push(z);
                }
            }
        }

        if(dis[b] == INF) return -1;
        else return dis[b];
    };

    while(q--){
        int a,b; cin >> a >> b;
        a = nw_order[a];
        b = nw_order[b];

        int dis = get(a,b);
        if(dis == -1) cout << "impossible\n";
        else cout << dis << '\n';
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1573 ms 5136 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 464 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 11 ms 1108 KB Output is correct
7 Correct 23 ms 1996 KB Output is correct
8 Correct 22 ms 3008 KB Output is correct
9 Correct 94 ms 4308 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 464 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 11 ms 1108 KB Output is correct
7 Correct 23 ms 1996 KB Output is correct
8 Correct 22 ms 3008 KB Output is correct
9 Correct 94 ms 4308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 9 ms 1128 KB Output is correct
16 Correct 19 ms 1876 KB Output is correct
17 Correct 20 ms 3032 KB Output is correct
18 Correct 107 ms 4384 KB Output is correct
19 Execution timed out 1587 ms 30092 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 464 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 11 ms 1108 KB Output is correct
7 Correct 23 ms 1996 KB Output is correct
8 Correct 22 ms 3008 KB Output is correct
9 Correct 94 ms 4308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 4 ms 360 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 10 ms 1108 KB Output is correct
16 Correct 18 ms 1876 KB Output is correct
17 Correct 20 ms 3028 KB Output is correct
18 Correct 103 ms 4380 KB Output is correct
19 Execution timed out 1588 ms 5176 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1563 ms 5360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1573 ms 5136 KB Time limit exceeded
3 Halted 0 ms 0 KB -