oj.uz

답안 #957104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957104 2024-04-03T02:11:14 Z Darren0724 Gift (IZhO18_nicegift) C++17
100 / 100
 736 ms 84296 KB 
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
const int mod=1e9+7;

int32_t main() {
    LCBorz;
    int n,k;cin>>n>>k;
    vector<int> v(n+1);
    priority_queue<pair<int,int>> pq;
    int total=0;
    for(int i=1;i<=n;i++){
        cin>>v[i];
        pq.push({v[i],i});
        total+=v[i];
    }
    vector<vector<int>> ans;
    while(pq.size()>=k){
        int mn=0;
        vector<int> t;
        for(int i=0;i<k;i++){
            auto [a,b]=pq.top();
            pq.pop();
            mn=a;
            t.push_back(b);
        }
        int mx=(pq.size()?pq.top().first:0);
        int left=total-mx;
        int cost=min(mn,(left-(k-1)*mx)/k);
        for(int j:t){
            v[j]-=cost;
            if(v[j]>0)pq.push({v[j],j});
        }
        total-=cost*k;
        t.push_back(cost);
        reverse(all(t));
        ans.push_back(t);
    }
    if(pq.size()!=0){
        cout<<-1<<endl;
        return 0;
    }
    cout<<ans.size()<<endl;
    for(auto v:ans){
        for(int j:v){
            cout<<j<<' ';
        }
        cout<<endl;
    }

    
    return 0;
}

Compilation message

nicegift.cpp: In function 'int32_t main()':
nicegift.cpp:23:20: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   23 |     while(pq.size()>=k){
      |           ~~~~~~~~~^~~

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 1 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 0 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 1 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 0 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 19 ms 3656 KB n=50000
12 Correct 16 ms 3288 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 344 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 348 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 1 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 0 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 19 ms 3656 KB n=50000
12 Correct 16 ms 3288 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 344 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 0 ms 348 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 414 ms 66348 KB n=1000000
2 Correct 235 ms 40888 KB n=666666
3 Correct 130 ms 22712 KB n=400000
4 Correct 88 ms 14540 KB n=285714
5 Correct 8 ms 1248 KB n=20000
6 Correct 54 ms 9080 KB n=181818
7 Correct 3 ms 856 KB n=10000
8 Correct 2 ms 604 KB n=6666
9 Correct 1 ms 604 KB n=4000
10 Correct 3 ms 588 KB n=2857
11 Correct 1 ms 348 KB n=2000

Subtask #5
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 1 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 0 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 19 ms 3656 KB n=50000
12 Correct 16 ms 3288 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 344 KB n=685
15 Correct 1 ms 344 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 0 ms 348 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 414 ms 66348 KB n=1000000
24 Correct 235 ms 40888 KB n=666666
25 Correct 130 ms 22712 KB n=400000
26 Correct 88 ms 14540 KB n=285714
27 Correct 8 ms 1248 KB n=20000
28 Correct 54 ms 9080 KB n=181818
29 Correct 3 ms 856 KB n=10000
30 Correct 2 ms 604 KB n=6666
31 Correct 1 ms 604 KB n=4000
32 Correct 3 ms 588 KB n=2857
33 Correct 1 ms 348 KB n=2000
34 Correct 12 ms 2268 KB n=23514
35 Correct 12 ms 2264 KB n=23514
36 Correct 1 ms 348 KB n=940
37 Correct 0 ms 348 KB n=2
38 Correct 33 ms 5148 KB n=100000
39 Correct 33 ms 5324 KB n=100000
40 Correct 1 ms 348 KB n=10
41 Correct 0 ms 348 KB n=100
42 Correct 2 ms 604 KB n=1000
43 Correct 465 ms 80004 KB n=1000000
44 Correct 736 ms 84296 KB n=1000000
45 Correct 457 ms 57780 KB n=666666
46 Correct 251 ms 32184 KB n=400000
47 Correct 8 ms 1112 KB n=2336
48 Correct 489 ms 54036 KB n=285714
49 Correct 402 ms 43192 KB n=181818
50 Correct 20 ms 2508 KB n=40000
51 Correct 10 ms 1248 KB n=20000
52 Correct 6 ms 984 KB n=10000
53 Correct 43 ms 4436 KB n=6666
54 Correct 3 ms 604 KB n=4000
55 Correct 182 ms 16176 KB n=2857
56 Correct 2 ms 604 KB n=2000