답안 #224022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224022 2020-04-17T05:03:43 Z SomeoneUnknown Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
165 ms 7164 KB
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;

ii mii(int a, int b){
    return make_pair(a,b);
}

int main(){
    int n;
    scanf("%d", &n);
    ii nnt[n+1];
    int ont[n];
    for(int i = 0; i <= n; i++){
        int x;
        scanf("%d", &x);
        nnt[i] = mii(x, i);
    }
    for(int i = 0; i < n; i++) scanf("%d", &ont[i]);
    sort(nnt, nnt+n+1);
    sort(ont, ont+n);
    ii dffs[n];
    for(int i = 0; i < n; i++){
        dffs[i] = mii(max(nnt[i+1].first-ont[i], 0), i);
    }
    sort(dffs, dffs+n);
    int rsidep = n-1;
    int lsidemax = 0;
    int ans[n+1];
    //printf("%d", dffs[rsidep].first);
    ans[nnt[0].second] = dffs[rsidep].first;
    for(int i = 0; i < n; i++){
        while(rsidep >= 0 && dffs[rsidep].second <= i){
            rsidep--;
        }
        lsidemax = max(lsidemax, nnt[i].first-ont[i]);
        ans[nnt[i+1].second] = lsidemax;
        if(rsidep >= 0) ans[nnt[i+1].second] = max(dffs[rsidep].first, lsidemax);
        //printf("%d %d  ", dffs[rsidep].first,)
    //printf("\n");
    }
    for(int i = 0; i <= n; i++){
        printf("%d ", ans[i]);
    }
}
/*
3
7 3 4 6
2 6 4
*/

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
ho_t1.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
         ~~~~~^~~~~~~~~~
ho_t1.cpp:20:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; i++) scanf("%d", &ont[i]);
                                ~~~~~^~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 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 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 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 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 6 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 6 ms 384 KB Output is correct
23 Correct 5 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
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 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 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 6 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 6 ms 384 KB Output is correct
23 Correct 5 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 151 ms 6264 KB Output is correct
34 Correct 153 ms 6520 KB Output is correct
35 Correct 149 ms 6436 KB Output is correct
36 Correct 146 ms 6752 KB Output is correct
37 Correct 163 ms 7164 KB Output is correct
38 Correct 153 ms 7032 KB Output is correct
39 Correct 155 ms 6008 KB Output is correct
40 Correct 156 ms 6008 KB Output is correct
41 Correct 156 ms 6008 KB Output is correct
42 Correct 156 ms 6008 KB Output is correct
43 Correct 157 ms 6008 KB Output is correct
44 Correct 135 ms 5624 KB Output is correct
45 Correct 142 ms 5752 KB Output is correct
46 Correct 140 ms 5696 KB Output is correct
47 Correct 130 ms 5612 KB Output is correct
48 Correct 130 ms 5624 KB Output is correct
49 Correct 163 ms 6136 KB Output is correct
50 Correct 160 ms 6264 KB Output is correct
51 Correct 161 ms 6264 KB Output is correct
52 Correct 165 ms 6136 KB Output is correct
53 Correct 160 ms 6264 KB Output is correct