#include <bits/stdc++.h>
#include <iostream>
// #define int long long
#define ld long double
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v)),v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
// std::mt19937_64 rng64((int) std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937 rng(
// (int) std::chrono::steady_clock::now().time_since_epoch().count()
1239010
);
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
b%=m;
ll ans = 1;
for (; e; b = b * b % m, e /= 2)
if (e & 1) ans = ans * b % m;
return ans;
}
// debug:
template<class T>void print_vector(vector<T> &v){
rep(i,0,sz(v))cout<<v[i]<<" \n"[i==sz(v)-1];
}
void dbg_out() {cerr << endl; }
template<typename Head, typename ... Tail> void dbg_out(Head H,Tail... T){
cerr << ' ' << H;
dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__), cerr << endl
#else
#define dbg(...) 42
#endif
//
const int N = 1e6 + 100;
ll a[N];
const ll inf = 1e18 + 9;
ll mult(ll a,ll b){
if(a > inf/b)return inf;
return a*b;
}
int32_t main(){
fastio;
int n,k;
cin >> n >> k;
ll sum=0;
rep(i,1,n+1){
cin >> a[i];
sum += a[i];
}
if(sum%k != 0){
cout << -1 << endl;
return 0;
}
vi ids;
rep(i,1,n+1)ids.pb(i);
sort(all(ids),[&](int i,int j){
return a[i] > a[j];
});
set<pll> S;
rep(i,1,n+1){
S.insert({a[i] , i});
}
vector<pair<ll,vi> > res;
if(a[ids[0]] == a[ids.back()]){
// all equal
int i = 0;
ll c0=0;
do{
vi v;
rep(j,0,k){
v.pb((j + i)%n + 1);
if((i+j)%n == 0)c0++;
}
res.pb({0,v});
i = (i + k)%n;
}while(i!=0);
ll tot = a[1]/c0;
for(auto &it : res)it.ff = tot;
rep(i,1,n+1)a[i]=0;
cout << sz(res) << endl;
for(auto [X,v] : res){
cout << X << " ";
for(auto id : v)cout << id<<" ";
cout << endl;
}
return 0;
}
if(mult(a[0], k + 1) > sum){
cout << -1 << endl;
return 0;
}
while(sz(S) > 0){
vi v;
ll mn = 1e18 + 9;
ll mx = S.rbegin()->ff;
if(sz(S) < k){
assert(0);
}
while(sz(v) < k){
auto it = S.rbegin();
int id = it->ss;
v.pb(id);
mn = min(mn, it->ff);
S.erase({a[id], id});
}
ll nxt = (sz(S) ? S.rbegin()->ff : 0);
ll l = 1, r = mn;
ll ans = 1;
while(l<=r){
ll m = (l+r)/2;
int q1 = mult(nxt,k+1) <= sum - ans * k;
int q2 = mult(mx - ans,k+1) <= sum - ans * k;
if(q1 && q2){
ans = m;
l = m + 1;
}else r = m - 1;
}
ll tira = ans;
// ou teto?
res.pb({tira, v});
for(auto id : v){
a[id] -= tira;
sum -= tira;
if(a[id])S.insert({a[id] , id});
}
}
rep(i,1,n+1)assert(a[i]==0);
cout << sz(res) << endl;
for(auto [X,v] : res){
cout << X << " ";
for(auto id : v)cout << id<<" ";
cout << endl;
}
// math -> gcd it all
// Did you swap N,M? N=1?
}
Compilation message
nicegift.cpp: In function 'int32_t main()':
nicegift.cpp:116:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
116 | for(auto [X,v] : res){
| ^
nicegift.cpp:169:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
169 | for(auto [X,v] : res){
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Correct |
0 ms |
348 KB |
n=3 |
| 3 |
Correct |
0 ms |
348 KB |
n=3 |
| 4 |
Correct |
0 ms |
348 KB |
n=4 |
| 5 |
Correct |
0 ms |
348 KB |
n=4 |
| 6 |
Correct |
0 ms |
348 KB |
n=2 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Correct |
0 ms |
348 KB |
n=3 |
| 3 |
Correct |
0 ms |
348 KB |
n=3 |
| 4 |
Correct |
0 ms |
348 KB |
n=4 |
| 5 |
Correct |
0 ms |
348 KB |
n=4 |
| 6 |
Correct |
0 ms |
348 KB |
n=2 |
| 7 |
Correct |
0 ms |
348 KB |
n=5 |
| 8 |
Runtime error |
4 ms |
1880 KB |
Execution killed with signal 6 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Correct |
0 ms |
348 KB |
n=3 |
| 3 |
Correct |
0 ms |
348 KB |
n=3 |
| 4 |
Correct |
0 ms |
348 KB |
n=4 |
| 5 |
Correct |
0 ms |
348 KB |
n=4 |
| 6 |
Correct |
0 ms |
348 KB |
n=2 |
| 7 |
Correct |
0 ms |
348 KB |
n=5 |
| 8 |
Runtime error |
4 ms |
1880 KB |
Execution killed with signal 6 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1093 ms |
120788 KB |
n=1000000 |
| 2 |
Correct |
554 ms |
73204 KB |
n=666666 |
| 3 |
Correct |
280 ms |
40580 KB |
n=400000 |
| 4 |
Correct |
605 ms |
64436 KB |
n=285714 |
| 5 |
Correct |
6 ms |
2140 KB |
n=20000 |
| 6 |
Correct |
419 ms |
48280 KB |
n=181818 |
| 7 |
Correct |
4 ms |
1116 KB |
n=10000 |
| 8 |
Correct |
23 ms |
3932 KB |
n=6666 |
| 9 |
Correct |
1 ms |
604 KB |
n=4000 |
| 10 |
Correct |
128 ms |
17816 KB |
n=2857 |
| 11 |
Correct |
1 ms |
604 KB |
n=2000 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Correct |
0 ms |
348 KB |
n=3 |
| 3 |
Correct |
0 ms |
348 KB |
n=3 |
| 4 |
Correct |
0 ms |
348 KB |
n=4 |
| 5 |
Correct |
0 ms |
348 KB |
n=4 |
| 6 |
Correct |
0 ms |
348 KB |
n=2 |
| 7 |
Correct |
0 ms |
348 KB |
n=5 |
| 8 |
Runtime error |
4 ms |
1880 KB |
Execution killed with signal 6 |
| 9 |
Halted |
0 ms |
0 KB |
- |
