제출 #385746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
385746		mohamedsobhi777	Toys (CEOI18_toy)	C++14	59 / 100	5056 ms	1636 KiB

toy

#include <bits/stdc++.h>

using namespace std;

#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define pb push_back
#define f first
#define s second
#define sz(_) ((int)_.size())
#define all(_) _.begin(), _.end()
#define lb lower_bound
#define ub upper_bound

using ll = long long;
using ld = long double;

const int N = 1e5 + 7;
const ll mod = 1e9 + 7;

int n;
set<int> ans;
vi prm;

vi facto(int x)
{
       vi ret;
       for (int i = 2; i * i <= x; ++i)
       {
              while (x % i == 0)
              {
                     ret.pb(i);
                     x /= i;
              }
       }
       if (x > 1)
              ret.pb(x);
       return ret;
}

int sum;
int tkn = 0;

void backtrack()
{
       if (tkn == (1 << sz(prm)) - 1)
       {
              ans.insert(sum);
              return;
       }
       int ntkn = (tkn ^ ((1 << sz(prm)) - 1));
       for (int i = ntkn; i; i = (i - 1) & ntkn)
       {
              // if ((tkn & i))
              // continue;
              int asum = 1;
              bool flag = 0;
              for (int j = 0; j < sz(prm); ++j)
              {
                     if (i & (1 << j))
                     {
                            asum *= prm[j];
                            auto got = [&](int u, int z) -> bool {
                                   return (u & (1 << z)) > 0;
                            };
                            if (j && prm[j] == prm[j - 1] && !got(tkn, j - 1) && !got(i, j - 1))
                            {
                                   flag = 1;
                                   break;
                            }
                     }
              }
              if (flag)
                     continue;
              sum += asum - 1;
              int omask = tkn;
              tkn |= i;
              backtrack();
              tkn = omask;
              sum -= asum - 1;
       }
}

vii prep(vi x)
{
       vii ret;
       int z = sz(x);
       for (int i = 0; i < (1 << z); ++i)
       {
              int mul = 1;
              for (int j = 0; j < z; ++j)
              {
                     if (i & (1 << j))
                     {
                            mul *= x[j];
                     }
              }
              ret.pb({__builtin_popcount(i), mul});
       }

       return ret;
}

int main()
{
       ios_base::sync_with_stdio(0);
       cin.tie(0);
#ifndef ONLINE_JUDGE
#endif
       cin >> n;
       prm = facto(n);
       sort(all(prm));
       vi lhs, rhs;

       for (int i = 0; i < sz(prm); ++i)
       {
              if (i < sz(prm) / 2)
                     lhs.pb(prm[i]);
              else
                     rhs.pb(prm[i]);
       }
       // vii LHS = prep(lhs), RHS = prep(rhs);
       // for(int auto u : LHS){
       //        for(auto u2:RHS){

       //        }
       // }
       backtrack();
       cout << sz(ans) << "\n";
       for (auto u : ans)
       {
              cout << u << " ";
       }
       return 0;
}

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