Submission #1270291

#TimeUsernameProblemLanguageResultExecution timeMemory
1270291dgarcia09Timovi (COCI18_timovi)C++20
80 / 80
15 ms2884 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); if(n == 1){ cout << m << endl; return 0; } else{ int totc = 2 * (n-1), cantc = totc * k, c = m / cantc, nq = m - c * cantc; for (int i = 0; i < n; i++) { if (i == 0 || i == n - 1) { ni[i] += c * k; } else { ni[i] += 2 * c * k; } } int i = 0, d = 1; while (nq > 0) { int cn = min(k, nq); ni[i] += cn; nq -= cn; if (i == n - 1) d = -1; else if (i == 0 && d == -1) break; i += d; } } for(int i : ni) cout << i << " "; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...