# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124111 | jakob_nogler | Split the sequence (APIO14_sequence) | C++14 | 276 ms | 131072 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;
typedef long long ll;
const int N = 100005, K = 205;
ll dp[K][N], sum[N], val[N], m[N], q[N], tot = 0;
int nxt[K][N];
ll get_val(int x, int l, int idx){
return m[x] * m[l] - m[l] * m[l] + dp[idx - 1][l];
}
double get_in(int a, int b, int idx){
return (double) 1.0 * (m[a] * m[a] - dp[idx - 1][a] - m[b] * m[b] + dp[idx - 1][b]) / (m[b] - m[a]);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> val[i];
tot += val[i];
sum[i] += val[i];
sum[i + 1] += sum[i];
# | 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... |