oj.uz

Submission #85838

# Submission time Handle Problem Language Result Execution time Memory
85838 2018-11-21T21:49:23 Z kraljlavova1 Timovi (COCI18_timovi) C++11
80 / 80
 25 ms 3124 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
const int MAXN=200010;
ll n,k,m;
ll x,y,l,last;
ll sol[MAXN];
int main(){
	cin>>n>>k>>m;
	x=m/k;
	l=m%k;
	y=x%(2*(n-1));
	x=x/(2*(n-1));
	for(int i=0;i<n;i++){
		sol[i]+=x*k;
	}
	for(int i=1;i<n-1;i++){
		sol[i]+=x*k;
	}
	for(int i=0;i<min(n,y);i++){
		sol[i]+=k;
		last=i;
	}
	y-=min(n,y);
	if(!y){
		last++;
		if(last==n) last-=2;
		sol[last]+=l;
	}
	else{
		for(int i=0;i<y;i++){
			sol[n-i-2]+=k;
			last=n-i-2;
		}
		last--;
		if(last==-1) last+=2;
		sol[last]+=l;
	}
	for(int i=0;i<n;i++){
		cout<<sol[i]<<" ";
	}
	cout<<"\n";
	return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 20 ms 2336 KB Output is correct
4 Correct 20 ms 2392 KB Output is correct
5 Correct 3 ms 2392 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 25 ms 2980 KB Output is correct
8 Correct 23 ms 3124 KB Output is correct