Submission #168506

#TimeUsernameProblemLanguageResultExecution timeMemory
168506achibasadzishviliGift (IZhO18_nicegift)C++14
49 / 100
2067 ms105568 KiB
#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(){ ios::sync_with_stdio(0); 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(s % k){ cout << "-1"; return 0; } ll raod = s / k; ll sum = s; ll ra = 0; while(sum){ if(ra > 2000000){ 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; } // l = 1 , r = a[las] , mid , can = -1; 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])); } } cout<<ans1<<"\n"; for(int i=0; i<sz; i++) cout << g[i] << " "; return 0; }

Compilation message (stderr)

nicegift.cpp: In function 'int main()':
nicegift.cpp:15:8: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   bool ok = 1;
        ^~
nicegift.cpp:28:8: warning: unused variable 'raod' [-Wunused-variable]
     ll raod = s / k;
        ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...