Submission #71050

#	Time	Username	Problem	Language	Result	Execution time	Memory
71050		qkxwsm	Toys (CEOI18_toy)	C++17	100 / 100	2009 ms	261700 KiB

toy

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
        return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 70013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

ll N, M;
vector<ll> factors;
vector<ll> dp[MAXN];

int indexof(int x)
{
        return LB(factors.begin(), factors.end(), x) - factors.begin();
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//     cout << fixed << setprecision(10);
	//     cerr << fixed << setprecision(10);
	//     if (fopen("input.in", "r"))
	//     {
	//             freopen ("input.in", "r", stdin);
	//             freopen ("output.out", "w", stdout);
	//     }
        cin >> N;
        for (int i = 1; i * i <= N; i++)
        {
                if (N % i)
                {
                        continue;
                }
                factors.PB(i);
                if (i * i != N)
                {
                        factors.PB(N / i);
                }
        }
        sort(factors.begin(), factors.end());
        // for (int x : factors)
        // {
        //         cerr << x << ' ';
        // }
        // cerr << endl;
        M = factors.size();
        dp[M - 1].PB(0);
        for (int i = M - 1; i > 0; i--)
        {
                // cerr << dp[i].size() << endl;
                sort(dp[i].begin(), dp[i].end());
                dp[i].erase(unique(dp[i].begin(), dp[i].end()), dp[i].end());
                for (int j = 1; j <= i; j++)
                {
                        if (factors[i] % factors[j])
                        {
                                continue;
                        }
                        int idx = indexof(factors[i] / factors[j]);
                        ll c = factors[j] - 1;
                        for (ll x : dp[i])
                        {
                                dp[idx].PB(x + c);
                        }
                }
        }
        sort(dp[0].begin(), dp[0].end());
        dp[0].erase(unique(dp[0].begin(), dp[0].end()), dp[0].end());
        cout << dp[0].size() << '\n';
        for (ll x : dp[0])
        {
                cout << x << ' ';
        }
        cout << '\n';
        //break up N into factors then..
	//     cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

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