oj.uz

답안 #224018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224018 2020-04-17T04:48:40 Z dantoh000 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 142 ms 7036 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
typedef pair<int,int> ii;
ii a[N];
int b[N];
int l[N], r[N];
int ans[N];
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++){
        l[i] = max(l[i-1],max(0,a[i].first-b[i]));
    }
    for (int i = n; i >= 1; i--){
        //printf("%d %d\n",a[i+1].first,b[i]);
        r[i] = max(r[i+1],max(0,a[i+1].first-b[i]));
    }

    for (int i = 1; i <= n; i++){
        //printf("%d %d %d\n",i,l[i],r[i+1]);
    }
    for (int i = 1; i <= n+1; i++){
        //printf("%d %d\n",a[i].first,a[i].second);
        ans[a[i].second] = max(l[i-1],r[i]);
    }
    for (int i = 1; i <= n+1; i++) printf("%d ",ans[i]);
}

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:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~
ho_t1.cpp:17: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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 133 ms 6396 KB Output is correct
34 Correct 142 ms 6556 KB Output is correct
35 Correct 135 ms 6392 KB Output is correct
36 Correct 134 ms 6776 KB Output is correct
37 Correct 137 ms 7036 KB Output is correct
38 Correct 138 ms 6944 KB Output is correct
39 Correct 133 ms 6136 KB Output is correct
40 Correct 133 ms 6008 KB Output is correct
41 Correct 137 ms 6228 KB Output is correct
42 Correct 136 ms 6136 KB Output is correct
43 Correct 136 ms 6136 KB Output is correct
44 Correct 133 ms 5752 KB Output is correct
45 Correct 134 ms 5752 KB Output is correct
46 Correct 137 ms 5752 KB Output is correct
47 Correct 115 ms 5624 KB Output is correct
48 Correct 119 ms 5624 KB Output is correct
49 Correct 139 ms 6136 KB Output is correct
50 Correct 141 ms 6344 KB Output is correct
51 Correct 138 ms 6136 KB Output is correct
52 Correct 136 ms 6264 KB Output is correct
53 Correct 138 ms 6136 KB Output is correct