제출 #1043203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043203		model_code	Circle Passing (EGOI24_circlepassing)	C++17	100 / 100	251 ms	52588 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define debug(...) //ignore
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long double ld;

using ll = int; // should work without overflow

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll n,m,q;
  cin>>n>>m>>q;
  set<ll> s;
  rep(i,0,m) {
    ll x;
    cin>>x;
    s.emplace(x);
    s.emplace(x+n);
  }
  auto md = [&](ll x) { return (x%(2*n)+2*n)%(2*n); };
  auto go = [&](ll x, ll y) { return min(md(x-y),md(y-x)); };
  rep(i,0,q) {
    ll x, y;
    cin>>x>>y;
    ll ans = go(x,y);
    if(m > 0) {
      auto it = s.lower_bound(x);
      if(it == end(s)) it = begin(s);
      ans = min(ans, go(x, *it) + 1 + go(md(*it+n), y));
      it = prev(it == begin(s) ? end(s) : it);
      ans = min(ans, go(x, *it) + 1 + go(md(*it+n), y));
    }
    cout << ans << endl;
  }
}

• Subtask 1: 14 / 14
• Subtask 2: 20 / 20
• Subtask 3: 22 / 22
• Subtask 4: 17 / 17
• Subtask 5: 27 / 27