| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346316 | retarde | Circle Passing (EGOI24_circlepassing) | C++20 | 267 ms | 47548 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
int n, m, q;
int st(int u, int v) {return min(abs(u - v), 2 * n - abs(u - v));}
int ft(int x) {
while (x >= 2*n) x -= n;
while (x < 0) x += n;
return x;
}
inline void solve() {
cin >> n >> m >> q;
set<int> f;
for (int i = 0; i < m; i++) {
int k; cin >> k;
f.insert(k); f.insert(k+n);
}
while (q--) {
int u, v;
cin >> u >> v;
int ans = st(u, v);
int r;
if (*f.rbegin() < u) {
// nothing bigger
r = *f.begin();
} else {
// something bigger
r = *f.lower_bound(u);
}
int l;
if (*f.begin() > u) {
// nothing smaller
l = *f.rbegin();
} else {
// sopmething smallest
l = *(--f.upper_bound(u));
}
ans = min(ans, st(u,l)+1+st((l < n ? l+n : l-n),v));
ans = min(ans, st(u,r)+1+st((r < n ? r+n : r-n),v));
cout << ans << '\n';
}
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
