# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093182 | vukhacminh | Split the sequence (APIO14_sequence) | C++17 | 1164 ms | 85428 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;
using ll = long long;
using ld = long double;
const int MAXN = 1e5 + 1;
const int MAXK = 200 + 1;
const ll INF = 1e18;
int s[MAXN];
struct Line {
ll m, b;
int id;
ll eval( ll x ) {
return m * x + b;
}
ld inter( Line d ) {
if ( m == d.m ) {
return (d.b > b ? INF : -INF);
}
return (ld)(d.b - b) / (m - d.m);
}
};
struct Slice {
ld split;
Line line;
# | 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... |