Submission #1023674

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023674		vjudge1	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	1 ms	348 KiB

ho_t1

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits> 
using namespace std;
int main() {
    int N;
    cin>>N;
    vector<long long> A(N+1),B(N);
    for(int i=0; i<=N; ++i) {
        cin>>A[i];
    }
    for(int i=0; i<N; ++i) {
        cin>>B[i];
    }
    sort(B.begin(),B.end());
    vector<long long> min_strangeness(N+1,LLONG_MAX);
    for(int i=0; i<=N; ++i) {
        auto it=lower_bound(B.begin(),B.end(),A[i])-B.begin();
        if(it<N) {
            min_strangeness[i]=abs(A[i]-B[it]);
        }
        if(it>0) {
            min_strangeness[i]=min(min_strangeness[i],abs(A[i]-B[it-1]));
        }
    }
    for(int i=0; i<=N; ++i) {
        cout<<min_strangeness[i]<<" ";
    }
    cout<<endl;
    return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 8
• Subtask 3: 0 / 91