# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696376 | duyyy | Timovi (COCI18_timovi) | C++14 | 19 ms | 2272 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;break;}
else{
m-=n*k;
for(int i=1;i<=n;i++) kq[i]=k;
long long c=m/((n-1)*k),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);
m-=c*(n-1)*k;
if(c%2==0){
for(int i=n-1;i>0;i--)
if(m>k) {kq[i]=k;m-=k;}
else kq[i]=m;
}
else{
for(int i=2;i<=n;i++)
if(m>k) {kq[i]=k;m-=k;}
else kq[i]=m;
}
}
for(int i=1;i<=n;i++) cout<<kq[i]<<' ';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |