제출 #650216

#제출 시각아이디문제언어결과실행 시간메모리
650216inksamuraiTimovi (COCI18_timovi)C++17
20 / 80
16 ms2932 KiB
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3yqVz8E;
	int n,k,m;
	cin>>n>>k>>m;
	int x=m/(2*k*n)-1;
	x=max(0ll,x);
	vi a(n,2*x*k);
	m-=2*x*k*n;
	while(m){
		rep(i,n){
			a[i]+=min(m,k);
			m-=min(m,k);
		}
		per(i,n-1){
			a[i]+=min(m,k);
			m-=min(m,k);	
		}
	}
	rep(i,n){
		cout<<a[i]<<" ";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...