제출 #48864

#제출 시각아이디문제언어결과실행 시간메모리
48864mrtsima22Gift (IZhO18_nicegift)C++17
30 / 100
154 ms6944 KiB
#include <bits/stdc++.h> using namespace std; #define lo long const int lmax=1999999999; const long long lmx=1999999999999999999; int n,k; long long a[100003],sum,p; set<pair<long long,int> >s; vector<vector<int> > ans; int main(){std::ios::sync_with_stdio(false); cin>>n>>k; for(int i=1;i<=n;i++) { cin>>a[i]; sum=sum+a[i]; } bool ok=1; for(int i=2;i<=n;i++) { ok=ok&(a[i]==a[i-1]); } if(sum%k!=0){ cout<<-1<<endl;return 0;} for(int i=1;i<=n;i++) { s.insert(make_pair(a[i],i)); } p=1; if(ok){ p=sum/(n*(k/__gcd(n,k))); } while(s.size()) { int t=0; vector<int>v; while(s.size()&&t<k) { set<pair<long long,int> >::iterator it=s.end(); it--; int u=(*(it)).second; s.erase(it); v.push_back(u); a[u]-=p; t++; } if(t!=k){cout<<-1<<endl;return 0; } for(int i=0;i<v.size();i++) { if(a[v[i]]>0) { s.insert(make_pair(a[v[i]],v[i])); } } ans.push_back(v); } cout<<ans.size()<<endl; for(int i=0;i<ans.size();i++) { cout<<p<<" "; for(int j=0;j<ans[i].size();j++) { cout<<ans[i][j]<<" "; } cout<<endl; } } /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

컴파일 시 표준 에러 (stderr) 메시지

nicegift.cpp: In function 'int main()':
nicegift.cpp:49:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++)
              ~^~~~~~~~~
nicegift.cpp:59:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<ans.size();i++)
             ~^~~~~~~~~~~
nicegift.cpp:62:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<ans[i].size();j++)
              ~^~~~~~~~~~~~~~
#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...