| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1338755 | athena | Circle Passing (EGOI24_circlepassing) | C++20 | 42 ms | 548 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int dist(int a,int b,int n)
{
return min(abs(a-b),abs(2*n-abs(a-b)));
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,q;
cin>>n>>m>>q;
//vector<int> f(2*n,-1);
// vector<int> ks(m);
int fri=0;
for(int i=0;i<m;i++) {
int k;cin>>k;
// ks[i]=k;//friend having ppl
fri=k+n;
// f[k]=k+n;
// f[k+n]=k;
}
while(q--){
int x,y;
cin>>x>>y;
int ans=dist(x,y,n);//direct
//send to friend
ans=min(ans,1+dist(fri,y,n));
//ans=min(ans,dist(x,b,n)+1+dist(a,y,n));
cout<<ans<<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... | ||||
