oj.uz

Submission #1040783

# Submission time Handle Problem Language Result Execution time Memory
1040783 2024-08-01T09:13:01 Z joelgun14 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 60 ms 11088 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int n;
  cin >> n;
  pair<int, int> a[n + 2];
  int b[n + 1], pref[n + 1], suff[n + 3];
  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];
  pref[0] = suff[n + 2] = 0;
  sort(b + 1, b + n + 1);
  sort(a + 1, a + n + 2);
  for(int i = 1; i <= n; ++i) {
    pref[i] = max(pref[i - 1], max(0, a[i].fi - b[i]));
  }
  for(int i = n + 1; i >= 2; --i) {
    suff[i] = max(suff[i + 1], max(0, a[i].fi - b[i - 1]));
  }
  int ans[n + 2];
  for(int i = 1; i <= n + 1; ++i)
    ans[a[i].se] = max(pref[i - 1], suff[i + 1]);
  for(int i = 1; i <= n + 1; ++i)
    cout << ans[i] << " ";
  cout << endl;
  return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 53 ms 10024 KB Output is correct
34 Correct 53 ms 10320 KB Output is correct
35 Correct 55 ms 10064 KB Output is correct
36 Correct 52 ms 10700 KB Output is correct
37 Correct 59 ms 11088 KB Output is correct
38 Correct 54 ms 10832 KB Output is correct
39 Correct 52 ms 9800 KB Output is correct
40 Correct 52 ms 9764 KB Output is correct
41 Correct 52 ms 9872 KB Output is correct
42 Correct 53 ms 9812 KB Output is correct
43 Correct 52 ms 9808 KB Output is correct
44 Correct 51 ms 9300 KB Output is correct
45 Correct 59 ms 9556 KB Output is correct
46 Correct 60 ms 9300 KB Output is correct
47 Correct 49 ms 9460 KB Output is correct
48 Correct 51 ms 9568 KB Output is correct
49 Correct 55 ms 10044 KB Output is correct
50 Correct 60 ms 10084 KB Output is correct
51 Correct 57 ms 10064 KB Output is correct
52 Correct 53 ms 10064 KB Output is correct
53 Correct 55 ms 10064 KB Output is correct