oj.uz

Submission #168467

# Submission time Handle Problem Language Result Execution time Memory
168467 2019-12-13T08:35:55 Z achibasadzishvili Gift (IZhO18_nicegift) C++14
30 / 100
 69 ms 19960 KB 
#include <bits/stdc++.h>
#define ll int
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,k,a[200005],s,las;
set<pair<ll,ll> >st;
vector<vector<ll> >ans;
vector<ll>g;
int main(){
    ios::sync_with_stdio(false);
    cin >> n >> k;
    bool ok = 1;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        if(a[i] != a[1])ok = 0;
        s += a[i];
        st.insert(mp(-a[i] , i));
    }
    /*
    if(ok){
        ll m = n , ind = 1;
        while(m - k >= k){
            m -= k;
            g.clear();
            g.pb(a[ind]);
            for(int i=ind; i<ind + k; i++){
                g.pb(i);
                a[i] = 0;
            }
            ind += k;
            ans.pb(g);
        }
        st.clear();
        s = 0;
        for(int i=1; i<=n; i++){
            s += a[i];
            if(a[i])
                st.insert(mp(-a[i] , i));
        }
    }
    */

    if(s % k){
        cout << "-1";
        return 0;
    }

    ll raod = s / k;
    ll sum = s;
    while(sum){
        if((int)st.size() < k){
            cout << "-1";
            return 0;
        }
        ll p = 0,cur = 0;
        g.clear();
        ll maxi = -(*st.begin()).f;
        for(set<pair<ll,ll> >::iterator it = st.begin(); it != st.end(); it++){
            p++;
            if(p > k){
                cur = (*it).s;
                break;
            }
            las = (*it).s;
        }
        ll l = 1 , r = a[las] , mid , can = 1;
        while(r >= l){
            mid = (l + r) / 2;
            if(max(maxi - mid , a[cur]) * k <= sum - mid * k){
                l = mid + 1;
                can = mid;
            }
            else {
                r = mid - 1;
            }
        }
        sum -= can * k;
        p = 0;
        g.pb(can);
        for(set<pair<ll,ll> >::iterator it = st.begin(); it != st.end(); it++){
            p++;
            if(p > k){
                cur = (*it).s;
                break;
            }
            g.pb((*it).s);
        }
        for(int i=1; i<g.size(); i++){
            st.erase(mp(-a[g[i]] , g[i]));
            a[g[i]]-=can;
            if(a[g[i]])st.insert(mp(-a[g[i]] , g[i]));
        }
        ans.pb(g);
    }

    cout << (int)ans.size() << endl;

    for(int i=0; i<ans.size(); i++){
        for(int j=0; j<ans[i].size(); j++)
            cout << ans[i][j] << " ";
        cout << '\n';
    }



    return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:91:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<g.size(); i++){
                      ~^~~~~~~~~
nicegift.cpp:101:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<ans.size(); i++){
                  ~^~~~~~~~~~~
nicegift.cpp:102:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<ans[i].size(); j++)
                      ~^~~~~~~~~~~~~~
nicegift.cpp:15:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
     bool ok = 1;
          ^~
nicegift.cpp:51:8: warning: unused variable 'raod' [-Wunused-variable]
     ll raod = s / k;
        ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 252 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 380 KB n=4
5 Correct 2 ms 380 KB n=4
6 Correct 2 ms 376 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 252 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 380 KB n=4
5 Correct 2 ms 380 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 5 ms 1016 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 34 ms 4268 KB n=50000
12 Correct 29 ms 3944 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 2 ms 504 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 252 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 380 KB n=4
5 Correct 2 ms 380 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 5 ms 1016 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 34 ms 4268 KB n=50000
12 Correct 29 ms 3944 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 2 ms 504 KB n=973
17 Correct 2 ms 504 KB n=989
18 Correct 2 ms 376 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 2 ms 380 KB n=747
22 Correct 2 ms 376 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 69 ms 19960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 252 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 380 KB n=4
5 Correct 2 ms 380 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 5 ms 1016 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 34 ms 4268 KB n=50000
12 Correct 29 ms 3944 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 2 ms 504 KB n=973
17 Correct 2 ms 504 KB n=989
18 Correct 2 ms 376 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 2 ms 380 KB n=747
22 Correct 2 ms 376 KB n=991
23 Runtime error 69 ms 19960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -