#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, c, cnt; cin >> n >> c >> cnt;
map<ll, ll> m;
vector<ll> v(n);
for(ll i = 0; i < n; i++){
if(cnt >= c){
m[i] += c;
cnt -= c;
v[i] = m[i];
}else{
m[i] += cnt;
cnt = 0;
v[i] = m[i];
}
if(cnt == 0)break;
if(i == n - 1){
i = 0;
}
}
for(auto &c : v){
cout << c << " ";
}
cout << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Correct |
16 ms |
3024 KB |
Output is correct |
4 |
Correct |
13 ms |
2276 KB |
Output is correct |
5 |
Execution timed out |
1090 ms |
212 KB |
Time limit exceeded |
6 |
Execution timed out |
1075 ms |
212 KB |
Time limit exceeded |
7 |
Execution timed out |
1076 ms |
14312 KB |
Time limit exceeded |
8 |
Execution timed out |
1070 ms |
14284 KB |
Time limit exceeded |