| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360725 | biserailieva | Circle Passing (EGOI24_circlepassing) | C++20 | 20 ms | 608 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, q;
cin>>n>>m>>q;
int A[m];
bool prv=true;
if(m!=1)
{
prv=false;
}
for(int i=0;i<m;i++)
{
cin>>A[i];
}
int x[q], y[q];
for(int i=0;i<q;i++)
{
cin>>x[i]>>y[i];
if(x[i]!=A[0])
{
prv=false;
}
}
if(prv)
{
for(int i=0;i<q;i++)
{
int r1, r2, r3;
r1=abs(x[i]-y[i]);
r2=2*n-abs(x[i]-y[i]);
if(x[i]<n)
{
x[i]+=n;
}
else
{
x[i]-=n;
}
r3=min(abs(x[i]-y[i]), 2*n-abs(x[i]-y[i]))+1;
cout<<min({r1, r2, r3})<<endl;
}
}
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
