Submission #298493

#	Time	Username	Problem	Language	Result	Execution time	Memory
298493		jbroeksteeg	Nadan (COCI18_nadan)	C++14	50 / 50	1 ms	384 KiB

nadan

#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
	if (c.size() == 0) {os << "{}"; return os;}
	os << "{" << c[0];
	for (int i = 1; i < (int)c.size(); i++) {os <<", "<<c[i];}
	os << "}";
	return os;
}

const int inf = 2e9;

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k; cin >> k >> n;
	vector<int> ans(n);
	for (int i = 0; i < n; i++) {
		ans[i]=i+1;
		k-=i+1;
	}
	assert(k>=0);
	for (int i = n-1; i >= 0; i--) {
		if (k==0) break;
		int take = max(min(k, (i==n-1? inf : ans[i+1]-ans[i]-1)), 0);
		k-=take;
		ans[i]+=take;
	}

	for (int i: ans) cout << i << "\n";
	return 0;
}

• Subtask 1: 50 / 50