Submission #1047373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047373		VMaksimoski008	Circle Passing (EGOI24_circlepassing)	C++17	100 / 100	164 ms	2396 KiB

Main

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

int main() {
    int n, m, q;
    cin >> n >> m >> q;

    vector<int> v(m), v2;
    for(int &x : v) cin >> x;
    sort(v.begin(), v.end());

    auto D = [&](int x, int y) { return min(max(x, y) - min(x, y), 2 * n - max(x, y) + min(x, y)); };

    while(q--) {
        int x, y;
        cin >> x >> y;

        int ans = D(x, y);
        ans = min(ans, D(x, v[0]) + D(v[0]+n, y) + 1);
        ans = min(ans, D(x, v.back()+n) + D(v.back(), y) + 1);
        
        int p = lower_bound(v.begin(), v.end(), x) - v.begin();
        if(p != m) ans = min(ans, D(x, v[p]) + D(v[p]+n, y) + 1);
        if(p > 0) ans = min(ans, D(x, v[p-1]) + D(v[p-1]+n, y) + 1);

        p = lower_bound(v.begin(), v.end(), x-n) - v.begin();
        if(p != m) ans = min(ans, D(x, v[p]+n) + D(v[p], y) + 1);
        if(p > 0) ans = min(ans, D(x, v[p-1]+n) + D(v[p-1], y) + 1);

        cout << ans << '\n';
    }

    return 0;
}

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