oj.uz

Submission #1023988

# Submission time Handle Problem Language Result Execution time Memory
1023988 2024-07-15T10:26:46 Z lucri Sails (IOI07_sails) C++14
70 / 100
 1000 ms 3776 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,hmax;
long long ans,h,w;
long long v[100010],lss,ls;
pair<long long,long long>ss[110],s[100010];
static inline void adauga(long long cost,long long length)
{
    if(ls&&cost==s[ls].first)
    {
        length+=s[ls].second;
        --ls;
    }
    s[++ls]={cost,length};
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    for(long long i=1;i<=n;++i)
    {
        cin>>h>>w;
        v[i]=h*1000000+w;
    }
    sort(v+1,v+n+1);
    for(long long i=1;i<=n;++i)
    {
        h=v[i]/1000000;
        w=v[i]%1000000;
        if(h>hmax)
        {
            adauga(0,h-hmax);
            hmax=h;
        }
        while(w)
        {
            if(w>=s[ls].second)
            {
                ss[++lss]={s[ls].first+1,s[ls].second};
                ans+=s[ls].first*s[ls].second;
                w-=s[ls].second;
                --ls;
            }
            else
            {
                ans+=w*s[ls].first;
                ss[++lss]={s[ls].first,s[ls].second-w};
                ss[++lss]={s[ls].first+1,w};
                w=0;
                --ls;
            }
        }
        while(lss)
        {
            adauga(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 2396 KB Output is correct
2 Correct 0 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 1 ms 2408 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 1 ms 2392 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 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 18 ms 2636 KB Output is correct
2 Correct 75 ms 2820 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 301 ms 2780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 3056 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 3384 KB Output is correct
2 Correct 602 ms 3408 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 3412 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 1063 ms 3776 KB Time limit exceeded
2 Halted 0 ms 0 KB -