Submission #1119736

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119736		vjudge1	Toys (CEOI18_toy)	C++17	0 / 100	1 ms	336 KiB

toy

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll int
#define F first
#define S second
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define all(x) x.begin(), x.end()

const int mod = 1e9 + 7;
const int N = 10001;

using namespace std;
using namespace __gnu_pbds;

ll n, a;
map <vector<ll>, ll> mp;
vector <ll> del;
set <ll> ans;

void rec (vector <ll> v, ll sum){
	mp[v]++;
	ans.insert (sum - v.size());
	vector <ll> q;
	set <ll> k;
	for (auto i: v){
		k.insert(i);
//		cout << i << ' ';
	}
//	cout << '\n';
	for (auto i: k){
		for (auto y: del){
			if (i % y || i / y == i || i / y == 1){
				continue;
			}
			q.clear();
			ll a = -1;
			for (int j = 0; j < v.size(); j++){
				if (i == v[j] && a == -1){
					a = 1;
					continue;
				}
				q.pb (v[j]);
			}
			q.pb(y);
			q.pb(i / y);
			sort (all (q));
			if (mp[q] == 0)rec (q, sum - i + y + i / y);
		}
	}
}

signed main (){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 2; i < sqrt (n); i++){
		if (n % i == 0){
			del.pb(i);
			if (n / i != i){
				del.pb(n / i);
			}
		}
	}
	rec ({n}, n);
	cout << ans.size() << '\n';
	for (auto i: ans){
		cout << i << ' ';
	}
}

Compilation message (stderr)

toy.cpp: In function 'void rec(std::vector<int>, int)':
toy.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |    for (int j = 0; j < v.size(); j++){
      |                    ~~^~~~~~~~~~

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