제출 #146587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
146587		gs14004	Safety (NOI18_safety)	C++17	100 / 100	82 ms	6292 KiB

safety

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 250005;

int n, h, x[MAXN], y[MAXN];

struct pque{
	bool neg;
	lint offset = 0;
	priority_queue<lint> pq;
	void push(lint x){
		if(neg) x = -x;
		pq.push(x - offset);
	}
	lint top(){
		lint x = pq.top() + offset;
		if(neg) x = -x;
		return x;
	}
	void pop(){
		pq.pop();
	}
	void add_offset(lint x){
		if(neg) x = -x;
		offset += x;
	}
}pql, pqr;

int main(){
	scanf("%d %d",&n,&h);
	lint ans = 0;
	pqr.neg = 1;
	for(int i=0; i<n; i++){
		scanf("%d",&x[i]);
		y[i] = h;
		if(i > 0){
			pql.add_offset(-y[i]);
			pqr.add_offset(y[i - 1]);
			if(pqr.top() < x[i]){
				ans += x[i] - pqr.top();
				pqr.push(x[i]);
				pqr.push(x[i]);
				pql.push(pqr.top());
				pqr.pop();
			}
			else if(pql.top() > x[i]){
				ans += pql.top() - x[i];
				pql.push(x[i]);
				pql.push(x[i]);
				pqr.push(pql.top());
				pql.pop();
			}
			else{
				pql.push(x[i]);
				pqr.push(x[i]);
			}
		}
		else{
			pql.push(x[i]);
			pqr.push(x[i]);
		}
	}
	cout << ans << endl;
}

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

safety.cpp: In function 'int main()':
safety.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&h);
  ~~~~~^~~~~~~~~~~~~~~
safety.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x[i]);
   ~~~~~^~~~~~~~~~~~

• 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