Submission #1023936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023936		lucri	Sails (IOI07_sails)	C++17	50 / 100	1068 ms	2900 KiB

sails

#include <bits/stdc++.h>
using namespace std;
long long n,hmax;
long long ans;
struct barci{int h;long long w;}v[100010];
stack<pair<long long,long long>>s,ss;
bool comp(barci a,barci b)
{
    return a.h<b.h;
}
void adauga(long long cost,long long length)
{
    if(!s.empty()&&cost==s.top().first)
    {
        length+=s.top().second;
        s.pop();
    }
    s.push({cost,length});
}
int main()
{
    cin>>n;
    for(long long i=1;i<=n;++i)
        cin>>v[i].h>>v[i].w;
    sort(v+1,v+n+1,comp);
    for(long long i=1;i<=n;++i)
    {
        if(v[i].h>hmax)
        {
            adauga(0,v[i].h-hmax);
            hmax=v[i].h;
        }
        while(v[i].w)
        {
            if(v[i].w>=s.top().second)
            {
                ss.push({s.top().first+1,s.top().second});
                ans+=s.top().first*s.top().second;
                v[i].w-=s.top().second;
                s.pop();
            }
            else
            {
                ans+=v[i].w*s.top().first;
                ss.push({s.top().first,s.top().second-v[i].w});
                ss.push({s.top().first+1,v[i].w});
                v[i].w=0;
                s.pop();
            }
        }
        while(!ss.empty())
        {
            adauga(ss.top().first,ss.top().second);
            ss.pop();
        }
    }
    cout<<ans;
    return 0;
}

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