oj.uz

Submission #762912

# Submission time Handle Problem Language Result Execution time Memory
762912 2023-06-22T01:20:33 Z huutuan Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 78 ms 11656 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

const int N=2e5+10;
int pre[N], suf[N], n, b[N], res[N];
pair<int, int> a[N];

void solve(int tc){
    // cout << "Case #" << tc << ": ";
    cin >> n;
    for (int i=1; i<=n+1; ++i) cin >> a[i].first, a[i].second=i;
    for (int i=1; i<=n; ++i) cin >> b[i];
    sort(a+1, a+n+2);
    sort(b+1, b+n+1);
    for (int i=1; i<=n; ++i) pre[i]=max(pre[i-1], a[i].first-b[i]);
    for (int i=n; i>=1; --i) suf[i]=max(suf[i+1], a[i+1].first-b[i]);
    for (int i=1; i<=n+1; ++i) res[a[i].second]=max(pre[i-1], suf[i]);
    for (int i=1; i<=n+1; ++i) cout << res[i] << ' ';
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int ntests=1;
    // cin >> ntests;
    for (int i=1; i<=ntests; ++i) solve(i);
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 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 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 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 2 ms 340 KB Output is correct
28 Correct 1 ms 340 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 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 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 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 2 ms 340 KB Output is correct
28 Correct 1 ms 340 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 68 ms 10684 KB Output is correct
34 Correct 74 ms 11112 KB Output is correct
35 Correct 68 ms 10836 KB Output is correct
36 Correct 70 ms 11312 KB Output is correct
37 Correct 73 ms 11656 KB Output is correct
38 Correct 71 ms 11460 KB Output is correct
39 Correct 70 ms 10520 KB Output is correct
40 Correct 69 ms 10544 KB Output is correct
41 Correct 69 ms 10668 KB Output is correct
42 Correct 69 ms 10600 KB Output is correct
43 Correct 73 ms 10556 KB Output is correct
44 Correct 67 ms 10168 KB Output is correct
45 Correct 70 ms 10152 KB Output is correct
46 Correct 69 ms 10048 KB Output is correct
47 Correct 65 ms 10128 KB Output is correct
48 Correct 78 ms 10172 KB Output is correct
49 Correct 71 ms 10768 KB Output is correct
50 Correct 71 ms 10876 KB Output is correct
51 Correct 71 ms 10764 KB Output is correct
52 Correct 71 ms 10780 KB Output is correct
53 Correct 73 ms 10860 KB Output is correct