제출 #704723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704723		epicci23	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	92 ms	16976 KiB

ho_t1

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}




void solve()
{
  int n=in();
  int suf[n+2],pre[n+2];
  vector<pii> ar1(n+1),ar2(n);
  for(int i=0;i<n+1;i++) ar1[i]={in(),i};
  for(int i=0;i<n;i++) ar2[i]={in(),i};

  sort(all(ar1));sort(all(ar2));
  pre[1]=max(ar1[0].ff-ar2[0].ff,0LL);
  for(int i=2;i<=n;i++) pre[i]=max(pre[i-1],max(0LL,ar1[i-1].ff-ar2[i-1].ff));
  suf[n+1]=max(ar1[n].ff-ar2[n-1].ff,0LL);
  for(int i=n;i>=2;i--) suf[i]=max(suf[i+1],max(ar1[i-1].ff-ar2[i-2].ff,0LL));

  int ans[n+2];
  ans[ar1[0].ss]=suf[2];
  ans[ar1[n].ss]=pre[n];
  for(int i=2;i<=n;i++) ans[ar1[i-1].ss]=max(pre[i-1],suf[i+1]);

  for(int i=0;i<=n;i++) cout << ans[i] << " \n"[i==n];
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

ho_t1.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

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