| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347508 | julia_08 | Circle Passing (EGOI24_circlepassing) | C++20 | 2094 ms | 4648 KiB |
#include <bits/stdc++.h>
using namespace std;
int n;
int dist(int x, int y){
if(x > y) swap(x, y);
return min(y - x, 2 * n - (y - x));
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int m, q; cin >> n >> m >> q;
vector<int> s;
while(m--){
int k; cin >> k;
s.push_back(k);
s.push_back(k + n);
}
while(q--){
int x, y; cin >> x >> y;
int ans = dist(x, y);
for(auto z : s){
ans = min(ans, dist(x, z) + dist((z < n ? z + n : z - n), y) + 1);
}
cout << ans << "\n";
}
return 0;
}| # | 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... | ||||
