oj.uz

답안 #873889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873889 2023-11-16T02:32:09 Z noiaint Gift (IZhO18_nicegift) C++17
100 / 100
 858 ms 97696 KB 
#include <bits/stdc++.h>
#define int long long
 
using namespace std;
 
#define file ""
 
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll
 
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
 
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
 
template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}
 
int n, k;
int a[N];
int s;
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
 
    cin >> n >> k;
    priority_queue<pair<int, int> > q;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        s += a[i];
        q.emplace(a[i], i);
    }
 
    if (s % k != 0) {
        cout << -1;
        return 0;
    }
 
    if (q.top().fi > s / k) {
        cout << -1;
        return 0;
    }
 
    vector<vector<int> > res;
 
    while (s > 0) {
        vector<int> id;
        int rem = oo;
        for (int i = 1; i <= k; ++i) {
            id.push_back(q.top().se);
            rem = q.top().fi;
            q.pop();
        }
 
        if (q.size()) rem = min(rem, (s / k) - q.top().fi);
        s -= k * rem;
        vector<int> cur;
        cur.push_back(rem);
        for (int i : id) {
            cur.push_back(i);
            a[i] -= rem;
            if (a[i] > 0) q.emplace(a[i], i);
        }
        res.push_back(cur);
    }
 
    cout << (int) res.size() << '\n';
 
    for (auto cur : res) {
        for (int i : cur) cout << i << ' ';
        cout << '\n';
    }
 
    return 0;
}
 
/*
 
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 600 KB n=4
6 Correct 0 ms 348 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 344 KB n=5
8 Correct 1 ms 600 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 29 ms 5560 KB n=50000
12 Correct 18 ms 5332 KB n=50000
13 Correct 1 ms 600 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 344 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 344 KB n=5
8 Correct 1 ms 600 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 29 ms 5560 KB n=50000
12 Correct 18 ms 5332 KB n=50000
13 Correct 1 ms 600 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 344 KB n=973
17 Correct 1 ms 344 KB n=989
18 Correct 1 ms 344 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 348 KB n=938
21 Correct 1 ms 348 KB n=747
22 Correct 1 ms 348 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 420 ms 79284 KB n=1000000
2 Correct 251 ms 50708 KB n=666666
3 Correct 137 ms 29996 KB n=400000
4 Correct 97 ms 21300 KB n=285714
5 Correct 10 ms 1504 KB n=20000
6 Correct 56 ms 11968 KB n=181818
7 Correct 3 ms 992 KB n=10000
8 Correct 3 ms 856 KB n=6666
9 Correct 2 ms 476 KB n=4000
10 Correct 3 ms 604 KB n=2857
11 Correct 1 ms 600 KB n=2000

Subtask #5
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 344 KB n=5
8 Correct 1 ms 600 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 29 ms 5560 KB n=50000
12 Correct 18 ms 5332 KB n=50000
13 Correct 1 ms 600 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 344 KB n=973
17 Correct 1 ms 344 KB n=989
18 Correct 1 ms 344 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 348 KB n=938
21 Correct 1 ms 348 KB n=747
22 Correct 1 ms 348 KB n=991
23 Correct 420 ms 79284 KB n=1000000
24 Correct 251 ms 50708 KB n=666666
25 Correct 137 ms 29996 KB n=400000
26 Correct 97 ms 21300 KB n=285714
27 Correct 10 ms 1504 KB n=20000
28 Correct 56 ms 11968 KB n=181818
29 Correct 3 ms 992 KB n=10000
30 Correct 3 ms 856 KB n=6666
31 Correct 2 ms 476 KB n=4000
32 Correct 3 ms 604 KB n=2857
33 Correct 1 ms 600 KB n=2000
34 Correct 15 ms 4436 KB n=23514
35 Correct 20 ms 4432 KB n=23514
36 Correct 2 ms 348 KB n=940
37 Correct 0 ms 348 KB n=2
38 Correct 37 ms 7220 KB n=100000
39 Correct 35 ms 7472 KB n=100000
40 Correct 1 ms 348 KB n=10
41 Correct 1 ms 348 KB n=100
42 Correct 3 ms 604 KB n=1000
43 Correct 551 ms 87600 KB n=1000000
44 Correct 858 ms 97696 KB n=1000000
45 Correct 531 ms 64940 KB n=666666
46 Correct 296 ms 40200 KB n=400000
47 Correct 8 ms 1116 KB n=2336
48 Correct 486 ms 58828 KB n=285714
49 Correct 452 ms 46656 KB n=181818
50 Correct 21 ms 4836 KB n=40000
51 Correct 10 ms 1632 KB n=20000
52 Correct 6 ms 988 KB n=10000
53 Correct 42 ms 4440 KB n=6666
54 Correct 4 ms 600 KB n=4000
55 Correct 162 ms 16180 KB n=2857
56 Correct 3 ms 600 KB n=2000