Submission #866300

#	Time	Username	Problem	Language	Result	Execution time	Memory
866300		themm1	Toys (CEOI18_toy)	C++17	59 / 100	45 ms	262144 KiB

toy

#include <bits/stdc++.h>
using namespace std;
// ordered set whith s.order_of_key(x) method, which returns rank of element x in set s
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

// pair printing
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "(" << par.first << "; " << par.second << ")"; return out;}
// set printing
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// map printing
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// unordered_set printing
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// unordered_map printing
template <class T, class U>
ostream& operator<<(ostream& out, const unordered_map<T, U> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// vector printing
template<class T>
ostream& operator<<(ostream& out, const vector<T> &cont){ out << "[";  for (const auto &x:cont) out << x << ", ";  out << "]"; return out;}

#define print(x) cout << (x) << endl;
#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x << "; "
#define dmpl(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << endl

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define contains(s,x) ((s).find(x) != (s).end())
const int MOD = 998244353;

void solve() {
        int N;
        cin >> N;
        if (N == 1) {
                cout << 1 << endl;
                cout << 0 << endl;
                return;
        }
        vector<set<pii>> m(N + 1);
        set<int> ds;
        for (int i = 1; i < sqrt(N) + 1; i++) if (N % i == 0) {
                ds.insert(i);
                ds.insert(N / i);
        }
        vector<int> divisors(all(ds));
        for (int a : divisors) {
                if (a == 1) continue;
                int mx = sqrt(a) + 1;
                m[a].insert({ 1, a });
                for (int x : divisors) {
                        if (x >= mx) break;
                        if (a % x != 0) continue;
                        int y = a / x;
                        for (pii p1 : m[x]) for (pii p2 : m[y]) {
                                m[a].insert({ p1.ff + p2.ff, p1.ss + p2.ss });
                        }
                }
        }
        /*
        for (auto kv : m) {
                cout << kv.ff << ": " << kv.ss << endl;
        }
        */
        set<int> answer;
        for (pii p : m[N]) answer.insert(p.ss - p.ff);
        cout << sz(answer) << endl;
        for (int a : answer) cout << a << " ";
        cout << endl;

}

int32_t main() {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);

        int t = 1;
        // cin >> t;
        while (t--) {
                solve();
        }
}

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