Submission #943031

#	Time	Username	Problem	Language	Result	Execution time	Memory
943031		vjudge1	Toys (CEOI18_toy)	C++17	59 / 100	5070 ms	262144 KiB

toy

#include <bits/stdc++.h>

using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    unordered_map<int, unordered_map<int, int> > mp;
    vector<int> p;
    for(int i = 2; i * i <= n; i++){
        if(n%i != 0) continue;
            p.push_back(i); 
            if(n / i != i) p.push_back(n / i);
    }
    p.push_back(n);
    sort(all(p));
    function<void(int, int, int)> f=[&](int cur, int sum, int last){
            if(cur > n) return;
            if(mp[cur].count(sum)) return;
            mp[cur][sum] = 1;
            if(cur == n) return;
            for(int id = last; id < (int)p.size(); id++){
                int x = p[id];
                if((cur * x) > n) break;
                if(mp[cur * x].count(sum + x - 1) == false) f(cur*x,  sum + x - 1, id);
            }
    };
    f(1, 0, 0);
    vector<int> ans;
    for(auto x : mp[n]) ans.push_back(x.ff);
    sort(all(ans));
    cout << ans.size() << '\n';
    for(auto x : ans) cout << x << ' ';
    
    
    
    return 0;
}

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