oj.uz

Submission #168507

# Submission time Handle Problem Language Result Execution time Memory
168507 2019-12-13T11:47:36 Z achibasadzishvili Gift (IZhO18_nicegift) C++14
49 / 100
 2000 ms 104728 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,ans1;
set<pair<ll,int> >st;
vector<vector<ll> >ans;
ll g[4000005],sz=0,wsz;
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(ra > 1500000){
    		cout << "-1";
    		return 0;
    	}
        if((int)st.size() < k){
            cout << "-1";
            return 0;
        }
        p = 0,cur = 0;
        maxi = -(*st.begin()).f;
        for(set<pair<ll,int> >::iterator it = st.begin(); it != st.end(); it++){
            p++;
            if(p > k){
                cur = (*it).s;
                break;
            }
            las = (*it).s;
        }
        ll x1 = a[las];
        if(k > 1)x1 = (sum - maxi) / (k - 1);
        can = (sum - a[cur] * k) / k;
        if(can > x1)can = x1;
        if(can > a[las])can = a[las];
        if(can <= 0){
        	cout << "-1";
        	return 0;
        }
        sum -= can * k;
        ra += k;
        p = 0;
        ans1++;
        g[sz] = can;sz++;
        wsz=sz;
        for(set<pair<ll,int> >::iterator it = st.begin(); it != st.end(); it++){
            p++;
            if(p > k){
                cur = (*it).s;
                break;
            }
            g[sz] = ((*it).s);
            sz++;
        }
        for(int i=wsz; i<sz; 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]));
        }
    }

    printf("%lld ",ans1);
 
    for(int i=0; i<sz; i++)
    	printf("%lld ",g[i]);
 
    return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:14:8: 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:7: 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 348 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 256 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 380 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 256 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 380 KB n=2
7 Correct 2 ms 308 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 256 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 38 ms 5112 KB n=50000
12 Correct 32 ms 4856 KB n=50000
13 Correct 2 ms 252 KB n=10
14 Correct 3 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 3 ms 380 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 256 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 380 KB n=2
7 Correct 2 ms 308 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 256 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 38 ms 5112 KB n=50000
12 Correct 32 ms 4856 KB n=50000
13 Correct 2 ms 252 KB n=10
14 Correct 3 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 3 ms 380 KB n=973
17 Correct 3 ms 376 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 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 952 ms 98824 KB n=1000000
2 Correct 609 ms 64192 KB n=666666
3 Correct 353 ms 41636 KB n=400000
4 Correct 241 ms 29448 KB n=285714
5 Correct 14 ms 2296 KB n=20000
6 Correct 148 ms 18712 KB n=181818
7 Correct 8 ms 1324 KB n=10000
8 Correct 7 ms 1016 KB n=6666
9 Correct 4 ms 760 KB n=4000
10 Correct 8 ms 888 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 348 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 256 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 380 KB n=2
7 Correct 2 ms 308 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 256 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 38 ms 5112 KB n=50000
12 Correct 32 ms 4856 KB n=50000
13 Correct 2 ms 252 KB n=10
14 Correct 3 ms 376 KB n=685
15 Correct 2 ms 376 KB n=623
16 Correct 3 ms 380 KB n=973
17 Correct 3 ms 376 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 3 ms 376 KB n=747
22 Correct 3 ms 376 KB n=991
23 Correct 952 ms 98824 KB n=1000000
24 Correct 609 ms 64192 KB n=666666
25 Correct 353 ms 41636 KB n=400000
26 Correct 241 ms 29448 KB n=285714
27 Correct 14 ms 2296 KB n=20000
28 Correct 148 ms 18712 KB n=181818
29 Correct 8 ms 1324 KB n=10000
30 Correct 7 ms 1016 KB n=6666
31 Correct 4 ms 760 KB n=4000
32 Correct 8 ms 888 KB n=2857
33 Correct 3 ms 504 KB n=2000
34 Correct 26 ms 2808 KB n=23514
35 Correct 26 ms 2808 KB n=23514
36 Correct 3 ms 504 KB n=940
37 Correct 2 ms 376 KB n=2
38 Correct 74 ms 9336 KB n=100000
39 Correct 93 ms 9360 KB n=100000
40 Correct 2 ms 376 KB n=10
41 Correct 2 ms 376 KB n=100
42 Correct 6 ms 504 KB n=1000
43 Correct 1326 ms 104728 KB n=1000000
44 Execution timed out 2070 ms 90360 KB Time limit exceeded
45 Halted 0 ms 0 KB -