제출 #261749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261749		cheeheng	Climbers (RMI18_climbers)	C++14	0 / 100	1099 ms	198904 KiB

climbers

#include <bits/stdc++.h>
using namespace std;

int h[5005];
int h3[5005];

int h2[25000005];

int main(){
    int N;
    scanf("%d", &N);

    for(int i = 0; i < N; i ++){
        scanf("%d", &h[i]);
    }


    /*
    h3[0] = h[0];
    h3[1] = h[1];
    for(int i = 2; i < N; i ++){
        if(h)
    }
    */

    int M = 1;
    h2[0] = 0;
    for(int i = 0; i < N-1; i ++){
        if(h[i] < h[i+1]){
            for(int j = h[i]+1; j <= h[i+1]; j ++){
                h2[M++] = j;
            }
        }else if(h[i] > h[i+1]){
            for(int j = h[i]-1; j >= h[i+1]; j --){
                h2[M++] = j;
            }
        }
    }

    /*
    for(int i = 0; i < M; i ++){
        printf("%d ", h2[i]);
    }
    printf("\n");
    */

    for(int i = 0; i < M; i ++){
        //printf("h2[%d]=%d\n", i, h2[i]);
    }

    long long ans = 0;
    int A = 0;
    int B = M-1;
    while(A < B){
        //printf("while loop: %d %d %lld\n", A, B, ans);
        //if(ans > 100){break;}
        if(h2[A+1] == h2[B-1]){
            A ++;
            B --;
            ans ++;
            continue;
        }
        if(h2[A-1] == h2[B-1]){
            while(h2[A-1] == h2[B-1]){
                A --;
                B --;
                ans ++;
            }
        }else{
            while(h2[A+1] == h2[B+1]){
                A ++;
                B ++;
                ans ++;
            }
        }
    }

    printf("%lld\n", ans);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

climbers.cpp: In function 'int main()':
climbers.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
climbers.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &h[i]);
         ~~~~~^~~~~~~~~~~~~

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 50