提出 #73260668

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll infl = 1LL << 60;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define drep(i, n) for (ll i = (ll)n-1; i >= 0; i--)
#define nfor(i, start, n) for (ll i = (ll)start; i < (ll)n; i++)
#define dfor(i, start, n) for (ll i = (ll)start-1; i >= (ll)n; i--)

int main() {
    ll n,k; cin >> n >> k;
    vl a(n); rep(i,n) cin >> a[i];
    priority_queue<pair<ll,ll>> pq;
    rep(i,n) pq.push({a[i],i});
    ll ans = 0;
    while(!pq.empty()) {
        ll p, idx;
        tie(p,idx) = pq.top();
        pq.pop();
        if (a[idx] != p) continue;

        ll left = idx-1;
        ll right = idx+1;
        if (0 <= left && p-a[left] > k) {
            ans += p-a[left]-k;
            a[left] = p-k;
            pq.push({a[left],left});
        }
        if (right < n && p-a[right] > k) {
            ans += p-a[right]-k;
            a[right] = p-k;
            pq.push({a[right],right});
        }
    }
    cout << ans << endl;
}

提出情報

提出日時
問題 C - 階段状の花壇
ユーザ okku_n9
言語 C++23 (GCC 15.2.0)
得点 333
コード長 1091 Byte
結果 AC
実行時間 106 ms
メモリ 9216 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 333 / 333
結果
AC × 3
AC × 75
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3408 KiB
in02.txt AC 1 ms 3496 KiB
in03.txt AC 1 ms 3408 KiB
in04.txt AC 1 ms 3408 KiB
in05.txt AC 1 ms 3580 KiB
in06.txt AC 1 ms 3652 KiB
in07.txt AC 1 ms 3592 KiB
in08.txt AC 1 ms 3600 KiB
in09.txt AC 106 ms 9184 KiB
in10.txt AC 69 ms 9112 KiB
in11.txt AC 101 ms 9184 KiB
in12.txt AC 93 ms 9168 KiB
in13.txt AC 96 ms 9212 KiB
in14.txt AC 96 ms 9164 KiB
in15.txt AC 1 ms 3520 KiB
in16.txt AC 73 ms 9188 KiB
in17.txt AC 1 ms 3448 KiB
in18.txt AC 84 ms 9192 KiB
in19.txt AC 74 ms 9112 KiB
in20.txt AC 86 ms 9112 KiB
in21.txt AC 101 ms 9048 KiB
in22.txt AC 58 ms 9196 KiB
in23.txt AC 101 ms 9200 KiB
in24.txt AC 1 ms 3584 KiB
in25.txt AC 1 ms 3452 KiB
in26.txt AC 69 ms 9164 KiB
in27.txt AC 1 ms 3592 KiB
in28.txt AC 1 ms 3652 KiB
in29.txt AC 1 ms 3448 KiB
in30.txt AC 1 ms 3608 KiB
in31.txt AC 1 ms 3544 KiB
in32.txt AC 1 ms 3668 KiB
in33.txt AC 1 ms 3372 KiB
in34.txt AC 1 ms 3680 KiB
in35.txt AC 1 ms 3452 KiB
in36.txt AC 1 ms 3652 KiB
in37.txt AC 1 ms 3584 KiB
in38.txt AC 1 ms 3652 KiB
in39.txt AC 1 ms 3544 KiB
in40.txt AC 1 ms 3584 KiB
in41.txt AC 97 ms 9040 KiB
in42.txt AC 72 ms 8772 KiB
in43.txt AC 97 ms 9192 KiB
in44.txt AC 1 ms 3420 KiB
in45.txt AC 1 ms 3544 KiB
in46.txt AC 77 ms 9192 KiB
in47.txt AC 1 ms 3580 KiB
in48.txt AC 1 ms 3592 KiB
in49.txt AC 98 ms 9108 KiB
in50.txt AC 83 ms 9216 KiB
in51.txt AC 85 ms 9176 KiB
in52.txt AC 93 ms 9108 KiB
in53.txt AC 95 ms 9192 KiB
in54.txt AC 86 ms 9172 KiB
in55.txt AC 1 ms 3580 KiB
in56.txt AC 1 ms 3580 KiB
in57.txt AC 28 ms 6336 KiB
in58.txt AC 28 ms 6372 KiB
in59.txt AC 1 ms 3408 KiB
in60.txt AC 1 ms 3452 KiB
in61.txt AC 1 ms 3488 KiB
in62.txt AC 1 ms 3408 KiB
in63.txt AC 1 ms 3608 KiB
in64.txt AC 1 ms 3624 KiB
in65.txt AC 1 ms 3452 KiB
in66.txt AC 1 ms 3452 KiB
in67.txt AC 1 ms 3680 KiB
in68.txt AC 1 ms 3624 KiB
in69.txt AC 1 ms 3580 KiB
in70.txt AC 1 ms 3496 KiB
in71.txt AC 1 ms 3680 KiB
in72.txt AC 87 ms 9168 KiB
sample01.txt AC 1 ms 3580 KiB
sample02.txt AC 1 ms 3488 KiB
sample03.txt AC 1 ms 3496 KiB