# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318299 | ryangohca | Discharging (NOI20_discharging) | C++17 | 446 ms | 25828 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 int long long
using namespace std;
int nums[1000001], dp[1000001];
deque<pair<int,int> > dq;
int f(pair<int,int> line, int x){
return line.first*x + line.second;
}
int query(int x){
while(dq.size()>1){ //to prevent seg fault when accessing dq[1]
if(f(dq[0],x)<f(dq[1],x)) //the next line is better
dq.pop_front(); //remove useless line
else break;
}
return f(dq[0],x);
}
double intersect(int m1, int c1, int m2, int c2){
return (double)(c2-c1)/(m1-m2);
}
double intersect(pair<int,int> p1, pair<int,int> p2){
return intersect(p1.first,p1.second,p2.first,p2.second);
}
void insert(int m,int c) {//insert line y=mx+c
pair<int,int> line = make_pair(m,c);
while (dq.size()>1) { //to prevent seg fault
int s = dq.size();
if (intersect(dq[s-1], line) <= intersect(dq[s-2], line))
dq.pop_back(); //removes useless line
else break;
}
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... |