Submission #1361330

#	Time	Username	Problem	Language	Result	Execution time	Memory
1361330		biserailieva	Circle Passing (EGOI24_circlepassing)	C++20	0 / 100	457 ms	1114112 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int N;
int dist_circle(int a, int b)
{
    int d = abs(a - b);
    return min(d, 2*N - d);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, q;
    cin >> n >> m >> q;
    N = 2 * n;
    vector<int> bf(N, -1);
    for (int i = 0; i < m; i++)
    {
        int k;
        cin >> k;
        bf[k] = k + n;
        bf[k + n] = k;
    }
    while (q--)
    {
        int x, y;
        cin >> x >> y;
        int ans = dist_circle(x, y);
        if (bf[x] != -1) {
            ans = min(ans,
                dist_circle(x, bf[x]) + 1 + dist_circle(bf[x], y)
            );
        }
        if (bf[y] != -1) {
            ans = min(ans,
                dist_circle(x, bf[y]) + 1 + dist_circle(bf[y], y)
            );
        }
        cout << ans << "\n";
    }
    return 0;
}

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