# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370043 | danielcm585 | Discharging (NOI20_discharging) | C++14 | 129 ms | 11884 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 fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
const int N = 1e6;
int n, m;
int a[N+2], st[N+2];
ll dp[N+2];
struct line {
ll m, c;
ll operator ()(ll x) {
return m*x + c;
}
};
bool greaterFrac(ll a, ll b, ll c, ll d) {
// a/b >= c/d;
if (a/b != c/d) return a/b > c/d;
return (a%b)*d >= (c%d)*b;
}
bool isBad(line a, line b, line c) {
// (c1-c2)/(m2-m1) >= (c2-c3)/(m3-m2)
# | 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... |