# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
378761 |
2021-03-17T03:55:46 Z |
8e7 |
Gift (IZhO18_nicegift) |
C++14 |
|
2000 ms |
47820 KB |
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#define ll long long
#define maxn 1000005
#define pii pair<int, ll>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
ll a[maxn], pref[maxn];
vector<ll> val;
vector<int> ans[maxn];
int main() {
io
ll n, k;
cin >> n >> k;
ll m = 0;
for (int i = 0;i < n;i++) {
cin >> a[i];
m += a[i];
pref[i] = m;
}
bool poss = m % k == 0;
ll siz = m / k;
for (int i = 0;i < n;i++) {
if (a[i] > siz) {
poss = false;
break;
}
val.push_back(pref[i] % siz);
}
sort(val.begin(), val.end());
val.push_back(siz);
val.resize(int(unique(val.begin(), val.end()) - val.begin()));
if (!poss) {
cout << -1 << endl;
} else {
int num = 0;
ll cur = 0;
for (int i = 0;i < val.size();i++) {
//cout << val[i] << " " << cur << endl;
if (val[i] - cur > 0) { //[cur, val[i])
ans[num].push_back(val[i] - cur);
int ind = upper_bound(pref, pref + n, cur) - pref;
for (ll j = cur;j < m;j += m / k) {
while (ind < n && pref[ind] <= j) ind++;
if (ind < n) ans[num].push_back(ind+1);
}
cur = val[i];
num++;
}
}
cout << num << "\n";
for (int i = 0;i < num;i++) {
for (int j:ans[i]) cout << j << " ";
cout << "\n";
}
}
}
/*
4 2
2 3 3 2
6 4
4 1 3 5 5 2
*/
Compilation message
nicegift.cpp: In function 'int main()':
nicegift.cpp:46:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for (int i = 0;i < val.size();i++) {
| ~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23788 KB |
n=4 |
2 |
Correct |
17 ms |
23788 KB |
n=3 |
3 |
Correct |
15 ms |
23788 KB |
n=3 |
4 |
Correct |
15 ms |
23788 KB |
n=4 |
5 |
Correct |
15 ms |
23916 KB |
n=4 |
6 |
Correct |
15 ms |
23788 KB |
n=2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23788 KB |
n=4 |
2 |
Correct |
17 ms |
23788 KB |
n=3 |
3 |
Correct |
15 ms |
23788 KB |
n=3 |
4 |
Correct |
15 ms |
23788 KB |
n=4 |
5 |
Correct |
15 ms |
23916 KB |
n=4 |
6 |
Correct |
15 ms |
23788 KB |
n=2 |
7 |
Correct |
15 ms |
23788 KB |
n=5 |
8 |
Correct |
15 ms |
23788 KB |
n=8 |
9 |
Correct |
15 ms |
23788 KB |
n=14 |
10 |
Correct |
16 ms |
23864 KB |
n=11 |
11 |
Correct |
898 ms |
27116 KB |
n=50000 |
12 |
Correct |
991 ms |
26912 KB |
n=50000 |
13 |
Correct |
15 ms |
23788 KB |
n=10 |
14 |
Correct |
17 ms |
23916 KB |
n=685 |
15 |
Correct |
17 ms |
23916 KB |
n=623 |
16 |
Correct |
17 ms |
24060 KB |
n=973 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23788 KB |
n=4 |
2 |
Correct |
17 ms |
23788 KB |
n=3 |
3 |
Correct |
15 ms |
23788 KB |
n=3 |
4 |
Correct |
15 ms |
23788 KB |
n=4 |
5 |
Correct |
15 ms |
23916 KB |
n=4 |
6 |
Correct |
15 ms |
23788 KB |
n=2 |
7 |
Correct |
15 ms |
23788 KB |
n=5 |
8 |
Correct |
15 ms |
23788 KB |
n=8 |
9 |
Correct |
15 ms |
23788 KB |
n=14 |
10 |
Correct |
16 ms |
23864 KB |
n=11 |
11 |
Correct |
898 ms |
27116 KB |
n=50000 |
12 |
Correct |
991 ms |
26912 KB |
n=50000 |
13 |
Correct |
15 ms |
23788 KB |
n=10 |
14 |
Correct |
17 ms |
23916 KB |
n=685 |
15 |
Correct |
17 ms |
23916 KB |
n=623 |
16 |
Correct |
17 ms |
24060 KB |
n=973 |
17 |
Correct |
18 ms |
23916 KB |
n=989 |
18 |
Correct |
16 ms |
23916 KB |
n=563 |
19 |
Correct |
17 ms |
24044 KB |
n=592 |
20 |
Correct |
20 ms |
24044 KB |
n=938 |
21 |
Correct |
17 ms |
23916 KB |
n=747 |
22 |
Correct |
22 ms |
24044 KB |
n=991 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2096 ms |
47820 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23788 KB |
n=4 |
2 |
Correct |
17 ms |
23788 KB |
n=3 |
3 |
Correct |
15 ms |
23788 KB |
n=3 |
4 |
Correct |
15 ms |
23788 KB |
n=4 |
5 |
Correct |
15 ms |
23916 KB |
n=4 |
6 |
Correct |
15 ms |
23788 KB |
n=2 |
7 |
Correct |
15 ms |
23788 KB |
n=5 |
8 |
Correct |
15 ms |
23788 KB |
n=8 |
9 |
Correct |
15 ms |
23788 KB |
n=14 |
10 |
Correct |
16 ms |
23864 KB |
n=11 |
11 |
Correct |
898 ms |
27116 KB |
n=50000 |
12 |
Correct |
991 ms |
26912 KB |
n=50000 |
13 |
Correct |
15 ms |
23788 KB |
n=10 |
14 |
Correct |
17 ms |
23916 KB |
n=685 |
15 |
Correct |
17 ms |
23916 KB |
n=623 |
16 |
Correct |
17 ms |
24060 KB |
n=973 |
17 |
Correct |
18 ms |
23916 KB |
n=989 |
18 |
Correct |
16 ms |
23916 KB |
n=563 |
19 |
Correct |
17 ms |
24044 KB |
n=592 |
20 |
Correct |
20 ms |
24044 KB |
n=938 |
21 |
Correct |
17 ms |
23916 KB |
n=747 |
22 |
Correct |
22 ms |
24044 KB |
n=991 |
23 |
Execution timed out |
2096 ms |
47820 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |