Submission #895422

# Submission time Handle Problem Language Result Execution time Memory
895422 2023-12-29T23:21:12 Z Richw818 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
85 ms 10072 KB
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n + 1), b(n);
  for (int i = 0; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(b.begin(), b.end());
  vector<int> ord(n + 1);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int x, int y) {
    return a[x] < a[y];
  });
  vector<int> pref(n);
  pref[0] = max(0, a[ord[0]] - b[0]);
  for (int i = 1; i < n; i++) {
    pref[i] = a[ord[i]] - b[i];
    pref[i] = max(pref[i], pref[i - 1]);
  }
  int rmax = 0;
  vector<int> ans(n + 1);
  ans[ord[n]] = pref[n - 1];
  for (int i = n - 1; i >= 0; i--) {
    rmax = max(rmax, a[ord[i + 1]] - b[i]);
    ans[ord[i]] = max(rmax, (i == 0 ? 0 : pref[i - 1]));
  }
  for (int i = 0; i <= n; i++) {
    cout << ans[i] << " \n"[i == n];
  }
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 704 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 704 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 0 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 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 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 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 704 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 0 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 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 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 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 69 ms 9172 KB Output is correct
34 Correct 72 ms 9716 KB Output is correct
35 Correct 73 ms 9220 KB Output is correct
36 Correct 71 ms 9776 KB Output is correct
37 Correct 82 ms 10072 KB Output is correct
38 Correct 73 ms 9900 KB Output is correct
39 Correct 70 ms 9040 KB Output is correct
40 Correct 70 ms 9028 KB Output is correct
41 Correct 71 ms 9112 KB Output is correct
42 Correct 70 ms 9048 KB Output is correct
43 Correct 77 ms 9032 KB Output is correct
44 Correct 68 ms 8936 KB Output is correct
45 Correct 74 ms 8692 KB Output is correct
46 Correct 69 ms 8656 KB Output is correct
47 Correct 56 ms 8788 KB Output is correct
48 Correct 62 ms 8788 KB Output is correct
49 Correct 73 ms 9300 KB Output is correct
50 Correct 85 ms 9648 KB Output is correct
51 Correct 75 ms 9264 KB Output is correct
52 Correct 72 ms 9296 KB Output is correct
53 Correct 73 ms 9208 KB Output is correct