oj.uz

Submission #589940

# Submission time Handle Problem Language Result Execution time Memory
589940 2022-07-05T12:09:26 Z tamthegod Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 115 ms 17056 KB 
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, a[maxN], b[maxN];
int id[maxN];
int c[maxN], d[maxN];
int res[maxN];
int suff[maxN];
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n+1; i++) cin >> a[i];
    for(int i=1; i<=n; i++) cin >> b[i];
}
void Solve()
{
    sort(b + 1, b + n + 1);
    iota(id + 1, id + n + 2, 1);
    sort(id + 1, id + n + 2, [](int i, int j)
    {
        return a[i] < a[j];
    });
    for(int i=1; i<=n; i++)
        c[i] = a[id[i]] - b[i];
    for(int i=2; i<=n+1; i++)
        d[i] = a[id[i]] - b[i - 1];
    for(int i=n+1; i>=2; i--)
        suff[i] = max(suff[i + 1], d[i]);
    int _max = 0;
    for(int i=1; i<=n+1; i++)
    {
        res[id[i]] = max(_max, suff[i + 1]);
        _max = max(_max, c[i]);
    }
    for(int i=1; i<=n+1; i++) cout << res[i] << " ";
}
int32_t main()
{
   // freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 332 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 0 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 332 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 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 412 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 476 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 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 512 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 468 KB Output is correct
32 Correct 1 ms 480 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 332 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 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 412 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 476 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 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 512 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 468 KB Output is correct
32 Correct 1 ms 480 KB Output is correct
33 Correct 86 ms 15968 KB Output is correct
34 Correct 115 ms 16660 KB Output is correct
35 Correct 85 ms 16032 KB Output is correct
36 Correct 97 ms 16636 KB Output is correct
37 Correct 93 ms 17056 KB Output is correct
38 Correct 89 ms 16844 KB Output is correct
39 Correct 108 ms 15892 KB Output is correct
40 Correct 87 ms 15796 KB Output is correct
41 Correct 84 ms 16024 KB Output is correct
42 Correct 87 ms 15996 KB Output is correct
43 Correct 106 ms 15820 KB Output is correct
44 Correct 86 ms 15280 KB Output is correct
45 Correct 85 ms 15608 KB Output is correct
46 Correct 102 ms 15308 KB Output is correct
47 Correct 70 ms 15780 KB Output is correct
48 Correct 69 ms 15692 KB Output is correct
49 Correct 97 ms 16432 KB Output is correct
50 Correct 93 ms 16360 KB Output is correct
51 Correct 88 ms 16332 KB Output is correct
52 Correct 92 ms 16324 KB Output is correct
53 Correct 101 ms 16312 KB Output is correct