Submission #1099362

# Submission time Handle Problem Language Result Execution time Memory
1099362 2024-10-11T08:43:42 Z Zflop Circle Passing (EGOI24_circlepassing) C++14
31 / 100
195 ms 8692 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
#define sor(x) sort(all(x))
#define pi pair<int,int>
#define vi vector<int>
#define pb push_back
#define int ll
int N,M,Q;
void solve() {
    cin >> N >> M >> Q;
    vi bestfriend{0};
    for (int i = 0; i < M;++i) {
        int b = 0;
        cin >> b;
        bestfriend.pb(b + 1);
        bestfriend.pb(b + N + 1);
        }

    auto Do = [&] (int a,int b) {
        if (a > 2 * N)
            a -= 2 * N;
        if (a > b)
            swap(a,b);
        int ans = (int)1e12;
        ans = b - a;
        ans = min(ans,a + 2 * N - b);
        return ans;
    };
    sor(bestfriend);
    while(Q--) {
        int a,b; cin >> a >> b;
        ++a,++b;
        if (a > b)
            swap(a,b);
        int ans = (int)1e12;
        ans = b - a;
        ans = min(ans,a + 2 * N - b);
        if(bestfriend.size() == 1) {
            cout << ans << '\n';
            continue;
        }
        int l = 1,r = bestfriend.size() - 1;
        int p = -1;
        while (l <= r) {
            int mid = (l + r) / 2;
            //cout << mid << ' ' << bestfriend[mid] << '\n';
            if (bestfriend[mid] <= a) {
                p = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        if(p == -1) {
            ans = min(ans,Do(bestfriend.back() - N,b) + a + 1 + 2 * N - bestfriend.back());
            ans = min(ans,Do(bestfriend[1] + N,b) + bestfriend[1] - a + 1);
        }
        if(p != -1){
            ans = min(ans,Do(N + bestfriend[p],b) + a - bestfriend[p] + 1);
            ans = min(ans,Do(N + bestfriend[p + 1],b) + bestfriend[p + 1] - a + 1);
        }
        cout << ans << "\n";
    }
}

main(){
    solve();
}

Compilation message

Main.cpp:68:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   68 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 25 ms 348 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 29 ms 460 KB Output is correct
6 Correct 29 ms 528 KB Output is correct
7 Correct 31 ms 592 KB Output is correct
8 Correct 32 ms 596 KB Output is correct
9 Correct 32 ms 604 KB Output is correct
10 Correct 33 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 2 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 2 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 35 ms 592 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 160 ms 8692 KB Output is correct
4 Correct 54 ms 2512 KB Output is correct
5 Correct 30 ms 604 KB Output is correct
6 Correct 30 ms 604 KB Output is correct
7 Correct 29 ms 540 KB Output is correct
8 Correct 29 ms 344 KB Output is correct
9 Correct 40 ms 512 KB Output is correct
10 Correct 29 ms 348 KB Output is correct
11 Correct 30 ms 344 KB Output is correct
12 Correct 29 ms 604 KB Output is correct
13 Correct 29 ms 604 KB Output is correct
14 Correct 30 ms 760 KB Output is correct
15 Correct 91 ms 4544 KB Output is correct
16 Correct 93 ms 4544 KB Output is correct
17 Correct 195 ms 8628 KB Output is correct
18 Correct 191 ms 8636 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 348 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 29 ms 460 KB Output is correct
6 Correct 29 ms 528 KB Output is correct
7 Correct 31 ms 592 KB Output is correct
8 Correct 32 ms 596 KB Output is correct
9 Correct 32 ms 604 KB Output is correct
10 Correct 33 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Incorrect 2 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -