# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285144 | 3zp | Discharging (NOI20_discharging) | C++14 | 140 ms | 31736 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll t[1000009],dp[1000009],Next[1000009],Prev[1000009];
stack<ll> S;
void rem(ll i){
Next[Prev[i]] = Next[i];
Prev[Next[i]] = Prev[i];
}
void ad(ll i){
if(S.size() && t[S.top()] == t[i]) {rem(i); return;}
while(S.size() >= 2){
ll j = S.top(); S.pop();
ll k = S.top();
if((dp[i+1] - dp[j+1]) * (t[k] - t[i]) <= (dp[i+1] - dp[k+1]) * (t[j] - t[i])){
rem(j);
continue;
}
S.push(j);
break;
}
S.push(i);
}
ll cnt(ll i, ll x){
return x * t[i]+ dp[i+1];
}
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |