oj.uz

Submission #714293

# Submission time Handle Problem Language Result Execution time Memory
714293 2023-03-24T08:05:07 Z TheSahib Event Hopping (BOI22_events) C++14
0 / 100
 1500 ms 3600 KB 
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define oo 1e9

using namespace std;

vector<vector<int>> g;
vector<bool> visited;
int dfs(int node, int target){
    if(node == target) return 0;
    visited[node] = 1;
    int ans = oo;
    for(int to:g[node]){
        if(visited[to]) continue;
        ans = min(ans, dfs(to, target) + 1);
    }
    visited[node] = 0;
    return ans;
}

int main(){
    int n, q; cin >> n >> q;
    vector<pii> v(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i].first >> v[i].second;
    }
    visited.resize(n + 1, 0);
    g.resize(n + 1);
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if(i == j) continue;
            if(v[i].second <= v[j].second && v[i].second >= v[j].first){
                g[i].emplace_back(j);
            }
        }
    }
    
    while(q--){
        int u, v; cin >> u >> v;
        int ans = dfs(u, v);
        if(ans == oo){
            cout << "impossible\n";
        }
        else{
            cout << ans << '\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 1584 ms 3600 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory 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 7 ms 312 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Execution timed out 1575 ms 1096 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory 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 7 ms 312 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Execution timed out 1575 ms 1096 KB Time limit exceeded
7 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 1 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 312 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Execution timed out 1575 ms 1096 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1547 ms 3488 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 1584 ms 3600 KB Time limit exceeded
3 Halted 0 ms 0 KB -