Submission #872832

#	Time	Username	Problem	Language	Result	Execution time	Memory
872832		bobbilyking	Toys (CEOI18_toy)	C++17	79 / 100	5098 ms	52844 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<ll> factors;

set<pl> dp;
unordered_set<ll> vis;
 
void dfs(ll n, ll sm){
    if (n == 1) {
        vis.insert(sm); 
        return;
    }
    if (dp.count({n, sm})) return;
    dp.emplace(n, sm);
    for (auto x: factors) {
        if (x > n) break;
        if (n%x) continue;
        dfs(n/x, sm + x-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){
        factors.push_back(i);
        if (i*i != n) factors.push_back(n/i);
    }
    factors.push_back(n);
    sort(A(factors));
    
    dfs(n, 0);

    vector<ll> ans(A(vis));
    sort(A(ans));
 
    cout << ans.size() << '\n';
    for (auto x: ans) cout << x << " "; cout << '\n';
}

Compilation message (stderr)

toy.cpp: In function 'int main()':
toy.cpp:65:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   65 |     for (auto x: ans) cout << x << " "; cout << '\n';
      |     ^~~
toy.cpp:65:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   65 |     for (auto x: ans) cout << x << " "; cout << '\n';
      |                                         ^~~~

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