Submission #796150

#	Time	Username	Problem	Language	Result	Execution time	Memory
796150		arush_agu	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	84 ms	10836 KiB

ho_t1

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n;
  cin >> n;
  vii a(n + 1);
  for (ii &x : a)
    cin >> x.first;
  vi b(n);
  for (int &x : b)
    cin >> x;

  for (int i = 0; i <= n; i++)
    a[i].second = i;

  sort(all(a)), sort(all(b));

  vi pref(n);
  pref[0] = max(0, a[0].first - b[0]);
  for (int i = 1; i < n; i++)
    pref[i] = max(pref[i - 1], a[i].first - b[i]);

  vi suff(n);
  suff[n - 1] = a[n].first - b[n - 1];
  for (int i = n - 2; i >= 0; i--)
    suff[i] = max(suff[i + 1], a[i + 1].first - b[i]);

  // cerr << a << "\n" << b << "\n" << pref << "\n" << suff << "\n";

  vi ans(n + 1);
  for (int i = 0; i <= n; i++) {
    int curr = max(i == 0 ? 0 : pref[i - 1], i == n ? 0 : suff[i]);
    ans[a[i].second] = curr;
  }

  for (int &x : ans)
    cout << x << " ";
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:134:11: warning: unused variable 'start' [-Wunused-variable]
  134 |   clock_t start = clock();
      |           ^~~~~

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