oj.uz

답안 #893228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893228 2023-12-26T18:27:43 Z vjudge1 Gift (IZhO18_nicegift) C++17
30 / 100
 603 ms 374148 KB 
// 以上帝的名义
// 候选硕士
#include <bits/stdc++.h>

#ifdef local
#include "algo/debug.h"
#else
#define dbg(x...) 0
#endif

using namespace std ;
using ll = long long ;

int32_t main() {
    cin.tie(0)->sync_with_stdio(false) ;
    int n , k ; cin >> n >> k ;
    vector<ll> a(n) ;
    for (ll &i : a) cin >> i ;
    priority_queue<pair<ll,ll>> q ;
    for (int i = 0 ; i < n ; i++) {
        q.push({a[i], i}) ;
    }
    set<ll> st(a.begin(), a.end()) ;
    ll sum = accumulate(a.begin(), a.end(), 0ll) ;
    if (sum % k || (sum / k) < q.top().first) {
        cout << -1 << "\n" ;
        return 0 ;
    }
    vector<deque<int>> res ;
    while (q.size()) {
        deque<int> cur ;
        ll mn = LLONG_MAX ;
        for (int i = 0 ; i < k ; i++) {
            auto [value, ind] = q.top() ;
            q.pop() ;
            cur.push_back(ind) ;
            mn = value ;
        }
        if (q.size()) mn = min(mn * 1ll, (sum / k) - q.top().first) ;
        sum -= mn * (ll)cur.size() ;
        for (int& i : cur) {
            a[i] -= mn ;
            if (a[i]> 0) {
                q.push({a[i], i}) ;
            }
            i++ ;
        }
        cur.push_front(mn) ;
        res.push_back(cur) ;
    }
    if (q.size()) {
        cout << -1 << "\n" ;
        return 0 ;
    }
    cout << res.size() << "\n" ;
    for (auto i : res) {
        for (int j : i) cout << j << ' ' ;
        cout << "\n" ;
    }
    return 0 ;
}

// 希望白银

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 603 ms 374148 KB Added number should be positive
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB n=2
7 Correct 0 ms 344 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 0 ms 348 KB n=14
10 Correct 1 ms 348 KB n=11
11 Correct 28 ms 22416 KB n=50000
12 Correct 24 ms 18768 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 604 KB n=685
15 Correct 1 ms 600 KB n=623
16 Correct 1 ms 604 KB n=973
17 Correct 1 ms 600 KB n=989
18 Correct 1 ms 344 KB n=563
19 Correct 1 ms 344 KB n=592
20 Correct 1 ms 348 KB n=938
21 Correct 1 ms 348 KB n=747
22 Correct 1 ms 452 KB n=991
23 Incorrect 603 ms 374148 KB Added number should be positive
24 Halted 0 ms 0 KB -