oj.uz

Submission #266745

# Submission time Handle Problem Language Result Execution time Memory
266745 2020-08-15T12:35:57 Z eohomegrownapps Discharging (NOI20_discharging) C++14
11 / 100
 125 ms 632 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    ll n;
    cin>>n;
    ll prev = 0;
    ll tot = 0;
    stack<pair<ll,ll>> s; //index, time
    for (ll i = 0; i<n; i++){
        ll val;
        cin>>val;
        if (val<=prev){prev=val;continue;}
        prev=val;
        ll ind = i;
        tot+=(n-ind)*val;
        while (s.size()>0){
            auto f = s.top();
            ll tind = f.first;
            ll th = f.second;
            //cout<<tind<<' '<<th<<'\n';
            //can we do better by popping?
            if ((n-ind)*val+(n-tind)*th>(n-tind)*val){
                //cout<<"subtract\n";
                tot-=(n-ind)*val+(n-tind)*th;
                //cout<<tot<<'\n';
                tot+=(n-tind)*val;
                //cout<<tot<<'\n';
                ind=tind;
                s.pop();
            } else {
                break;
            }
        }
        //cout<<i<<": "<<tot<<'\n';
        s.push({ind,val});
    }
    cout<<tot<<'\n';
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

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

Subtask #3
0 / 25.0

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

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 612 KB Output is correct
2 Correct 111 ms 512 KB Output is correct
3 Correct 115 ms 632 KB Output is correct
4 Correct 108 ms 512 KB Output is correct
5 Correct 110 ms 512 KB Output is correct
6 Correct 115 ms 620 KB Output is correct
7 Correct 115 ms 508 KB Output is correct
8 Correct 108 ms 504 KB Output is correct
9 Correct 125 ms 388 KB Output is correct
10 Correct 115 ms 384 KB Output is correct

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -