Submission #1200123

#TimeUsernameProblemLanguageResultExecution timeMemory
1200123thieunguyenhuySafety (NOI18_safety)C++20
33 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define POPCOUNT(n) (__builtin_popcountll((n))) #define CLZ(n) (__builtin_clzll((n))) #define CTZ(n) (__builtin_ctzll((n))) #define LOG(n) (63 - __builtin_clzll((n))) #define BIT(n, i) (((n) >> (i)) & 1ll) #define MASK(i) (1ll << (i)) #define FLIP(n, i) ((n) ^ (1ll << (i))) #define ON(n, i) ((n) | MASK(i)) #define OFF(n, i) ((n) & ~MASK(i)) #define Int __int128 #define fi first #define se second typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pii; typedef pair<long long, long long> pll; typedef pair<long long, int> pli; typedef pair<int, long long> pil; typedef vector<pair<int, int>> vii; typedef vector<pair<long long, long long>> vll; typedef vector<pair<long long, int>> vli; typedef vector<pair<int, long long>> vil; template <class T1, class T2> bool maximize(T1 &x, T2 y) { if (x < y) { x = y; return true; } return false; } template <class T1, class T2> bool minimize(T1 &x, T2 y) { if (x > y) { x = y; return true; } return false; } template <class T> void remove_duplicate(vector<T> &ve) { sort (ve.begin(), ve.end()); ve.resize(unique(ve.begin(), ve.end()) - ve.begin()); } mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); template <class T1, class T2> T1 random(T1 l, T2 r) { return uniform_int_distribution<T1>(l, r)(rng); } template <class T> T random(T r) { return rng() % r; } const int N = 500 + 5; const int MOD = 1e9 + 7; const int inf = 1e9; const long long INF = 1e18; int n, h; int a[N], dp[N][N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> h; for (int i = 1; i <= n; ++i) { cin >> a[i]; } priority_queue<ll> leftPoints; priority_queue<ll, vector<ll>, greater<ll>> rightPoints; ll middle_b = 0; // middle_slope always = 0 ll shift = h; leftPoints.emplace(a[1]); rightPoints.emplace(a[1]); for (int i = 2; i <= n; ++i) { ll l = leftPoints.top() - shift; ll r = rightPoints.top() + shift; if (l <= a[i] && a[i] <= r) { leftPoints.emplace(a[i] + shift); rightPoints.emplace(a[i] - shift); } else if (a[i] < l) { leftPoints.emplace(a[i] + shift); leftPoints.emplace(a[i] + shift); middle_b += abs(l - a[i]); rightPoints.emplace(l - shift); leftPoints.pop(); } else { rightPoints.emplace(a[i] - shift); rightPoints.emplace(a[i] - shift); middle_b += abs(r - a[i]); leftPoints.emplace(r + shift); rightPoints.pop(); } shift += h; } cout << middle_b << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...