제출 #1270289

#제출 시각아이디문제언어결과실행 시간메모리
1270289dgarcia09Timovi (COCI18_timovi)C++20
20 / 80
775 ms3028 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("O2") #define int long long #define endl '\n' #define vc vector<int> using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.setf(ios::fixed); cout.precision(0); int n, k, m; cin >> n >> k >> m; vc ni(n, 0); while (m > 0){ for(int i = 0; i < n; i++){ if(m - k >= 0){ ni[i] += k; m -= k; }else if(m - k < 0 && m > 0){ ni[i] += m; m = 0; break; } if(m == 0) break; } if(m == 0) break; for(int i = n-2; i >= 0; i--){ if(m - k >= 0){ ni[i] += k; m -= k; }else if(m - k < 0 && m > 0){ ni[i] += m; m = 0; break; } if(m == 0) break; } } for(int i : ni) cout << i << " "; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...