Submission #1099368

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099368		mihaihvh	Circle Passing (EGOI24_circlepassing)	C++14	0 / 100	10 ms	1116 KiB

Main

#include <iostream>
#include <set>
#include <queue>
#include <vector>

using namespace std;

set<int> v[2001];
vector<pair<int, int>> Q;


int n, m, q;
int M[1001];

void bf(int k, int l) {
    int viz[2001]{0};
    queue<int> q;
    viz[k] = 1;
    q.push(k);
    while (!q.empty()) {
        for (auto m : v[q.front()]) {
            if (!viz[m]) {
                q.push(m);
                viz[m] = viz[q.front()] + 1;
            }
        }
        q.pop();
    }
    cout << viz[l] - 1 << '\n';
}

int main() {
    cin >> n >> m >> q;
    for (int i = 0; i < m; ++i) {
        cin >> M[i];
    }
    for (int i = 0; i < 2*n; ++i) {
        if (i == 0)
            v[i].insert(2*n-1);
        if (i == 2*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) {
        for (int j = 0; j < m; ++j) {
            int a, b;
            cin >> a >> b;
            Q.push_back(make_pair(a, b));
            if (M[j] == i) {
                v[a].insert(b);
                v[b].insert(a);
            }
        }
    }

    for (auto p : Q) {
        bf(p.first, p.second);
    }

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 20
• Subtask 3: 0 / 22
• Subtask 4: 0 / 17
• Subtask 5: 0 / 27