제출 #293887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293887		AaronNaidu	Sails (IOI07_sails)	C++14	40 / 100	1095 ms	8036 KiB

sails

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll n, a, b, finAns;
vector<pair<ll, ll> > masts;
set<pair<pair<ll, ll>, ll> > numAtHeight;

int main() {
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a >> b;
        masts.push_back({a, b});
    }
    sort(masts.begin(), masts.end());
    finAns = 0;
    ll prevHeight = 0;
    ll index = -1;
    for (auto i : masts)
    {
        index++;
        ll numFlags = i.second;
        if(i.first > prevHeight) {
            while (prevHeight < i.first and numFlags > 0)
            {
                numAtHeight.insert({{1, prevHeight}, index});
                numFlags--;
                prevHeight++;
            }
        }
        auto it = numAtHeight.begin();
        while (numFlags > 0)
        {
            auto n = next(it, 1);
            if (it->second != index)
            {
                finAns += it->first.first;
                numAtHeight.insert({{it->first.first+1, it->first.second}, index});
                numAtHeight.erase(it);
                numFlags--;
            }
            it = n;
        }
    }
    cout << finAns << "\n";
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10