oj.uz

Submission #604383

# Submission time Handle Problem Language Result Execution time Memory
604383 2022-07-25T05:17:00 Z Jomnoi Event Hopping (BOI22_events) C++17
10 / 100
 1500 ms 43172 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1e5 + 5;
const int MAX_M = 5005;
const int INF = 1e9 + 7;

int S[MAX_N], E[MAX_N];
int dist[MAX_N];
int can_reach[MAX_M][MAX_M];
vector <int> graph[MAX_N];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int N, Q;
    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 and S[j] <= E[i] and E[i] <= E[j]) {
                graph[i].push_back(j);
            }
        }
    }

    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= N; j++) {
            dist[j] = -1;
        }

        queue <int> q;
        q.push(i);
        dist[i] = 0;
        while(!q.empty()) {
            int u = q.front();
            q.pop();

            for(auto v : graph[u]) {
                if(dist[v] == -1) {
                    dist[v] = dist[u] + 1;
                    q.push(v);
                }
            }
        }

        for(int j = 1; j <= N; j++) {
            can_reach[i][j] = dist[j];
        }
    }

    while(Q--) {
        int s, e;
        cin >> s >> e;

        if(can_reach[s][e] == -1) {
            cout << "impossible\n";
        }
        else {
            cout << can_reach[s][e] << '\n';
        }
    }
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 15 ms 10580 KB Output is correct
4 Correct 13 ms 10580 KB Output is correct
5 Correct 19 ms 10600 KB Output is correct
6 Correct 58 ms 11376 KB Output is correct
7 Correct 123 ms 12256 KB Output is correct
8 Correct 144 ms 13232 KB Output is correct
9 Correct 731 ms 14580 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 15 ms 10580 KB Output is correct
4 Correct 13 ms 10580 KB Output is correct
5 Correct 19 ms 10600 KB Output is correct
6 Correct 58 ms 11376 KB Output is correct
7 Correct 123 ms 12256 KB Output is correct
8 Correct 144 ms 13232 KB Output is correct
9 Correct 731 ms 14580 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 17 ms 10644 KB Output is correct
13 Correct 13 ms 10580 KB Output is correct
14 Correct 19 ms 10708 KB Output is correct
15 Correct 57 ms 11376 KB Output is correct
16 Correct 152 ms 12240 KB Output is correct
17 Correct 138 ms 13256 KB Output is correct
18 Correct 749 ms 14604 KB Output is correct
19 Execution timed out 1593 ms 43172 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 15 ms 10580 KB Output is correct
4 Correct 13 ms 10580 KB Output is correct
5 Correct 19 ms 10600 KB Output is correct
6 Correct 58 ms 11376 KB Output is correct
7 Correct 123 ms 12256 KB Output is correct
8 Correct 144 ms 13232 KB Output is correct
9 Correct 731 ms 14580 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 16 ms 10664 KB Output is correct
13 Correct 13 ms 10580 KB Output is correct
14 Correct 18 ms 10664 KB Output is correct
15 Correct 49 ms 11340 KB Output is correct
16 Correct 120 ms 12224 KB Output is correct
17 Correct 151 ms 13304 KB Output is correct
18 Correct 749 ms 14576 KB Output is correct
19 Execution timed out 1581 ms 3788 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 1574 ms 3664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

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