Submission #239664

#TimeUsernameProblemLanguageResultExecution timeMemory
239664VimmerTimovi (COCI18_timovi)C++14
40 / 80
30 ms5880 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#pragma GCC optimize("unroll-loops") //#pragma GCC optimize("-O3") //#pragma GCC optimize("Ofast") //#pragma GCC optimize("fast-math") //#pragma GCC optimize("no-stack-protector") #define F first #define S second #define sz(x) int(x.size()) #define pb push_back #define N 101001 #define M ll(1e9 + 7) #define inf 1e9 + 1e9 using namespace std; //using namespace __gnu_pbds; typedef long double ld; typedef long long ll; typedef short int si; typedef array <int, 3> a3; //typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; ll calc(ll n, ll k, ll x) {return (n - 1) * k * x + n * k;} int main() { //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout); ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m, k; cin >> n >> k >> m; ll l = 0, r = m; while (l + 1 < r) { ll md = (l + r) >> 1; if (m >= calc(n, k, md)) l = md; else r = md; } while (calc(n, k, l + 1) <= m) l++; while (calc(n, k, l) > m) l--; if (l == -1) { for (int i = 0; i < n; i++) { if (m >= k) { cout << k << " "; m -= k; } else { cout << m << " "; m = 0; } } exit(0); } ll ost = m - calc(n, k, l); ll a[n]; for (int i = 0; i < n; i++) { ll sum = k; if (l % 2) { if (ost >= k) { sum += k; ost -= k; } else { sum += ost; ost = 0; } } if (i == 0) sum += ((l + 1) / 2) * k; else if (i == n - 1) sum += (l / 2) * k; else sum += l * k; a[i] = sum; } if (l % 2 == 0) for (int i = n - 2; i >= 0; i--) { if (ost >= k) { a[i] += k; ost -= k; } else { a[i] += ost; ost = 0; } } for (int i = 0; i < n; i++) cout << a[i] << " "; }
#Verdict Execution timeMemoryGrader output
Fetching results...