제출 #566985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
566985		Uzouf	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	1062 ms	6536 KiB

ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    int n; cin>>n;
    pair<int,int> a[n+1];
    int b[n],ans[n+1];
    for (int i=0;i<=n;i++) {
      cin>>a[i].first; a[i].second=i;
    }
    for (int i=0;i<n;i++) {
      cin>>b[i];
    }

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

    for (int i=0;i<=n;i++) {
      int indx=a[i].second;
      int cnt=0,curi=0;
      if (i==0) curi++;

      for (int j=0;j<n;j++) {
        cnt=max(cnt,a[curi].first-b[j]);
        curi++;
        if (curi==i) curi++;
      }
      ans[indx]=cnt;
    }

    for (int i:ans) cout<<i<<' ';

}

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