# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41161 | aome | Gift (IZhO18_nicegift) | C++14 | 783 ms | 168880 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;
const int N = 1000005;
int n, k;
long long sum, mx, a[N];
vector< vector< pair<long long, int> > > blocks;
vector< vector<long long> > res;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i], sum += a[i], mx = max(mx, a[i]);
}
if (sum % k || mx > sum / k) {
cout << -1; return 0;
}
long long avg = sum / k;
long long cur = 0;
vector< pair<long long, int > > vec;
for (int i = 1; i <= n; ++i) {
cur += a[i];
if (cur >= avg) {
vec.push_back(make_pair(a[i] - (cur - avg), i));
blocks.push_back(vec), vec.clear(), cur -= avg;
if (cur) {
vec.push_back(make_pair(cur, i));
}
Compilation message (stderr)
# | 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... |