# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676487 | penguin133 | Discharging (NOI20_discharging) | C++17 | 160 ms | 33464 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>
using namespace std;
#define int long long
deque<pair<int, int> > dq;
int f(pair<int, int> x, int y){
return x.first*y + x.second;
}
long double intersect(int a, int b, int c, int d){
return (long double)(d-b)/(a-c);
}
void ins(int m , int c){
while(dq.size() > 1){
int s = dq.size();
if(intersect(dq.back().first, dq.back().second,m,c) <= intersect(dq[s-2].first, dq[s-2].second, m,c))dq.pop_back();
else break;
}
dq.push_back(make_pair(m,c));
}
int query(int x){
while(dq.size() > 1){
if(f(dq[0], x) <= f(dq[1], x))dq.pop_front();
// <= for max dp, >= for min dp
else break;
}
return f(dq[0], x);
}
int dp[1000005], A[1000005];
int Pmax[1000005];
main(){
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... |