oj.uz

Submission #1024057

# Submission time Handle Problem Language Result Execution time Memory
1024057 2024-07-15T10:51:30 Z lucri Sails (IOI07_sails) C++11
80 / 100
 1000 ms 2640 KB 
#include <iostream>
#include <algorithm>
using namespace std;
int n,hmax,cost,length;
long long ans;
int lss,ls,h,w;
pair<int,int>v[100010],ss[100010],s[100010];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>v[i].first>>v[i].second;
    sort(v+1,v+n+1);
    for(int i=1;i<=n;++i)
    {
        h=v[i].first;
        w=v[i].second;
        if(h>hmax)
        {
            cost=0;
            length=h-hmax;
            if(ls&&cost==s[ls].first)
            {
                length+=s[ls].second;
                --ls;
            }
            s[++ls]={cost,length};
            hmax=h;
        }
        while(w)
        {
            if(w>=s[ls].second)
            {
                ss[++lss]={s[ls].first+1,s[ls].second};
                ans+=1LL*s[ls].first*s[ls].second;
                w-=s[ls].second;
                --ls;
            }
            else
            {
                ans+=1LL*w*s[ls].first;
                ss[++lss]={s[ls].first,s[ls].second-w};
                ss[++lss]={s[ls].first+1,w};
                w=0;
                --ls;
            }
        }
        cost=ss[lss].first;
        length=ss[lss].second;
        if(ls&&cost==s[ls].first)
        {
            length+=s[ls].second;
            --ls;
        }
        s[++ls]={cost,length};
        --lss;
        if(lss)
        {
            cost=ss[lss].first;
            length=ss[lss].second;
            if(ls&&cost==s[ls].first)
            {
                length+=s[ls].second;
                --ls;
            }
            s[++ls]={cost,length};
            --lss;
            if(lss)
            {
                cost=ss[lss].first;
                length=ss[lss].second;
                if(ls&&cost==s[ls].first)
                {
                    length+=s[ls].second;
                    --ls;
                }
                s[++ls]={cost,length};
                --lss;
                while(lss)
                {
                    s[++ls]={ss[lss].first,ss[lss].second};
                    --lss;
                }
            }
        }
    }
    cout<<ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2488 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2396 KB Output is correct
2 Correct 64 ms 2528 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 727 ms 2556 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 2392 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 2508 KB Output is correct
2 Correct 494 ms 2512 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 2604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 2640 KB Time limit exceeded
2 Halted 0 ms 0 KB -