제출 #553783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
553783		hibiki	Safety (NOI18_safety)	C++11	100 / 100	57 ms	5432 KiB

safety

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

int main()
{
    int N;
    long long H,s,shift=0,y_min=0;
    priority_queue<long long> L,R;
    scanf("%d %lld",&N,&H);
    scanf("%lld",&s);
    L.push(s);
    R.push(-s);
    for(int i=2;i<=N;i++)
    {
        shift+=H;
        long long ll = L.top() - shift;
        long long rr = -R.top() + shift;
        scanf("%d",&s);
        if(s<ll)
        {
            y_min += ll - s;
            L.push(s + shift);
            L.push(s + shift);
            L.pop();
            R.push(-(ll - shift));
        }
        else if(s>rr)
        {
            y_min += s - rr;
            R.push(-(s - shift));
            R.push(-(s - shift));
            R.pop();
            L.push(rr + shift);
        }
        else
        {
            L.push(s + shift);
            R.push(-(s - shift));
        }
    }
    printf("%lld\n",y_min);
    return 0;
}

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

safety.cpp: In function 'int main()':
safety.cpp:18:17: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   18 |         scanf("%d",&s);
      |                ~^  ~~
      |                 |  |
      |                 |  long long int*
      |                 int*
      |                %lld
safety.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %lld",&N,&H);
      |     ~~~~~^~~~~~~~~~~~~~~~~
safety.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%lld",&s);
      |     ~~~~~^~~~~~~~~~~
safety.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf("%d",&s);
      |         ~~~~~^~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29