Submission #836385

#	Time	Username	Problem	Language	Result	Execution time	Memory
836385		green_gold_dog	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	76 ms	12352 KiB

ho_t1

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n;
        cin >> n;
        vector<pair<ll, ll>> arr(n + 1);
        vector<ll> a(n);
        for (ll i = 0; i <= n; i++) {
                cin >> arr[i].first;
                arr[i].second = i;
        }
        for (ll i = 0; i < n; i++) {
                cin >> a[i];
        }
        sort(arr.begin(), arr.end());
        sort(a.begin(), a.end());
        vector<ll> ans(n + 1);
        ll na = 0;
        for (ll i = 0; i < n; i++) {
                assign_max(na, arr[i].first - a[i]);
        }
        ans[arr.back().second] = na;
        for (ll i = n - 1; i >= 0; i--) {
                assign_max(na, arr[i + 1].first - a[i]);
                ans[arr[i].second] = na;
        }
        for (auto i : ans) {
                cout << i << ' ';
        }
        cout << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:82:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
ho_t1.cpp:83:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

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