Submission #537997

#TimeUsernameProblemLanguageResultExecution timeMemory
537997kymToys (CEOI18_toy)C++14
59 / 100
1139 ms262144 KiB
#include <bits/stdc++.h> using namespace std; #define int ll #define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i) #define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i) #define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0); #ifdef LOCAL #define db(x) cerr << #x << "=" << x << "\n" #define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n" #define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n" #define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n" #define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n" #define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n" #define reach cerr << "LINE: " << __LINE__ << "\n"; #else #define db(x) #define db2(x,y) #define db3(a,b,c) #define dbv(v) #define dbvp(v) #define dba(a,ss,ee) #define reach #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define ll long long #define pb push_back #define eb emplace_back #define all(x) (x).begin(), (x).end() #define f first #define s second #define g0(x) get<0>(x) #define g1(x) get<1>(x) #define g2(x) get<2>(x) #define g3(x) get<3>(x) typedef pair <ll, ll> pi; typedef tuple<ll,ll,ll> ti3; typedef tuple<ll,ll,ll,ll> ti4; ll rand(ll a, ll b) { return a + rng() % (b-a+1); } const int MOD = 1e9 + 7; const int inf = (int)1e9 + 500; const long long oo = (ll)1e18 + 500; template <typename T> void chmax(T& a, const T b) { a=max(a,b); } template <typename T> void chmin(T& a, const T b) { a=min(a,b); } const int MAXN = -1; int n; set<multiset<int> > B[40]; vector<int> factors; vector<int> primeList; bool isPrime(long long N) { if (N <= 1) return 0; if (N <= 3) return N > 0; // Only 2 is prime. else if ((N % 2 == 0) || (N % 3 == 0)) return false; int i = 5; while ((i * i) <= N){ if ((N % i == 0) || ((N % (i + 2)) == 0)) return false; i += 6; } return true; } vector<int> primeFactorize(int X) { vector<int> result; for (auto it = primeList.begin(); it != primeList.end(); ++it) { if (*it > X/(*it)) break; while (X % *it == 0) { X /= *it; result.push_back(*it); } } if (X != 1) result.push_back(X); //The last factor above sqrt(X) return result; } int32_t main() { IAMSPEED cin >> n; if(n==1)return cout << "1\n0",0; FOR(i,2,sqrt(n) + 1)if(isPrime(i))primeList.pb(i); factors = primeFactorize(n); multiset<int> initial; initial.insert(factors[0]); B[0].insert(initial); FOR(i,1,factors.size()-1) { for(auto ss:B[i-1]) { //this set for(auto x: ss) { int y = factors[i] * x; multiset<int> ns =ss ; ns.erase(ns.find(x)); ns.insert(y); B[i].insert(ns); } multiset<int> ns = ss; ns.insert(factors[i]); B[i].insert(ns); } } set<int> os; for(auto grp:B[factors.size()-1]) { int out = 0; for(auto x:grp)out+=x-1; os.insert(out); } cout << os.size() << '\n'; for(auto i:os)cout<<i<<' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...