oj.uz

Submission #202448

# Submission time Handle Problem Language Result Execution time Memory
202448 2020-02-16T07:22:25 Z Kastanda Just Long Neckties (JOI20_ho_t1) C++11
100 / 100
 142 ms 7112 KB 
// In The Name Of The Queen
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N = 200005;
int n, B[N], P[N], S[N], R[N];
pair < int , int > A[N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n + 1; i ++)
        scanf("%d", &A[i].x), A[i].y = 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 ++)
        P[i] = max(P[i - 1], A[i].x - B[i]);
    for (int i = n; i; i --)
        S[i] = max(S[i + 1], A[i + 1].x - B[i]);
    for (int i = 1; i <= n + 1; i ++)
        R[A[i].y] = max(P[i - 1], S[i]);
    for (int i = 1; i <= n + 1; i ++)
        printf("%d ", R[i]);
    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
ho_t1.cpp:13:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i].x), A[i].y = i;
         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
ho_t1.cpp:15:14: 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 5 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 376 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 5 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 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 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 6 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 6 ms 376 KB Output is correct
23 Correct 7 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 380 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 5 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 5 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 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 380 KB Output is correct
15 Correct 5 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 6 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 6 ms 376 KB Output is correct
23 Correct 7 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 6 ms 380 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 5 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 130 ms 6368 KB Output is correct
34 Correct 137 ms 6648 KB Output is correct
35 Correct 130 ms 6348 KB Output is correct
36 Correct 133 ms 6776 KB Output is correct
37 Correct 133 ms 7032 KB Output is correct
38 Correct 133 ms 7112 KB Output is correct
39 Correct 130 ms 6008 KB Output is correct
40 Correct 132 ms 6080 KB Output is correct
41 Correct 132 ms 6112 KB Output is correct
42 Correct 129 ms 6136 KB Output is correct
43 Correct 134 ms 6136 KB Output is correct
44 Correct 127 ms 5752 KB Output is correct
45 Correct 128 ms 5752 KB Output is correct
46 Correct 128 ms 5756 KB Output is correct
47 Correct 124 ms 5624 KB Output is correct
48 Correct 113 ms 5624 KB Output is correct
49 Correct 137 ms 6136 KB Output is correct
50 Correct 142 ms 6268 KB Output is correct
51 Correct 138 ms 6264 KB Output is correct
52 Correct 134 ms 6264 KB Output is correct
53 Correct 135 ms 6264 KB Output is correct