oj.uz

답안 #644414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
644414 2022-09-24T16:30:50 Z Do_you_copy Gift (IZhO18_nicegift) C++17
49 / 100
 999 ms 73400 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;
using ll = long long;
using pii = pair <int, int>;
#define pb push_back
const int maxN = 1e6 + 10;
const int maxOP = 3e6;
int n, k;
int a[maxN];
priority_queue <pii> PQ;

vector <vector <int>> e;
void Init(){
    cin >> n >> k;
    ll sum = 0;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
        sum += a[i];
        PQ.push({a[i], i});
    }
    if (sum % k || PQ.top().fi > sum / k){
        cout << -1; return;
    }
    for (int i = 1; i <= maxOP; ++i){
        vector <int> pos;
        for (int j = 0; j < k; ++j){
            pos.pb(PQ.top().se);
            PQ.pop();
        }
        int add = a[pos.back()];
        add = min(add, sum / k - PQ.top().fi);
        if (!add) break;
        sum -= add * k;
        e.pb({add});
        for (int j = 0; j < k; ++j){
            e.back().pb(pos[j]);
            a[pos[j]] -= add;
        }
        for (int j = 0; j < k; ++j){
            PQ.push({a[pos[j]], pos[j]});
        }
    }
    cout << e.size() << "\n";
    for (auto &i: e){
        for (auto &j: i) cout << j << " ";
        cout << "\n";
    }
}

signed main() {
    Init();
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Correct 0 ms 212 KB n=3
4 Correct 0 ms 212 KB n=4
5 Correct 0 ms 212 KB n=4
6 Correct 0 ms 212 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Correct 0 ms 212 KB n=3
4 Correct 0 ms 212 KB n=4
5 Correct 0 ms 212 KB n=4
6 Correct 0 ms 212 KB n=2
7 Correct 0 ms 212 KB n=5
8 Correct 0 ms 212 KB n=8
9 Correct 0 ms 212 KB n=14
10 Correct 0 ms 212 KB n=11
11 Correct 27 ms 4000 KB n=50000
12 Correct 25 ms 3560 KB n=50000
13 Correct 0 ms 212 KB n=10
14 Correct 1 ms 340 KB n=685
15 Correct 1 ms 340 KB n=623
16 Correct 1 ms 340 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Correct 0 ms 212 KB n=3
4 Correct 0 ms 212 KB n=4
5 Correct 0 ms 212 KB n=4
6 Correct 0 ms 212 KB n=2
7 Correct 0 ms 212 KB n=5
8 Correct 0 ms 212 KB n=8
9 Correct 0 ms 212 KB n=14
10 Correct 0 ms 212 KB n=11
11 Correct 27 ms 4000 KB n=50000
12 Correct 25 ms 3560 KB n=50000
13 Correct 0 ms 212 KB n=10
14 Correct 1 ms 340 KB n=685
15 Correct 1 ms 340 KB n=623
16 Correct 1 ms 340 KB n=973
17 Correct 1 ms 340 KB n=989
18 Correct 1 ms 340 KB n=563
19 Correct 1 ms 340 KB n=592
20 Correct 1 ms 340 KB n=938
21 Correct 1 ms 340 KB n=747
22 Correct 1 ms 340 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 999 ms 73400 KB n=1000000
2 Correct 527 ms 39460 KB n=666666
3 Correct 315 ms 22068 KB n=400000
4 Correct 219 ms 13784 KB n=285714
5 Correct 16 ms 1108 KB n=20000
6 Correct 137 ms 8964 KB n=181818
7 Correct 8 ms 724 KB n=10000
8 Correct 6 ms 568 KB n=6666
9 Correct 5 ms 468 KB n=4000
10 Correct 5 ms 596 KB n=2857
11 Correct 2 ms 340 KB n=2000

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Correct 0 ms 212 KB n=3
4 Correct 0 ms 212 KB n=4
5 Correct 0 ms 212 KB n=4
6 Correct 0 ms 212 KB n=2
7 Correct 0 ms 212 KB n=5
8 Correct 0 ms 212 KB n=8
9 Correct 0 ms 212 KB n=14
10 Correct 0 ms 212 KB n=11
11 Correct 27 ms 4000 KB n=50000
12 Correct 25 ms 3560 KB n=50000
13 Correct 0 ms 212 KB n=10
14 Correct 1 ms 340 KB n=685
15 Correct 1 ms 340 KB n=623
16 Correct 1 ms 340 KB n=973
17 Correct 1 ms 340 KB n=989
18 Correct 1 ms 340 KB n=563
19 Correct 1 ms 340 KB n=592
20 Correct 1 ms 340 KB n=938
21 Correct 1 ms 340 KB n=747
22 Correct 1 ms 340 KB n=991
23 Correct 999 ms 73400 KB n=1000000
24 Correct 527 ms 39460 KB n=666666
25 Correct 315 ms 22068 KB n=400000
26 Correct 219 ms 13784 KB n=285714
27 Correct 16 ms 1108 KB n=20000
28 Correct 137 ms 8964 KB n=181818
29 Correct 8 ms 724 KB n=10000
30 Correct 6 ms 568 KB n=6666
31 Correct 5 ms 468 KB n=4000
32 Correct 5 ms 596 KB n=2857
33 Correct 2 ms 340 KB n=2000
34 Correct 20 ms 2380 KB n=23514
35 Correct 19 ms 2372 KB n=23514
36 Correct 1 ms 340 KB n=940
37 Incorrect 0 ms 212 KB Not all heaps are empty in the end
38 Halted 0 ms 0 KB -