# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262475 | Cantfindme | Discharging (NOI20_discharging) | C++17 | 129 ms | 22392 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
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 1000010;
#define ld long double
deque <pi> dq;
int n;
int T[maxn];
int jump[maxn];
int f(pi line, int x) {
return line.f * x + line.s;
}
int query(int x) {
while (dq.size() > 1) {
if (f(dq[0],x) > f(dq[1],x)) dq.pop_front();
else break;
}
return f(dq[0],x);
}
ld intersect(pi p1, pi p2) {
return (ld) (p2.s - p1.s) / (p1.f - p2.f);
}
# | 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... |