結果

問題 No.3072 Speedrun Query
ユーザー ardririy
提出日時 2025-03-21 23:02:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,431 bytes
コンパイル時間 2,422 ms
コンパイル使用メモリ 199,520 KB
実行使用メモリ 40,604 KB
最終ジャッジ日時 2025-03-21 23:02:34
合計ジャッジ時間 7,499 ms
ジャッジサーバーID
（参考情報） 		judge7 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 3 WA * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define resort(v) sort(v.rbegin(),v.rend())
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;
using djks=priority_queue<P, vp, greater<P>>;
const ll inf=1ll<<60;
#define mod10 (ll)1e9+7
#define mod99 (ll)998244353
const double PI = acos(-1);
#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=n-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=n-1;i>=a;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
ll dx[] = {1, 0, -1, 0, -1, 1, -1, 1};
ll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
void solve() {
    int n, ka, kb; cin >> n >> ka >> kb;
    vll va(ka), vb(kb);
    vvll a(n, vll(2, -1));
    rep(i,ka) {
        int val; cin >> val; val--;
        a[val][0] = 1;
        va[i] = val;
    }
    rep(i,kb){
        int val; cin >> val;val--;
        a[val][1] = 1;
        vb[i] = val;
    }
    ll diff = inf;
    int ai = 0, bi=0;
    vvll dist(n, vll(2, inf));
    while(ai<ka&&bi<kb) {
        chmin(diff, abs(va[ai] - vb[bi]));
        if(va[ai] < vb[bi]) ai++;
        else bi++;
    }
    rep(i, n) {
        if(a[i][0] == 1) {
            chmin(dist[i][0], 0LL);
            chmin(dist[i][1], diff);
        }
        if(a[i][1] == 1) {
            chmin(dist[i][1], 0LL);
            chmin(dist[i][0], diff);
        }
    }
    ll d_r = inf, d_b = inf;
    rep(i, n) {
        if(d_r != inf) dist[i][0] = min(dist[i][0], d_r);
        if(d_b != inf) dist[i][1] = min(dist[i][1], d_b);
        d_r = min(d_r+1, dist[i][0] + 1);
        d_b = min(d_b+1, dist[i][1]+1);
    }
    d_r = inf, d_b = inf;
    per(i, n) {
        if(d_r != inf) dist[i][0] = min(dist[i][0], d_r);
        if(d_b != inf) dist[i][1] = min(dist[i][1], d_b);
        d_r = min(d_r, dist[i][0] + 1);
        d_b = min(d_b, dist[i][1]+1);
    }
    int q, s, t; cin >> q;
    rep(_, q) {
        cin >> s >> t; s--; t--;
        cout << min(min(dist[s][0]+dist[t][0], dist[s][1] + dist[t][1]), ll(max(s,t)-min(s,t))) << '\n';
    }
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t=1;
    //cin >> t;
    while(t--)solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0