oj.uz

Submission #909567

# Submission time Handle Problem Language Result Execution time Memory
909567 2024-01-17T09:17:50 Z a_l_i_r_e_z_a Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 227 ms 19028 KB 
// In the name of God

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define pb push_back
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 2e5 + 5;
const int inf = 1e9 + 7;
int n, b[maxn], ans[maxn];
pii a[maxn];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for(int i = 0; i < n + 1; i++){
        cin >> a[i].F;
        a[i].S = i;
    }
    for(int i = 0; i < n; i++) cin >> b[i];
    sort(b, b + n);
    sort(a, a + n + 1);
    multiset<int> st;
    for(int i = 0; i < n; i++) st.insert(max(0, a[i + 1].F - b[i]));
    for(int i = 0; i < n + 1; i++){
        ans[a[i].S] = (*st.rbegin());
        if(i != n) st.erase(st.find(max(0, a[i + 1].F - b[i])));
        st.insert(max(0, a[i].F - b[i]));
    }
    for(int i = 0; i < n + 1; i++) cout << ans[i] << ' ';
    cout << '\n';

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 3160 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2656 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2560 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2444 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 3160 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2656 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2560 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2444 KB Output is correct
33 Correct 143 ms 17400 KB Output is correct
34 Correct 166 ms 18312 KB Output is correct
35 Correct 139 ms 17552 KB Output is correct
36 Correct 146 ms 18256 KB Output is correct
37 Correct 149 ms 19028 KB Output is correct
38 Correct 157 ms 18524 KB Output is correct
39 Correct 186 ms 17580 KB Output is correct
40 Correct 187 ms 17376 KB Output is correct
41 Correct 186 ms 17456 KB Output is correct
42 Correct 191 ms 17496 KB Output is correct
43 Correct 190 ms 17492 KB Output is correct
44 Correct 132 ms 16976 KB Output is correct
45 Correct 131 ms 16980 KB Output is correct
46 Correct 133 ms 16980 KB Output is correct
47 Correct 125 ms 17232 KB Output is correct
48 Correct 136 ms 17236 KB Output is correct
49 Correct 184 ms 17844 KB Output is correct
50 Correct 188 ms 18004 KB Output is correct
51 Correct 205 ms 17852 KB Output is correct
52 Correct 208 ms 18004 KB Output is correct
53 Correct 227 ms 18072 KB Output is correct