oj.uz

Submission #836239

# Submission time Handle Problem Language Result Execution time Memory
836239 2023-08-24T09:02:37 Z alvingogo Bitaro's travel (JOI23_travel) C++14
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

signed main(){
    AquA;
    int n;
    cin >> n;
    vector<int> v(n+2);
    for(int i=1;i<=n;i++){
        cin >> v[i];
    }
    const int inf=1e18;
    v[0]=-inf;
    v[n+1]=inf;
    int q;
    cin >> q;
    while(q--){
        int c;
        cin >> c;
        int p=lower_bound(v.begin(),v.end(),c)-v.begin();
        int l,r;
        int ans=0;
        if(c-v[p-1]<=v[p]-c){
            p--;
        }
        l=r=p;
        ans+=abs(c-v[p]);
        while(l!=1 || r!=n){
            if(abs(v[p]-v[l-1])<=abs(v[r+1]-v[p])){
                int a=1,b=l-1;
                while(b>a){
                    int m=(a+b+1)/2;
                    if(abs(v[m]-v[r+1])>=abs(v[m]-v[m-1])){
                        b=m-1;
                    }
                    else{
                        a=m;
                    }
                }
                ans+=abs(v[p]-v[a]);
                assert(abs(v[a]-v[a-1])>=abs(v[a]-v[r+1]));
                l=p=a;
            }
            else{
                int a=r+1,b=n;
                while(b>a){
                    int m=(a+b)/2;
                    if(abs(v[m]-v[l-1])>abs(v[m]-v[m+1])){
                        a=m+1;
                    }
                    else{
                        b=m;
                    }
                }
                ans+=abs(v[p]-v[a]);
                assert(abs(v[a]-v[a+1])>=abs(v[a]-v[l-1]));
                r=p=a;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -