oj.uz

답안 #957098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957098 2024-04-03T01:34:24 Z Darren0724 Gift (IZhO18_nicegift) C++17
30 / 100
 2000 ms 381480 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 cost=max((int)1,mn-mx);
        for(int j:t){
            v[j]-=cost;
            if(v[j]>0)pq.push({v[j],j});
        }
        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 1 ms 344 KB n=4
2 Correct 0 ms 344 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 0 ms 348 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 0 ms 344 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 0 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 20 ms 1172 KB n=14
10 Correct 11 ms 856 KB n=11
11 Correct 54 ms 3812 KB n=50000
12 Correct 77 ms 4736 KB n=50000
13 Correct 62 ms 2840 KB n=10
14 Correct 65 ms 3076 KB n=685
15 Correct 75 ms 3352 KB n=623
16 Correct 40 ms 2060 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 0 ms 344 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 0 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 20 ms 1172 KB n=14
10 Correct 11 ms 856 KB n=11
11 Correct 54 ms 3812 KB n=50000
12 Correct 77 ms 4736 KB n=50000
13 Correct 62 ms 2840 KB n=10
14 Correct 65 ms 3076 KB n=685
15 Correct 75 ms 3352 KB n=623
16 Correct 40 ms 2060 KB n=973
17 Correct 55 ms 3076 KB n=989
18 Correct 16 ms 1368 KB n=563
19 Correct 21 ms 1840 KB n=592
20 Correct 23 ms 1884 KB n=938
21 Correct 19 ms 1368 KB n=747
22 Correct 20 ms 1624 KB n=991

Subtask #4
0 / 19.0

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

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 0 ms 344 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 0 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 20 ms 1172 KB n=14
10 Correct 11 ms 856 KB n=11
11 Correct 54 ms 3812 KB n=50000
12 Correct 77 ms 4736 KB n=50000
13 Correct 62 ms 2840 KB n=10
14 Correct 65 ms 3076 KB n=685
15 Correct 75 ms 3352 KB n=623
16 Correct 40 ms 2060 KB n=973
17 Correct 55 ms 3076 KB n=989
18 Correct 16 ms 1368 KB n=563
19 Correct 21 ms 1840 KB n=592
20 Correct 23 ms 1884 KB n=938
21 Correct 19 ms 1368 KB n=747
22 Correct 20 ms 1624 KB n=991
23 Execution timed out 2080 ms 381480 KB Time limit exceeded
24 Halted 0 ms 0 KB -