oj.uz

답안 #231782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231782 2020-05-14T18:06:56 Z Haunted_Cpp Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 4 ms 384 KB 
#include <bits/stdc++.h>
 
using namespace std;

#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int> > a (n + 1);
  for (int i = 0; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  vector<int> pessoas (n);
  for (int i = 0; i < n; i++) cin >> pessoas[i];
  sort (a.begin(), a.end());
  sort (pessoas.begin(), pessoas.end());
  multiset<int> diff;
  for (int i = 0; i < n; i++) {
    diff.insert( max (a[i].first - pessoas[i], 0) );
  }
  vector<int> ans (n + 1, -1);
  ans.back () = *diff.rbegin();
  int last = a[n].first;
  for (int i = n - 1; i >= 0; i--) {
    int current = max (a[i].first - pessoas[i], 0);
    diff.erase(diff.lower_bound(current));
    diff.insert( max (last - pessoas[i], 0) );
    ans[i] = *diff.rbegin();
    last = a[i].first;
  }
  for (int i = 0; i <= n; i++) {
    if (i) cout << ' ';
    cout << ans[i];
  }
  cout << '\n';
  return 0;
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 91.0

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