oj.uz

Submission #168476

# Submission time Handle Problem Language Result Execution time Memory
168476 2019-12-13T08:52:35 Z achibasadzishvili Gift (IZhO18_nicegift) C++14
49 / 100
 2000 ms 105156 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,k,a[2000005],s,las,p,cur,maxi,l,r,mid,can;
set<pair<ll,ll> >st;
vector<vector<ll> >ans;
vector<ll>g;
int main(){
    scanf("%lld%lld",&n,&k);
    bool ok = 1;
    for(int i=1; i<=n; i++){
        scanf("%lld",&a[i]);
        if(a[i] != a[1])ok = 0;
        s += a[i];
        st.insert(mp(-a[i] , i));
    }

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

    ll raod = s / k;
    ll sum = s;
    ll ra = 0;
    while(sum){
        if((int)st.size() < k){
            cout << "-1";
            return 0;
        }
        p = 0,cur = 0;
        g.clear();
        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;
        }
        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;
        ra += 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);
    }

    printf("%d\n",(int)ans.size());

    for(int i=0; i<ans.size(); i++){
        for(int j=0; j<ans[i].size(); j++)
            printf("%lld " , ans[i][j]);
        printf("\n");
    }



    return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:46:42: warning: right operand of comma operator has no effect [-Wunused-value]
         l = 1 , r = a[las] , mid , can = 1;
                                          ^
nicegift.cpp:69:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<g.size(); i++){
                      ~^~~~~~~~~
nicegift.cpp:79:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<ans.size(); i++){
                  ~^~~~~~~~~~~
nicegift.cpp:80:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<ans[i].size(); j++)
                      ~^~~~~~~~~~~~~~
nicegift.cpp:14:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
     bool ok = 1;
          ^~
nicegift.cpp:27:8: warning: unused variable 'raod' [-Wunused-variable]
     ll raod = s / k;
        ^~~~
nicegift.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~
nicegift.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&a[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 348 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 380 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 348 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 256 KB n=14
10 Correct 2 ms 256 KB n=11
11 Correct 40 ms 5296 KB n=50000
12 Correct 36 ms 4900 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 3 ms 376 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 380 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 348 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 256 KB n=14
10 Correct 2 ms 256 KB n=11
11 Correct 40 ms 5296 KB n=50000
12 Correct 36 ms 4900 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 3 ms 376 KB n=973
17 Correct 3 ms 376 KB n=989
18 Correct 3 ms 424 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 3 ms 376 KB n=747
22 Correct 3 ms 376 KB n=991

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1096 ms 85672 KB n=1000000
2 Correct 666 ms 57180 KB n=666666
3 Correct 377 ms 36468 KB n=400000
4 Correct 249 ms 24952 KB n=285714
5 Correct 15 ms 2168 KB n=20000
6 Correct 151 ms 16504 KB n=181818
7 Correct 8 ms 1272 KB n=10000
8 Correct 7 ms 1016 KB n=6666
9 Correct 4 ms 760 KB n=4000
10 Correct 8 ms 760 KB n=2857
11 Correct 3 ms 504 KB n=2000

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 348 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 256 KB n=14
10 Correct 2 ms 256 KB n=11
11 Correct 40 ms 5296 KB n=50000
12 Correct 36 ms 4900 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 3 ms 376 KB n=973
17 Correct 3 ms 376 KB n=989
18 Correct 3 ms 424 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 3 ms 376 KB n=747
22 Correct 3 ms 376 KB n=991
23 Correct 1096 ms 85672 KB n=1000000
24 Correct 666 ms 57180 KB n=666666
25 Correct 377 ms 36468 KB n=400000
26 Correct 249 ms 24952 KB n=285714
27 Correct 15 ms 2168 KB n=20000
28 Correct 151 ms 16504 KB n=181818
29 Correct 8 ms 1272 KB n=10000
30 Correct 7 ms 1016 KB n=6666
31 Correct 4 ms 760 KB n=4000
32 Correct 8 ms 760 KB n=2857
33 Correct 3 ms 504 KB n=2000
34 Correct 30 ms 3056 KB n=23514
35 Correct 31 ms 3060 KB n=23514
36 Correct 3 ms 376 KB n=940
37 Correct 2 ms 256 KB n=2
38 Correct 82 ms 9100 KB n=100000
39 Correct 82 ms 9200 KB n=100000
40 Correct 2 ms 376 KB n=10
41 Correct 2 ms 376 KB n=100
42 Correct 6 ms 632 KB n=1000
43 Correct 1484 ms 105156 KB n=1000000
44 Execution timed out 2055 ms 84468 KB Time limit exceeded
45 Halted 0 ms 0 KB -