oj.uz

답안 #1099419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099419 2024-10-11T09:30:53 Z mihaihvh Circle Passing (EGOI24_circlepassing) C++14
20 / 100
 2000 ms 1048576 KB 
#include <iostream>
#include <set>
#include <queue>
#include <vector>

using namespace std;

vector<set<int>> v;

long long n, m, q;
int M;

void bf(int k, int l) {
    //int viz[20001]{0};
    vector<int> viz(2*n);
    queue<int> q;
    viz[k] = 1;
    q.push(k);
    while (!q.empty()) {
        int i = q.front();
        if (i == 0)
            v[i].insert(2LL*n-1);
        if (i == 2LL*n-1)
            v[i].insert(0);
        if (i < 2*n-1) v[i].insert(i+1);
        if (i > 0) v[i].insert(i-1);

        for (auto m : v[q.front()]) {
            if (!viz[m]) {
                q.push(m);
                viz[m] = viz[q.front()] + 1;
                if (m == l) {
                    cout << viz[l] - 1 << '\n';
                    return;
                }
            }
        }
        q.pop();
    }
}

int main() {
    cin.tie(NULL);
    cin.sync_with_stdio(false);
    cin >> n >> m >> q;
    vector<set<int>> V(2LL*n);
    v = V;
    for (int i = 0; i < m; ++i) {
        cin >> M;
        v[M].insert(M+n);
        v[M+n].insert(M);
    }
    /*for (int i = 0; i < 2LL*n; ++i) {
        if (i == 0)
            v[i].insert(2LL*n-1);
        if (i == 2LL*n-1)
            v[i].insert(0);
        if (i < 2*n-1) v[i].insert(i+1);
        if (i > 0) v[i].insert(i-1);
    }*/

    for (int i = 0; i < q; ++i) {
        int a, b;
        cin >> a >> b;
        bf(a, b);
    }
    return 0;
}

Subtask #1
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 6 ms 508 KB Output is correct
3 Correct 33 ms 628 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Execution timed out 2084 ms 38800 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 7 ms 616 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 7 ms 608 KB Output is correct
8 Correct 17 ms 604 KB Output is correct
9 Correct 22 ms 860 KB Output is correct
10 Correct 22 ms 852 KB Output is correct
11 Correct 17 ms 604 KB Output is correct
12 Correct 18 ms 856 KB Output is correct
13 Correct 17 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 452 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 7 ms 616 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 7 ms 608 KB Output is correct
8 Correct 17 ms 604 KB Output is correct
9 Correct 22 ms 860 KB Output is correct
10 Correct 22 ms 852 KB Output is correct
11 Correct 17 ms 604 KB Output is correct
12 Correct 18 ms 856 KB Output is correct
13 Correct 17 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 452 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 6 ms 592 KB Output is correct
23 Correct 7 ms 604 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 7 ms 608 KB Output is correct
28 Correct 25 ms 860 KB Output is correct
29 Correct 22 ms 856 KB Output is correct
30 Correct 16 ms 856 KB Output is correct
31 Correct 16 ms 852 KB Output is correct
32 Correct 18 ms 856 KB Output is correct
33 Correct 18 ms 860 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Runtime error 349 ms 1048576 KB Execution killed with signal 9
38 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 6 ms 508 KB Output is correct
3 Correct 33 ms 628 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Execution timed out 2084 ms 38800 KB Time limit exceeded
6 Halted 0 ms 0 KB -