oj.uz

답안 #164482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164482 2019-11-21T04:22:26 Z crushteacherswife Timovi (COCI18_timovi) C++14
50 / 80
 16 ms 788 KB 
//Rochy'.'
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
#define fl(i,a,b) for(int i=a;i<b;++i)
#define fa(i,a) for(auto i:a)
#define ii pair <long long,int>
#define vi vector <int>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));
if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar()))x=x*10+c-48;if(nega)x=-x;}
template <typename T> inline void writep(T x){if(x>9)writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
template <typename R, typename D> inline void Min(R &a, D b){if(a>b) a=b;}
template <typename D, typename R> inline void Max(D &a, R b){if(a<b) a=b;}
const int N=102;
long long n,m,k,add,all;
int main(){
    ios_base::sync_with_stdio(NULL);
    cin. tie(NULL); cout. tie(NULL);
//    freopen(".inp" , "r", stdin);
//    freopen(".out", "w", stdout);
	cin>>n>>k>>m;
	all=m/((n+n-2)*k);
	m-=all*(n+n-2)*k;
	if(m<=n*k){
		fo(i,1,n){
			add = (m>=k?k:m);
			if(i==1||i==n) cout<<all*k+add<<' ';
			else cout<<all*2*k+add<<' ';
			m-=add;
		}
		return 0;
	}
	m-=n*k;
	fo(i,1,n){
		if(i==1||i==n){
			cout<<add*k+k<<' ';
			continue;
		}
		long long remain=m-(k*(n-i-1));
		Max(remain,0);
		Min(remain,k);
		cout<<add*2*k+k+add<<' ';
	}
}

Subtask #1
50.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 16 ms 788 KB Output is correct
4 Correct 16 ms 760 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 16 ms 760 KB Output isn't correct
8 Incorrect 16 ms 760 KB Output isn't correct