# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168912 | abil | Gift (IZhO18_nicegift) | C++14 | 1632 ms | 22640 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>
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
int a[N];
main()
{
int n, k;
bool f = true;
scanf("%lld%lld", &n, &k);
for(int i = 1;i <= n; i++){
scanf("%lld", &a[i]);
if(i > 1){
if(a[i] != a[i - 1]){
f = false;
}
}
}
if(f){
if(n % k == 0){
cout << n / k << endl;
int x = n / k, cnt = 1;
while(x--){
cout << a[1] << " ";
for(int i = 1;i <= k; i++){
cout << cnt << " ";
cnt++;
}
cout << endl;
}
}
else{
cout << -1;
}
}
}
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... |