oj.uz

Submission #503848

# Submission time Handle Problem Language Result Execution time Memory
503848 2022-01-09T04:32:31 Z cig32 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 102 ms 15408 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long

int rnd(int x, int y) { // random number generator
  int u= uniform_int_distribution<int>(x, y)(rng); return u;
}

void solve(int tc) {
  int N;
  cin >> N;
  pair<int,int> A[N+2];
  for(int i=1; i<=N+1; i++){
    cin >> A[i].first;
    A[i].second = i;
  }
  sort(A+1, A+N+2);
  int B[N+1];
  for(int i=1; i<=N; i++)cin >> B[i];
  sort(B+1, B+N+1);
  int pre[N+1], suf[N+2];
  pre[0] = suf[N+1] = 0;
  for(int i=1; i<=N; i++) pre[i] = max(pre[i-1], A[i].first - B[i]);
  for(int i=N; i>=1; i--) suf[i] = max(suf[i+1], A[i+1].first - B[i]);
  int ans[N+2];
  for(int i=1; i<=N+1; i++) {
    ans[A[i].second] = max(pre[i-1], suf[i]);
  }
  for(int i=1; i<=N+1; i++) cout << ans[i] << " ";
  cout << "\n";
}

int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
/*
3 4 6 7
2 4 6
*/

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 2 ms 324 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 368 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 80 ms 14388 KB Output is correct
34 Correct 86 ms 15024 KB Output is correct
35 Correct 80 ms 14428 KB Output is correct
36 Correct 87 ms 15044 KB Output is correct
37 Correct 87 ms 15408 KB Output is correct
38 Correct 83 ms 15264 KB Output is correct
39 Correct 102 ms 14328 KB Output is correct
40 Correct 82 ms 14200 KB Output is correct
41 Correct 89 ms 14344 KB Output is correct
42 Correct 84 ms 14276 KB Output is correct
43 Correct 81 ms 14168 KB Output is correct
44 Correct 86 ms 13760 KB Output is correct
45 Correct 88 ms 13904 KB Output is correct
46 Correct 96 ms 13720 KB Output is correct
47 Correct 78 ms 14140 KB Output is correct
48 Correct 80 ms 14064 KB Output is correct
49 Correct 85 ms 14672 KB Output is correct
50 Correct 92 ms 14696 KB Output is correct
51 Correct 83 ms 14672 KB Output is correct
52 Correct 85 ms 14612 KB Output is correct
53 Correct 83 ms 14640 KB Output is correct