답안 #650218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650218 2022-10-13T00:01:39 Z inksamurai Timovi (COCI18_timovi) C++17
20 / 80
949 ms 2912 KB
#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/(k*(2*n-1));
	vi a(n,0);
	// a[n-1]=x*k;
	// m-=x*(k*(2*n-1));
	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]<<" ";
	}
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Correct 13 ms 2264 KB Output is correct
4 Correct 14 ms 2260 KB Output is correct
5 Incorrect 921 ms 292 KB Output isn't correct
6 Incorrect 802 ms 296 KB Output isn't correct
7 Incorrect 711 ms 2912 KB Output isn't correct
8 Incorrect 949 ms 2892 KB Output isn't correct