oj.uz

Submission #1023942

# Submission time Handle Problem Language Result Execution time Memory
1023942 2024-07-15T09:51:47 Z lucri Sails (IOI07_sails) C++17
30 / 100
 1000 ms 1244 KB 
#include <bits/stdc++.h>
using namespace std;
int n,hmax;
int ans;
struct barci{int h;int w;}v[100010];
stack<pair<int,int>>s,ss;
bool comp(barci a,barci b)
{
    return a.h<b.h;
}
void adauga(int cost,int 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(int i=1;i<=n;++i)
        cin>>v[i].h>>v[i].w;
    sort(v+1,v+n+1,comp);
    for(int i=1;i<=n;++i)
    {
        if(v[i].h>hmax)
        {
            adauga(0,v[i].h-hmax);
            hmax=v[i].h;
        }
        while(v[i].w)
        {
            if(v[i].w>=s.top().second)
            {
                ss.push({s.top().first+1,s.top().second});
                ans+=s.top().first*s.top().second;
                v[i].w-=s.top().second;
                s.pop();
            }
            else
            {
                ans+=v[i].w*s.top().first;
                ss.push({s.top().first,s.top().second-v[i].w});
                ss.push({s.top().first+1,v[i].w});
                v[i].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 344 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 348 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1025 ms 600 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 1022 ms 1112 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 1066 ms 1040 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 1059 ms 1196 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 1067 ms 1244 KB Time limit exceeded
2 Halted 0 ms 0 KB -