oj.uz

답안 #788208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788208 2023-07-20T01:04:31 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=2e5+9;
long long a[maxn],b[maxn],c[maxn],d[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int n;
    cin>>n;
    for1(i,1,n+1)cin>>a[i];
    for1(i,1,n)cin>>b[i];
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    for1(i,1,n){
    c[i]=max(c[i-1],max(1ll*0,a[i]-b[i]));
    }
    for2(i,n+1,2){
    d[i]=max(d[i+1],max(1ll*0,a[i]-b[i-1]));
    }
    for1(i,1,n+1){
    cout<<max(d[i+1],c[i-1])<<" ";
    }

}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -