oj.uz

Submission #202625

# Submission time Handle Problem Language Result Execution time Memory
202625 2020-02-17T11:27:58 Z SamAnd Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 145 ms 7032 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct ban
{
    int x, i;
};
bool operator<(const ban& a, const ban& b)
{
    return a.x < b.x;
}

int n;
ban a[N];
int b[N];

int p[N], s[N];

int ans[N];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n + 1; ++i)
    {
        a[i].i = i;
        scanf("%d", &a[i].x);
    }
    for (int i = 1; i <= n; ++i)
        scanf("%d", &b[i]);
    sort(a + 1, a + n + 1 + 1);
    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 + 1; i >= 2; --i)
    {
        s[i] = max(s[i + 1], a[i].x - b[i - 1]);
    }
    for (int i = 1; i <= n + 1; ++i)
        ans[a[i].i] = max(p[i - 1], s[i + 1]);
    for (int i = 1; i <= n + 1; ++i)
        printf("%d ", ans[i]);
    printf("\n");
    return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
ho_t1.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i].x);
         ~~~~~^~~~~~~~~~~~~~~
ho_t1.cpp:29: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 4 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 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 4 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 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 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 6 ms 504 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 6 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 6 ms 380 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 4 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 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 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 6 ms 504 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 6 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 6 ms 380 KB Output is correct
31 Correct 6 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 132 ms 6452 KB Output is correct
34 Correct 140 ms 6520 KB Output is correct
35 Correct 132 ms 6392 KB Output is correct
36 Correct 130 ms 6904 KB Output is correct
37 Correct 141 ms 7032 KB Output is correct
38 Correct 142 ms 6928 KB Output is correct
39 Correct 145 ms 6136 KB Output is correct
40 Correct 144 ms 6008 KB Output is correct
41 Correct 135 ms 6136 KB Output is correct
42 Correct 141 ms 6136 KB Output is correct
43 Correct 134 ms 5984 KB Output is correct
44 Correct 136 ms 5728 KB Output is correct
45 Correct 136 ms 5752 KB Output is correct
46 Correct 133 ms 5752 KB Output is correct
47 Correct 111 ms 5624 KB Output is correct
48 Correct 117 ms 5624 KB Output is correct
49 Correct 140 ms 6264 KB Output is correct
50 Correct 138 ms 6136 KB Output is correct
51 Correct 135 ms 6240 KB Output is correct
52 Correct 142 ms 6180 KB Output is correct
53 Correct 143 ms 6240 KB Output is correct