#include <bits/stdc++.h>
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define sts stable_sort
using namespace std;
const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
ll n, k, m; cin >> n >> k >> m;
if(n == 1){
cout << m << "\n";
return 0;
}
map<ll, ll> ma;
bool a = 1;
for(int i = 1; m > 0; ){
if(m >= k){
ma[i] += k;
m -= k;
}else{
ma[i] += m;
break;
}
if(i == 1 && !a){
a = 1;
}else if(i == n && a){
a = 0;
}
if(a)i++;
else i--;
}
for(int i = 1; i <= n; i++){
cout << ma[i] << " ";
}cout << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
58 ms |
13168 KB |
Output is correct |
4 |
Correct |
58 ms |
13196 KB |
Output is correct |
5 |
Execution timed out |
1086 ms |
212 KB |
Time limit exceeded |
6 |
Execution timed out |
1064 ms |
212 KB |
Time limit exceeded |
7 |
Execution timed out |
1083 ms |
12756 KB |
Time limit exceeded |
8 |
Execution timed out |
1074 ms |
12752 KB |
Time limit exceeded |