oj.uz

답안 #911966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911966 2024-01-19T06:43:58 Z GrindMachine Gift (IZhO18_nicegift) C++17
100 / 100
 954 ms 91256 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://oj.uz/submission/908159

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];
 
    ll sum = 0;
    rep1(i,n) sum += a[i];
 
    if(sum%k){
        cout << -1 << endl;
        return;
    }
 
    ll mx = *max_element(all(a));
    if(mx > sum/k){
        cout << -1 << endl;
        return;
    }
 
    priority_queue<pll> pq;
    rep1(i,n) pq.push({a[i],i});
 
    vector<vector<ll>> ans;
 
    while(true){        
        if(!pq.top().ff) break;

        vector<ll> curr;
        curr.pb(0);
        
        rep1(iter,k){
            auto [val,i] = pq.top();
            pq.pop();
            curr.pb(i);
        }

        ll curr_mx = a[curr[1]];
        ll curr_mn = a[curr.back()];

        ll remain_mx = -inf2;
        if(!pq.empty()){
            remain_mx = pq.top().ff;
        }

        // what is the max val that can be subtracted?
        // ll l = 1, r = curr_mn;
        // ll mx_sub = -1;

        // while(l <= r){
        //     ll mid = (l+r) >> 1;
        //     ll new_sum = sum-mid*k;
        //     if(curr_mx-mid <= new_sum/k and remain_mx <= new_sum/k){
        //         mx_sub = mid;
        //         l = mid+1;
        //     }
        //     else{
        //         r = mid-1;
        //     }
        // }

        // assert(mx_sub != -1);

        ll mx_sub = min(curr_mn,(sum-remain_mx*k)/k);

        curr[0] = mx_sub;
        sum -= mx_sub*k;

        rep1(ind,sz(curr)-1){
            ll i = curr[ind];
            a[i] -= mx_sub;
            pq.push({a[i],i});
        }

        ans.pb(curr);
    }
    
    assert(sum == 0);
    rep1(i,n){
        assert(a[i] == 0);
    }
 
    cout << sz(ans) << endl;
    trav(ar,ans){
        trav(i,ar) cout << i << " ";
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

nicegift.cpp: In function 'void solve(int)':
nicegift.cpp:98:12: warning: unused variable 'curr_mx' [-Wunused-variable]
   98 |         ll curr_mx = a[curr[1]];
      |            ^~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 1 ms 344 KB n=3
4 Correct 1 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 1 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 344 KB n=8
9 Correct 1 ms 344 KB n=14
10 Correct 1 ms 456 KB n=11
11 Correct 19 ms 3664 KB n=50000
12 Correct 16 ms 3544 KB n=50000
13 Correct 1 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 604 KB n=623
16 Correct 1 ms 344 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 1 ms 344 KB n=3
4 Correct 1 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 1 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 344 KB n=8
9 Correct 1 ms 344 KB n=14
10 Correct 1 ms 456 KB n=11
11 Correct 19 ms 3664 KB n=50000
12 Correct 16 ms 3544 KB n=50000
13 Correct 1 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 604 KB n=623
16 Correct 1 ms 344 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 344 KB n=938
21 Correct 1 ms 364 KB n=747
22 Correct 1 ms 600 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 65988 KB n=1000000
2 Correct 242 ms 41856 KB n=666666
3 Correct 132 ms 22704 KB n=400000
4 Correct 92 ms 14780 KB n=285714
5 Correct 8 ms 1504 KB n=20000
6 Correct 58 ms 11076 KB n=181818
7 Correct 3 ms 980 KB n=10000
8 Correct 3 ms 868 KB n=6666
9 Correct 1 ms 600 KB n=4000
10 Correct 3 ms 604 KB n=2857
11 Correct 2 ms 348 KB n=2000

Subtask #5
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 1 ms 344 KB n=3
4 Correct 1 ms 348 KB n=4
5 Correct 1 ms 348 KB n=4
6 Correct 1 ms 348 KB n=2
7 Correct 1 ms 348 KB n=5
8 Correct 1 ms 344 KB n=8
9 Correct 1 ms 344 KB n=14
10 Correct 1 ms 456 KB n=11
11 Correct 19 ms 3664 KB n=50000
12 Correct 16 ms 3544 KB n=50000
13 Correct 1 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 604 KB n=623
16 Correct 1 ms 344 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 344 KB n=938
21 Correct 1 ms 364 KB n=747
22 Correct 1 ms 600 KB n=991
23 Correct 385 ms 65988 KB n=1000000
24 Correct 242 ms 41856 KB n=666666
25 Correct 132 ms 22704 KB n=400000
26 Correct 92 ms 14780 KB n=285714
27 Correct 8 ms 1504 KB n=20000
28 Correct 58 ms 11076 KB n=181818
29 Correct 3 ms 980 KB n=10000
30 Correct 3 ms 868 KB n=6666
31 Correct 1 ms 600 KB n=4000
32 Correct 3 ms 604 KB n=2857
33 Correct 2 ms 348 KB n=2000
34 Correct 13 ms 2388 KB n=23514
35 Correct 14 ms 2388 KB n=23514
36 Correct 1 ms 344 KB n=940
37 Correct 0 ms 348 KB n=2
38 Correct 35 ms 5540 KB n=100000
39 Correct 34 ms 5576 KB n=100000
40 Correct 1 ms 348 KB n=10
41 Correct 1 ms 348 KB n=100
42 Correct 2 ms 600 KB n=1000
43 Correct 482 ms 84616 KB n=1000000
44 Correct 954 ms 91256 KB n=1000000
45 Correct 562 ms 61972 KB n=666666
46 Correct 275 ms 36480 KB n=400000
47 Correct 8 ms 1112 KB n=2336
48 Correct 454 ms 55808 KB n=285714
49 Correct 367 ms 44728 KB n=181818
50 Correct 22 ms 3032 KB n=40000
51 Correct 11 ms 1756 KB n=20000
52 Correct 7 ms 984 KB n=10000
53 Correct 33 ms 4496 KB n=6666
54 Correct 4 ms 604 KB n=4000
55 Correct 129 ms 16212 KB n=2857
56 Correct 3 ms 604 KB n=2000