oj.uz

Submission #762896

# Submission time Handle Problem Language Result Execution time Memory
762896 2023-06-22T01:06:12 Z anhduc2701 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 221 ms 18808 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI acos(-1.0)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x, i) (1 & ((x) >> (i)))
#define MASK(x) (1LL << (x))
#define task "tnc"
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef long double ld;
const ll INF = 1e18;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const int mo = 998244353;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using pii = pair<pair<ll, ll>, ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
pair<int, int> a[maxn];
int b[maxn];
int ans[maxn];
signed main()
{
    cin.tie(0), cout.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n + 1; i++)
    {
        cin >> a[i].fi;
        a[i].se = i;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> b[i];
    }
    sort(a + 1, a + 2 + n);
    sort(b + 1, b + 1 + n);
    multiset<int> d;
    for (int i = 1; i <= n; i++)
    {
        d.insert(max(0, a[i + 1].fi - b[i]));
    }
    ans[a[1].se] = *(d.rbegin());
    for (int i = 2; i <= n + 1; i++)
    {
        d.erase(d.find({max(0, a[i].fi - b[i - 1])}));
        d.insert(a[i - 1].fi - b[i - 1]);
        ans[a[i].se] = (*d.rbegin());
    }
    for (int i = 1; i <= n + 1; i++)
    {
        cout << ans[i] << " ";
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 372 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 2 ms 480 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 476 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 476 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 480 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 138 ms 17428 KB Output is correct
34 Correct 148 ms 18136 KB Output is correct
35 Correct 144 ms 17596 KB Output is correct
36 Correct 149 ms 18056 KB Output is correct
37 Correct 157 ms 18808 KB Output is correct
38 Correct 143 ms 18444 KB Output is correct
39 Correct 195 ms 17380 KB Output is correct
40 Correct 183 ms 17316 KB Output is correct
41 Correct 182 ms 17484 KB Output is correct
42 Correct 185 ms 17392 KB Output is correct
43 Correct 221 ms 17356 KB Output is correct
44 Correct 137 ms 16848 KB Output is correct
45 Correct 139 ms 16984 KB Output is correct
46 Correct 139 ms 16748 KB Output is correct
47 Correct 143 ms 17232 KB Output is correct
48 Correct 125 ms 17268 KB Output is correct
49 Correct 191 ms 17868 KB Output is correct
50 Correct 193 ms 17868 KB Output is correct
51 Correct 203 ms 17888 KB Output is correct
52 Correct 186 ms 17860 KB Output is correct
53 Correct 193 ms 17812 KB Output is correct