| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338698 | athena | Circle Passing (EGOI24_circlepassing) | C++20 | 40 ms | 3168 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,q;
cin>>n>>m>>q;
int arr[m];
for(int i=0;i<m;i++)
cin>>arr[i];
int fri=arr[0]+n;
//cout<<"FRIED "<<f<<endl;
while(q--)
{
int x,y;
cin>>x>>y;
//closest bw back forth distance from 0 , and back forth from friend
//forward
int f=abs(x-y);
int b=abs(0-x)+abs(y-(2*n-1))+1;
int ff=abs(y-fri)+1;
int bb=abs(0-fri)+abs(y-(2*n-1))+1;
//cout<<f<<" "<<b<<" "<<ff<<" "<<bb<<endl;
cout<<min({f,b,ff,bb})<<endl;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
