Submission #232126

#	Time	Username	Problem	Language	Result	Execution time	Memory
232126		Kubalionzzale	Safety (NOI18_safety)	C++14	100 / 100	159 ms	3696 KiB

safety

#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>

using ll = long long int;

ll h;

int main()
{
    std::priority_queue<ll> leftprioq;

    std::priority_queue<ll,
                        std::vector<ll>,
                        std::greater<ll> > rightprioq;

    ll n, x, ans = 0;
    std::cin >> n >> h;

    std::cin >> x;
    leftprioq.push(x);
    rightprioq.push(x);

    for (int i = 1; i < n; ++i)
    {
        std::cin >> x;
        ll leftnodepos = leftprioq.top() - h*i;
        ll rightnodepos = rightprioq.top() + h*i;

    //    std::cout << "i: " << i << "\n";
      //  std::cout << "borders: " << leftelem.curtimepos(i) << " " << rightelem.curtimepos(i) << "\n";
        if (x < leftnodepos)
        {
            leftprioq.pop();

            leftprioq.push(x + h * i);
            leftprioq.push(x + h * i);

            ans += leftnodepos - x;

    //        std::cout << "left: " << nextleftpos << " " << leftnodepos << "\n";

            rightprioq.push(leftnodepos - h * i);
        }
        else if (x > rightnodepos)
        {
            rightprioq.pop();

            rightprioq.push(x - h*i);
            rightprioq.push(x - h*i);

            ans += x - rightnodepos;
      //      std::cout << "right: " << rightnodepos << " " << nextrightpos << "\n";

            leftprioq.push(rightnodepos + h * i);
        }
        else
        {
            leftprioq.push(x + h *i);
            rightprioq.push(x-h*i);
        }
    }

    std::cout << ans;
}

• 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