Submission #920763

#	Time	Username	Problem	Language	Result	Execution time	Memory
920763		Jawad_Akbar_JJ	Toys (CEOI18_toy)	C++17	39 / 100	1386 ms	262144 KiB

toy

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>

using namespace std;
map<int,int> num;

signed main(){
	int n;
	cin>>n;

	vector<int> d;
	
	for (int i=1;i * i<=n;i++){
		if (n % i == 0){
			d.push_back(i);
			d.push_back(n / i);
		}
	}
	sort(begin(d),end(d));
	
	set<int> S[d.size() + 100];
	vector<int> vec[d.size() + 100];
	
	S[0].insert(0);
	vec[0].push_back(0);

	int k = d.size();
	
	for (int i=0;i<k;i++)
		num[d[i]] = i+1;
	set<pair<int,int>> P;
	P.insert({0,1});
	for (int i=1;i<k;i++){
		S[i].insert(d[i]-1);
		for (auto [l,j] : P)
			for (int m : S[i]){
				if (j * d[i] <= n)
					P.insert({l + m,j * d[i]});
				if (j * d[i] == n)
					S[k-1].insert(l + m);
			}
	}
	
	cout<<S[k-1].size()<<'\n';
	
	for (int i : S[k-1])
		printf("%d ",i);
	printf("\n");
}

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21