oj.uz

Submission #231783

# Submission time Handle Problem Language Result Execution time Memory
231783 2020-05-14T18:07:47 Z Haunted_Cpp Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 277 ms 18680 KB 
#include <bits/stdc++.h>
 
using namespace std;

#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int> > a (n + 1);
  for (int i = 0; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  vector<int> pessoas (n);
  for (int i = 0; i < n; i++) cin >> pessoas[i];
  sort (a.begin(), a.end());
  sort (pessoas.begin(), pessoas.end());
  multiset<int> diff;
  for (int i = 0; i < n; i++) {
    diff.insert( max (a[i].first - pessoas[i], 0) );
  }
  vector<int> ans (n + 1, -1);
  ans[a[n].second] = *diff.rbegin();
  int last = a[n].first;
  for (int i = n - 1; i >= 0; i--) {
    int current = max (a[i].first - pessoas[i], 0);
    diff.erase(diff.lower_bound(current));
    diff.insert( max (last - pessoas[i], 0) );
    ans[a[i].second] = *diff.rbegin();
    last = a[i].first;
  }
  for (int i = 0; i <= n; i++) {
    if (i) cout << ' ';
    cout << ans[i];
  }
  cout << '\n';
  return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 544 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 205 ms 17528 KB Output is correct
34 Correct 230 ms 18332 KB Output is correct
35 Correct 209 ms 17656 KB Output is correct
36 Correct 221 ms 18168 KB Output is correct
37 Correct 239 ms 18680 KB Output is correct
38 Correct 217 ms 18428 KB Output is correct
39 Correct 265 ms 17400 KB Output is correct
40 Correct 264 ms 17524 KB Output is correct
41 Correct 264 ms 17664 KB Output is correct
42 Correct 271 ms 17656 KB Output is correct
43 Correct 260 ms 17404 KB Output is correct
44 Correct 190 ms 17016 KB Output is correct
45 Correct 198 ms 16960 KB Output is correct
46 Correct 193 ms 16888 KB Output is correct
47 Correct 177 ms 17400 KB Output is correct
48 Correct 200 ms 17304 KB Output is correct
49 Correct 266 ms 17944 KB Output is correct
50 Correct 271 ms 17912 KB Output is correct
51 Correct 261 ms 17912 KB Output is correct
52 Correct 274 ms 17956 KB Output is correct
53 Correct 277 ms 17912 KB Output is correct