# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676584 | benjaminkleyn | Split the sequence (APIO14_sequence) | C++17 | 649 ms | 82124 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int N, K, a[100001];
ll pref[100001] = {0};
ll dp[2][100001] = {0};
int last_split[202][100001];
int cht[100001], fr = 0, bk = -1;
#define m(j) (pref[j])
#define c(j) (dp[0][j]-pref[j]*pref[N])
inline ld isect(const int &a, const int &b)
{
return (ld)(c(b) - c(a)) / (ld)(m(a) - m(b));
}
inline bool bad(const int &x, const int &y, const int &z)
{
return isect(z, y) <= isect(z, x);
}
inline ll eval(const int &i, const ll &x)
{
# | 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... |