oj.uz

Submission #1023952

# Submission time Handle Problem Language Result Execution time Memory
1023952 2024-07-15T10:01:21 Z lucri Sails (IOI07_sails) C++11
50 / 100
 1000 ms 1236 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,hmax;
long long ans,h,w;
long long v[100010];
stack<pair<int,int>>s,ss;
static inline 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()
{
    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.top().second)
            {
                ss.push({s.top().first+1,s.top().second});
                ans+=s.top().first*s.top().second;
                w-=s.top().second;
                s.pop();
            }
            else
            {
                ans+=w*s.top().first;
                ss.push({s.top().first,s.top().second-w});
                ss.push({s.top().first+1,w});
                w=0;
                s.pop();
            }
        }
        while(!ss.empty())
        {
            adauga(ss.top().first,ss.top().second);
            ss.pop();
        }
    }
    cout<<ans;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 1 ms 480 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 528 KB Output is correct
2 Correct 478 ms 696 KB Output is correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1010 ms 1224 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 1054 ms 1236 KB Time limit exceeded
2 Halted 0 ms 0 KB -