oj.uz

답안 #422906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422906 2021-06-10T13:54:29 Z maomao90 Safety (NOI18_safety) C++17
0 / 100
 25 ms 6080 KB 
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 200005

int n, h;
int s[MAXN];
priority_queue<ll> lft;
priority_queue<ll, vll, greater<ll>> rht;
ll c;
ll lazy;

int main() {
	scanf("%d%d", &n, &h);
	REP (i, 0, n) {
		scanf("%d", &s[i]);
	}
	rht.push(s[0]);
	lft.push(s[0]);
	REP (i, 1, n) {
		lazy += h;
		ll lv = lft.top() - lazy, rv = rht.top() + lazy;
		if (s[i] >= lv && s[i] <= rv) {
			lft.push(s[i] + lazy);
			rht.push(s[i] - lazy);
		} else if (s[i] < lv) {
			lft.push(s[i] + lazy);
			lft.push(s[i] + lazy);
			c += lv - s[i];
			rht.push(lv - lazy);
		} else {
			rht.push(s[i] - lazy);
			rht.push(s[i] - lazy);
			c += s[i] - rv;
			lft.push(rv + lazy);
		}
		//printf(" %lld\n", c);
		//auto tmp = lft;
		//while (!tmp.empty()) {
			//printf("%lld\n", tmp.top() - lazy); tmp.pop();
		//}
		//printf("\n");
		//auto tmpp = rht;
		//while (!tmpp.empty()) {
			//printf("%lld\n", tmpp.top() + lazy); tmpp.pop();
		//}
		//printf("\n");
	}
	printf("%lld\n", c);
	return 0;
}

Compilation message

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

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 6080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -