Submission #722843

#TimeUsernameProblemLanguageResultExecution timeMemory
722843vjudge1Timovi (COCI18_timovi)C++17
20 / 80
1090 ms14312 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...