oj.uz

Submission #1024074

# Submission time Handle Problem Language Result Execution time Memory
1024074 2024-07-15T11:06:02 Z lucri Sails (IOI07_sails) C++17
80 / 100
 1000 ms 5112 KB 
#include <iostream>
#include <algorithm>
using namespace std;
unsigned int n,hmax,cost,length;
unsigned long long ans;
unsigned int lss,ls,h,w;
pair<unsigned int,unsigned int>v[100010];
pair<unsigned int,unsigned int>tr;
pair<unsigned int,unsigned int>s[100010];
pair<unsigned int,unsigned int>ss[100010];
void qsort(int b,int e)
{
    if(b>=e)
        return;
    int bb=b,ee=e,adb=1,ade=0;
    while(bb<ee)
    {
        if(v[bb].first>v[ee].first)
        {
            tr=v[bb];
            v[bb]=v[ee];
            v[ee]=tr;
            adb=1-adb;
            ade=1-ade;
        }
        bb+=adb;
        ee-=ade;
    }
    qsort(b,bb-1);
    qsort(bb+1,e);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    srand(time(NULL));
    cin>>n;
    for(int i=1;i<=n;++i)
        cin>>v[i].first>>v[i].second;
    swap(v[1],v[rand()%n+1]);
    qsort(1,n);
    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;
                break;
            }
        }
        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;
}

Compilation message

sails.cpp: In function 'int main()':
sails.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   39 |     for(int i=1;i<=n;++i)
      |                 ~^~~
sails.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   43 |     for(int i=1;i<=n;++i)
      |                 ~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 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 0 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 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 16 ms 2392 KB Output is correct
2 Correct 59 ms 2392 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 781 ms 2644 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 2520 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 2516 KB Output is correct
2 Correct 917 ms 5112 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 2628 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 1036 ms 2704 KB Time limit exceeded
2 Halted 0 ms 0 KB -