oj.uz

Submission #1006235

# Submission time Handle Problem Language Result Execution time Memory
1006235 2024-06-23T15:01:23 Z phong Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 69 ms 22612 KB 
#include<bits/stdc++.h>

#define ll long long
//#define int long long
const int nmax = 1e6 + 5, N = 100 + 2e5 + 2;
const ll oo = 1e9;
const int lg = 7, M = 4e3;
const int base = 2e5, mod = 998244353;
#define pii pair<ll, ll>
#define fi first
#define se second
#define endl "\n"
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' ';cout << endl
using namespace std;


int n;
pii a[nmax];
ll pre[nmax], suf[nmax], b[nmax];
ll ans[nmax];
main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    //    freopen("code.inp", "r", stdin);
    //    freopen("code.out", "w", stdout);
    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 + 1 + n + 1);
    sort(b + 1, b + 1 + n);
    for(int i = 1; i <= n + 1; ++i){
        pre[i] = max(pre[i - 1], a[i].fi - b[i]);
    }
    for(int i = n + 1; i >= 1; --i){
        suf[i] = max(suf[i + 1], a[i].fi - b[i - 1]);
        ans[a[i].se] = max(pre[i - 1], suf[i + 1]);
    }
    debug(ans, n + 1);
}
/*
5
1 2
2 3
3 4
4 5
5 1




*/

Compilation message

ho_t1.cpp:21:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | main(){
      | ^~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4696 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 59 ms 21844 KB Output is correct
34 Correct 69 ms 22212 KB Output is correct
35 Correct 61 ms 21956 KB Output is correct
36 Correct 61 ms 22356 KB Output is correct
37 Correct 63 ms 22600 KB Output is correct
38 Correct 62 ms 22612 KB Output is correct
39 Correct 61 ms 21588 KB Output is correct
40 Correct 63 ms 21584 KB Output is correct
41 Correct 68 ms 21844 KB Output is correct
42 Correct 66 ms 21588 KB Output is correct
43 Correct 63 ms 21588 KB Output is correct
44 Correct 60 ms 21332 KB Output is correct
45 Correct 61 ms 21332 KB Output is correct
46 Correct 57 ms 21296 KB Output is correct
47 Correct 64 ms 21332 KB Output is correct
48 Correct 52 ms 21332 KB Output is correct
49 Correct 59 ms 21844 KB Output is correct
50 Correct 64 ms 21744 KB Output is correct
51 Correct 56 ms 21824 KB Output is correct
52 Correct 66 ms 21960 KB Output is correct
53 Correct 65 ms 21956 KB Output is correct