Submission #922725

#	Time	Username	Problem	Language	Result	Execution time	Memory
922725		vjudge1	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	86 ms	15544 KiB

ho_t1

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define int ll
#define y1 yy
#define ppb pop_back
#define gcd(a,b) __gcd(a,b)
#define in insert

const int dx[4]={-1,0,1,0};
const int dy[4]={0,-1,0,1};

const int inf=1e9;
const int N=1e6;
const int MAX=2e5+10;
const int mod=1e9+7;

int n;
pii a[MAX];
int b[MAX];
int p[MAX],s[MAX];
int ans[MAX];

void solve(){
  cin>>n;
  for(int i=1;i<=n+1;i++){
    cin>>a[i].F;
    a[i].S=i;
  }
  for(int i=1;i<=n;i++)cin>>b[i];
  sort(a+1,a+n+2);
  sort(b+1,b+n+1);
  for(int i=1;i<=n+1;i++){
    p[i]=max(p[i-1],a[i].F-b[i]);
  }
  for(int i=n+1;i>=1;i--){
    s[i]=max(s[i+1],a[i].F-b[i-1]);
  }
  for(int i=1;i<=n+1;i++){
    ans[a[i].S]=max(p[i-1],s[i+1]);
  }
  for(int i=1;i<=n+1;i++)cout<<ans[i]<<" ";
}

main(){
  // freopen("prizes.in", "r", stdin);
  // freopen("prizes.out", "w", stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message (stderr)

ho_t1.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main(){
      | ^~~~

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