Submission #1151505

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151505		Muhammad_Aneeq	Circle Passing (EGOI24_circlepassing)	C++20	14 / 100	65 ms	3140 KiB

Main

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <algorithm>
#warning check the output
using namespace std;
int n,m,q;
int dis(int x,int y)
{
    return min(abs(x-y),2*n-abs(x-y));
}
inline void solve()
{
    cin>>n>>m>>q;
    m*=2;
    int k[m]={};
    for (int i=0;i<m;i+=2)
    {
        int x;
        cin>>x;
        k[i]=x;
        k[i+1]=x+n;
    }
    sort(k,k+m);
    while (q--)
    {
        int x,y;
        cin>>x>>y;
        int ind=lower_bound(k,k+m,x)-k;
        int ans=dis(x,y);
        ind%=m;
        ans=min(ans,dis(x,(k[ind])%(2*n))+dis((k[ind]+n)%(2*n),y)+1);
        ind--;
        ind=(ind+m)%m;
        ans=min(ans,dis(x,(k[ind]+n)%(2*n))+dis((k[ind]+n)%(2*n),y)+1);
        cout<<ans<<endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

Compilation message (stderr)

Main.cpp:9:2: warning: #warning check the output [-Wcpp]
    9 | #warning check the output
      |  ^~~~~~~

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