# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682817 | iskhakkutbilim | Gift (IZhO18_nicegift) | C++14 | 274 ms | 44500 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;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int M = 1e9 + 7;
const int N = 1e6 + 1;
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k;
int a[n];
for(int i = 0;i < n; i++){
cin >> a[i];
}
set<int> st(a, a + n);
if(st.size() == 1){
if(n%k!= 0){
cout << -1;
}else{
cout << n / k << '\n';
deque<int> q;
for(int i = 0;i < n; i++) q.push_back(i);
for(int i = 0;i < n / k; i++){
cout << a[0] << ' ';
int c = k;
while(c--){
cout << q.front()+1 << ' ';
q.pop_front();
}
cout << '\n';
}
}
return 0;
}
return 0;
}
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... |