| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 202502 |
2020-02-16T15:02:15 Z |
Nucleist |
Toys (CEOI18_toy) |
C++14 |
|
5 ms |
380 KB |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
template<class T>
bool operator()(T const &a, T const &b) const { return a > b; }
};
map<vector<dos>,ll>dp;
set<ll>ans;
void solve(vedos k)
{
dp[k]=1;
ll last=-1;
ll newi=0;
ll comp=0;
for(auto it:k)
{
newi+=((it.first-1)*it.second);
}
if(newi>0)ans.insert(newi);
if(k.size()<=1)return;
for (ll i = 0; i < k.size(); ++i)
{
for (ll j = i; j < k.size(); ++j)
{
vedos next;
if(i!=j || k[i].second>1)
{
next.pb({k[i].first*k[j].first,1});
for (ll yo = 0; yo < k.size(); ++yo)
{
if(yo!=i && yo!=j && k[yo].first!=k[i].first*k[j].first)next.pb(k[yo]);
else if(k[yo].first==k[i].first*k[j].first)next[0].second+=k[yo].second;
else if(yo==i && i==j && k[yo].second-2>0)next.pb({k[yo].first,k[yo].second-2});
else if((yo==i || yo==j) && i!=j && k[yo].second-1>0)next.pb({k[yo].first,k[yo].second-1});
}
sort(next.begin(),next.end());
if(dp.find(next)==dp.end())solve(next);
}
}
}
}
int main()
{
flash;
ll n;
cin>>n;
ll kol = n;
vedos primi;
int comp=0;
while (n % 2 == 0)
{
n = n/2;
comp++;
}
if(comp>0)primi.pb({2,comp});
comp=0;
for (ll i = 3; i <= sqrt(n); i = i + 2)
{
while (n % i == 0)
{
n = n/i;
comp++;
}
if(comp>0)primi.pb({i,comp});
comp=0;
}
if (n > 2)
primi.pb({n,1});
solve(primi);
ans.insert(kol-1);
cout<<ans.size()<<'\n';
for(auto it:ans)cout<<it<<" ";
return 0;
}
//code the AC sol !
// BS/queue/map
Compilation message
toy.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("O3")
toy.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("unroll-loops")
toy.cpp: In function 'void solve(std::vector<std::pair<long long int, long long int> >)':
toy.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (ll i = 0; i < k.size(); ++i)
~~^~~~~~~~~~
toy.cpp:40:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (ll j = i; j < k.size(); ++j)
~~^~~~~~~~~~
toy.cpp:46:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (ll yo = 0; yo < k.size(); ++yo)
~~~^~~~~~~~~~
toy.cpp:29:8: warning: unused variable 'last' [-Wunused-variable]
ll last=-1;
^~~~
toy.cpp:31:8: warning: unused variable 'comp' [-Wunused-variable]
ll comp=0;
^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
380 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
380 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
380 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
380 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
Output is correct |
| 2 |
Correct |
5 ms |
376 KB |
Output is correct |
| 3 |
Correct |
5 ms |
376 KB |
Output is correct |
| 4 |
Correct |
5 ms |
376 KB |
Output is correct |
| 5 |
Correct |
5 ms |
380 KB |
Output is correct |
| 6 |
Correct |
5 ms |
376 KB |
Output is correct |
| 7 |
Correct |
5 ms |
376 KB |
Output is correct |
| 8 |
Incorrect |
5 ms |
376 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
