oj.uz

Submission #208631

# Submission time Handle Problem Language Result Execution time Memory
208631 2020-03-12T00:04:22 Z eriksuenderhauf Just Long Neckties (JOI20_ho_t1) C++11
100 / 100
 170 ms 7160 KB 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)(x).size()
#define trav(x, a) for (const auto& x: a)
#define pii pair<int,int>
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
int a[N], b[N], ind[N];
int mP[N], mS[N], ans[N];

int main() {
  int n; scanf("%d", &n);
  for (int i = 0; i <= n; i++)
    scanf("%d", a+i), ind[i] = i;
  for (int i = 0; i < n; i++)
    scanf("%d", b+i);
  sort(b,b+n);
  sort(ind,ind+n+1,[](int l, int r) {
    return a[l] < a[r];
  });
  for (int i = 0; i < n; i++)
    mP[i] = !i ? max(a[ind[i]]-b[i],0) : max(mP[i-1], max(a[ind[i]]-b[i],0));
  for (int i = n; i; i--)
    mS[i] = i==n ? max(a[ind[i]]-b[i-1],0) : max(mS[i+1], max(a[ind[i]]-b[i-1],0));
  ans[ind[0]] = mS[1];
  for (int i = 1; i < n; i++)
    ans[ind[i]] = max(mP[i-1],mS[i+1]);
  ans[ind[n]] = mP[n-1];
  for (int i = 0; i <= n; i++)
    printf("%d ", ans[i]);
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:17:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n; scanf("%d", &n);
          ~~~~~^~~~~~~~~~
ho_t1.cpp:19:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", a+i), ind[i] = i;
     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~
ho_t1.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", b+i);
     ~~~~~^~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 380 KB Output is correct
13 Correct 5 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 7 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 6 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 133 ms 6392 KB Output is correct
34 Correct 143 ms 6636 KB Output is correct
35 Correct 135 ms 6392 KB Output is correct
36 Correct 135 ms 6904 KB Output is correct
37 Correct 145 ms 7160 KB Output is correct
38 Correct 144 ms 6908 KB Output is correct
39 Correct 139 ms 6008 KB Output is correct
40 Correct 136 ms 6096 KB Output is correct
41 Correct 137 ms 6136 KB Output is correct
42 Correct 135 ms 6136 KB Output is correct
43 Correct 142 ms 6200 KB Output is correct
44 Correct 135 ms 5692 KB Output is correct
45 Correct 132 ms 5752 KB Output is correct
46 Correct 130 ms 5752 KB Output is correct
47 Correct 101 ms 5624 KB Output is correct
48 Correct 103 ms 5624 KB Output is correct
49 Correct 137 ms 6264 KB Output is correct
50 Correct 170 ms 6264 KB Output is correct
51 Correct 141 ms 6136 KB Output is correct
52 Correct 138 ms 6136 KB Output is correct
53 Correct 139 ms 6136 KB Output is correct