oj.uz

답안 #496633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496633 2021-12-21T17:15:59 Z ergagan Gift (IZhO18_nicegift) C++17
0 / 100
 2000 ms 267692 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, a[N];

multiset<pair<ll, ll> > st;
vector<vector<pair<ll, ll> > > ans;

void solve() {

    ll n, k, mx = 0, sum = 0;
    cin >> n >> k;

    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
        st.insert({-a[i], i});
        mx = max(mx, a[i]);
        sum += a[i];
    }

    if(sum % k) { cout << "-1\n"; return; }
    if(mx > sum / k) { cout << "-1\n"; return; }

    while(!st.empty()) {

        ll cnt = 0;
        vector<pair<ll, ll> > v;
        for(auto x : st) {
            cnt++;

            v.pb(x);

            if(cnt == k) break;
        }

        for(auto x : v) {
            st.erase(st.find(x));
            x.f++;
            if(x.f) st.insert(x);
        }
        ans.pb(v);
    }
    cout << ans.size() << "\n";
    for(auto v : ans) {
        for(auto x : v) cout << x.s << " ";
        cout << "1\n";
    }
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Taken too much stones from the heap
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Taken too much stones from the heap
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Taken too much stones from the heap
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2093 ms 267692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Taken too much stones from the heap
2 Halted 0 ms 0 KB -