Submission #872788

#	Time	Username	Problem	Language	Result	Execution time	Memory
872788		bobbilyking	Toys (CEOI18_toy)	C++17	79 / 100	5043 ms	68996 KiB

toy

#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef int ll;
typedef long double ld;
typedef pair<ll, ll> pl;

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = (l); i < r; ++i)

using dp_t=array<ll, 10>;
vector<pl> glob_facs;

set<pair<dp_t, ll>> dp;

set<ll> vis;

void dfs(dp_t& facs, ll sm){
    ll ans = accumulate(A(facs), 0ll);
    if (!ans) {
        vis.insert(sm); 
        return;
    }
    if (dp.count({facs, sm})) return;
    dp.emplace(facs, sm);

    function<void(ll, ll)> gen = [&](ll idx, ll csm) {
        if (idx == glob_facs.size()) {
            if (csm == 1) return;
            dfs(facs, csm + sm - 1);
            return;
        }
        ll prod = 1;
        F(j, 0, facs[idx]+1) {
            facs[idx] -= j;     
            gen(idx+1, prod * csm);
            prod = prod * glob_facs[idx].K;
            facs[idx] += j;
        }
    };
    gen(0, 1);
}

int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    G(n)
    for (ll i = 2; i *i <=n ;++i) if (n%i == 0) {
        ll cnt = 0;
        while (n%i==0) cnt++, n/=i;
        glob_facs.emplace_back(i, cnt);
    }
    if (n-1) glob_facs.emplace_back(n, 1);

    sort(A(glob_facs), [&](const auto &a, const auto &b) {
        return a.V > b.V;
    });

    dp_t cur = {};
    F(j, 0, glob_facs.size()) cur[j] = glob_facs[j].V;

    dfs(cur, 0);

    cout << vis.size() << '\n';
    for (auto x: vis) cout << x << " "; cout << '\n';
}

Compilation message (stderr)

toy.cpp: In lambda function:
toy.cpp:39:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         if (idx == glob_facs.size()) {
      |             ~~~~^~~~~~~~~~~~~~~~~~~
toy.cpp: In function 'int main()':
toy.cpp:20:39: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | #define F(i, l, r) for (ll i = (l); i < r; ++i)
......
   74 |     F(j, 0, glob_facs.size()) cur[j] = glob_facs[j].V;
      |       ~~~~~~~~~~~~~~~~~~~~~~           
toy.cpp:74:5: note: in expansion of macro 'F'
   74 |     F(j, 0, glob_facs.size()) cur[j] = glob_facs[j].V;
      |     ^
toy.cpp:79:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   79 |     for (auto x: vis) cout << x << " "; cout << '\n';
      |     ^~~
toy.cpp:79:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   79 |     for (auto x: vis) cout << x << " "; cout << '\n';
      |                                         ^~~~

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