Submission #1291819

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291819		trandangquang	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	65 ms	6996 KiB

ho_t1

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

#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll

template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}

const int N=202020;

int n,b[N],p[N],s[N],ans[N];
ii a[N];

void solve(){
    cin>>n;
    foru(i,1,n+1){
        cin>>a[i].fi;
        a[i].se=i;
    }
    foru(i,1,n) cin>>b[i];

    sort(a+1,a+2+n);
    sort(b+1,b+1+n);

    foru(i,1,n){
        p[i]=max(p[i-1],max(0,a[i].fi-b[i]));
    }
    ford(i,n,1){
        s[i]=max(s[i+1],max(0,a[i+1].fi-b[i]));
    }

    foru(i,1,n+1){
        ans[a[i].se]=max(p[i-1],s[i]);
    }
    foru(i,1,n+1) cout<<ans[i]<<" ";
}

signed main(){
    #define task "test"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    cin.tie(0)->sync_with_stdio(0);

    solve();
}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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