oj.uz

Submission #836385

# Submission time Handle Problem Language Result Execution time Memory
836385 2023-08-24T10:47:27 Z green_gold_dog Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 76 ms 12352 KB 
//#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

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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 400 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 396 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 408 KB Output is correct
28 Correct 2 ms 404 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 400 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 396 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 408 KB Output is correct
28 Correct 2 ms 404 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 67 ms 11444 KB Output is correct
34 Correct 73 ms 12108 KB Output is correct
35 Correct 68 ms 11540 KB Output is correct
36 Correct 71 ms 12020 KB Output is correct
37 Correct 76 ms 12352 KB Output is correct
38 Correct 70 ms 12252 KB Output is correct
39 Correct 69 ms 11228 KB Output is correct
40 Correct 70 ms 11184 KB Output is correct
41 Correct 69 ms 11324 KB Output is correct
42 Correct 76 ms 11316 KB Output is correct
43 Correct 68 ms 11196 KB Output is correct
44 Correct 70 ms 10788 KB Output is correct
45 Correct 67 ms 10864 KB Output is correct
46 Correct 71 ms 10816 KB Output is correct
47 Correct 66 ms 11044 KB Output is correct
48 Correct 64 ms 10988 KB Output is correct
49 Correct 73 ms 11580 KB Output is correct
50 Correct 72 ms 11548 KB Output is correct
51 Correct 72 ms 11548 KB Output is correct
52 Correct 71 ms 11548 KB Output is correct
53 Correct 70 ms 11552 KB Output is correct