oj.uz

Submission #204687

# Submission time Handle Problem Language Result Execution time Memory
204687 2020-02-26T16:48:29 Z my99n Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 149 ms 7032 KB 
#include<bits/stdc++.h>
using namespace std;

int b[200100], c[200100], d[200100], ans[200100];
pair<int,int> a[200100];

int main(){
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n+1; i++) scanf("%d", &a[i].first), a[i].second = i;
    for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
    sort(a+1, a+n+2); sort(b+1, b+n+1);
    for (int i = 1; i <= n; i++) c[i] = max(a[i].first-b[i], 0), c[i] = max(c[i], c[i-1]);
    for (int i = n; i >= 1; i--) d[i] = max(a[i+1].first-b[i], 0), d[i] = max(d[i], d[i+1]);
    for (int i = 1; i <= n+1; i++) ans[a[i].second] = max(c[i-1], d[i]);
    for (int i = 1; i <= n+1; i++) printf("%d ", ans[i]);
    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
ho_t1.cpp:10:60: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n+1; i++) scanf("%d", &a[i].first), a[i].second = i;
                                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
ho_t1.cpp:11:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 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 7 ms 504 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 6 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 372 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 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 380 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 380 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 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 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 7 ms 504 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 6 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 372 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 6 ms 376 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 6 ms 380 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 140 ms 6392 KB Output is correct
34 Correct 143 ms 6520 KB Output is correct
35 Correct 139 ms 6392 KB Output is correct
36 Correct 138 ms 6904 KB Output is correct
37 Correct 141 ms 7032 KB Output is correct
38 Correct 142 ms 7004 KB Output is correct
39 Correct 139 ms 6008 KB Output is correct
40 Correct 139 ms 6008 KB Output is correct
41 Correct 141 ms 6264 KB Output is correct
42 Correct 139 ms 6136 KB Output is correct
43 Correct 139 ms 6012 KB Output is correct
44 Correct 135 ms 5756 KB Output is correct
45 Correct 135 ms 5752 KB Output is correct
46 Correct 137 ms 5752 KB Output is correct
47 Correct 120 ms 5624 KB Output is correct
48 Correct 119 ms 5624 KB Output is correct
49 Correct 141 ms 6180 KB Output is correct
50 Correct 149 ms 6164 KB Output is correct
51 Correct 142 ms 6264 KB Output is correct
52 Correct 142 ms 6136 KB Output is correct
53 Correct 140 ms 6268 KB Output is correct