제출 #696371

#제출 시각아이디문제언어결과실행 시간메모리
696371duyyyTimovi (COCI18_timovi)C++14
30 / 80
17 ms2852 KiB
#include<bits/stdc++.h> using namespace std; int main(){ long long n,k,m,a,b; cin>>n>>k>>m; long long kq[n+1]; memset(kq,0,sizeof(kq)); a=m/k,b=m%k; if(a<n) for(int i=1;i<=a+1;i++) if(m>k) {kq[i]=k;m-=k;} else kq[i]=m; else{ m-=n*k; for(int i=1;i<=n;i++) kq[i]=k; long long c=m/((n-1)*k),d=(m%((n-1)*k))/(n-1),l,r; if(c%2==0) {l=c/2;r=c/2;} else {l=c/2+1;r=c/2;} kq[1]+=(k*l); kq[n]+=(k*r); for(int i=2;i<n;i++) kq[i]+=(c*k); if(c%2==0) {for(int i=n-1;i>=n-d;i--) kq[i]+=k; kq[n-d-1]+=b;} else {for(int i=2;i<2+d;i++) kq[i]+=k; kq[2+d]+=b;} } for(int i=1;i<=n;i++) cout<<kq[i]<<' '; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...