Submission #1294602

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294602		tudor_costin	Sails (IOI07_sails)	C++20	40 / 100	1096 ms	131072 KiB

sails

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int Nmax=1e5+5;
vector<int> poz[Nmax];
pair<int,int> a[Nmax];
signed main()
{
    int n;
    cin>>n;
    int maxi=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].first>>a[i].second;
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    {
        int h=a[i].first,k=a[i].second;
        if(h!=a[i-1].first)
        {
            for(int j=a[i-1].first+1;j<=h;j++) poz[0].push_back(j);
        }
        vector<pair<int,int>> chpoz;
        for(int cnt=0;cnt<=maxi;cnt++)
        {
            while(!poz[cnt].empty() && k>0)
            {
                int x=poz[cnt].back();
                chpoz.push_back({x,cnt});
                poz[cnt].pop_back();
                k--;
            }
        }
        for(auto [x,cnt]:chpoz)
        {
            poz[cnt+1].push_back(x);
            maxi=max(maxi,cnt+1);
        }
    }
    int ans=0;
    for(int cnt=0;cnt<=maxi;cnt++)
    {
        int nums=poz[cnt].size();
        ans+=nums*cnt*(cnt-1)/2;
    }
    cout<<ans<<'\n';
    return 0;
}

• 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