# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867444 | JoksimKaktus | Split the sequence (APIO14_sequence) | C++17 | 7 ms | 2140 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;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n;
long double k;
cin >> n >> k;
vector <ll> pre(n+1);
pre[0]=0;
vector <int> v(n+1);
for(int i = 1;i <= n;i++){
cin >> v[i];
pre[i] = pre[i-1]+v[i];
}
long double limit = (pre[n]/(k+1));
ll cur = 0;
long double dif = 0;
int l = 0;
ll res = 0;
vector <int> ind;
for(int i = 1;i <=n && ind.size() < k;i++){
if(cur == 0){
cur += v[i];
continue;
}
# | 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... |