| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 943001 | 2024-03-11T07:36:56 Z | vjudge1 | Toys (CEOI18_toy) | C++17 | 5000 ms | 756 KB |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 31625, mxc = 105, inf = 1e18, MX = 1e5 + 10;
set <int> ans;
vector <int> pr;
int p[N];
map <pair <int,int>, int> mp;
void calc(int x, int sum = 0){
if(x == 1){
ans.insert(sum);
return;
}
vector <pair <int,int> > fact;
vector <int> div = {1};
int A = x;
for(auto p : pr){
int cnt = 0;
while(x % p == 0){
x /= p;
cnt++;
}
if(cnt != 0)
fact.pb({p, cnt});
}
fact.pb({x, 1});
for (auto [p,k] : fact)
for (int i = 1, sz = div.size(); i <= k; i++)
for (int i = 1; i <= sz; i++)
div.push_back(div[div.size()-sz]*p);
for(auto xx : div){
if(xx != 1)
calc(A / xx, sum + xx - 1);
}
}
main(){
iostream::sync_with_stdio (false);
cin.tie(nullptr);
cout.tie(nullptr);
for(int i = 2; i < N - 1; i++){
if(p[i])continue;
pr.pb(i);
for(int j = i * i; j < N - 1; j += i){
p[j] = 1;
}
}
int n;
cin >> n;
calc(n);
cout << ans.size() << endl;
for(auto x : ans)
cout << x <<" ";
}
/*
* Before implementing the problem:
Do I understand the problem correctly?
Which places are tricky? What do I need to remember to implement them correctly?
Which place is the heaviest by implementation? Can I do it simpler?
Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
----------------------------------
If not AC:
Did you remember to do everything to handle the tricky places you thought about before?
Is the solution correct?
Do I understand the problem correctly?
----------------------------------
If you have a test on which the solution gives wrong answer:
Is the solution doing what it was supposed to do?
Is the problem in the code or in the idea?
*/
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| 5 | Correct | 1 ms | 604 KB | Output is correct |
| 6 | Correct | 1 ms | 604 KB | Output is correct |
| 7 | Correct | 1 ms | 600 KB | Output is correct |
| 8 | Correct | 1 ms | 604 KB | Output is correct |
| 9 | Correct | 1 ms | 604 KB | Output is correct |
| 10 | Correct | 1 ms | 604 KB | Output is correct |
| 11 | Correct | 1 ms | 604 KB | Output is correct |
| 12 | Correct | 1 ms | 604 KB | Output is correct |
| 13 | Correct | 1 ms | 604 KB | Output is correct |
| 14 | Correct | 1 ms | 604 KB | Output is correct |
| 15 | Correct | 1 ms | 604 KB | Output is correct |
| 16 | Correct | 1 ms | 600 KB | Output is correct |
| 17 | Correct | 1 ms | 600 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 600 KB | Output is correct |
| 20 | Correct | 1 ms | 604 KB | Output is correct |
| 21 | Correct | 1 ms | 604 KB | Output is correct |
| 22 | Correct | 2 ms | 756 KB | Output is correct |
| 23 | Correct | 1 ms | 604 KB | Output is correct |
| 24 | Correct | 5 ms | 604 KB | Output is correct |
| 25 | Correct | 2 ms | 600 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| 5 | Correct | 1 ms | 604 KB | Output is correct |
| 6 | Correct | 1 ms | 604 KB | Output is correct |
| 7 | Correct | 1 ms | 600 KB | Output is correct |
| 8 | Correct | 1 ms | 604 KB | Output is correct |
| 9 | Correct | 1 ms | 604 KB | Output is correct |
| 10 | Correct | 1 ms | 604 KB | Output is correct |
| 11 | Correct | 1 ms | 604 KB | Output is correct |
| 12 | Correct | 1 ms | 604 KB | Output is correct |
| 13 | Correct | 1 ms | 604 KB | Output is correct |
| 14 | Correct | 1 ms | 604 KB | Output is correct |
| 15 | Correct | 1 ms | 604 KB | Output is correct |
| 16 | Correct | 1 ms | 600 KB | Output is correct |
| 17 | Correct | 1 ms | 600 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 600 KB | Output is correct |
| 20 | Correct | 1 ms | 604 KB | Output is correct |
| 21 | Correct | 1 ms | 604 KB | Output is correct |
| 22 | Correct | 2 ms | 756 KB | Output is correct |
| 23 | Correct | 1 ms | 604 KB | Output is correct |
| 24 | Correct | 5 ms | 604 KB | Output is correct |
| 25 | Correct | 2 ms | 600 KB | Output is correct |
| 26 | Execution timed out | 5046 ms | 604 KB | Time limit exceeded |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| 5 | Correct | 1 ms | 604 KB | Output is correct |
| 6 | Correct | 1 ms | 604 KB | Output is correct |
| 7 | Correct | 1 ms | 600 KB | Output is correct |
| 8 | Correct | 1 ms | 604 KB | Output is correct |
| 9 | Correct | 1 ms | 604 KB | Output is correct |
| 10 | Correct | 1 ms | 604 KB | Output is correct |
| 11 | Correct | 1 ms | 604 KB | Output is correct |
| 12 | Correct | 1 ms | 604 KB | Output is correct |
| 13 | Correct | 1 ms | 604 KB | Output is correct |
| 14 | Correct | 1 ms | 604 KB | Output is correct |
| 15 | Correct | 1 ms | 604 KB | Output is correct |
| 16 | Correct | 1 ms | 600 KB | Output is correct |
| 17 | Correct | 1 ms | 600 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 600 KB | Output is correct |
| 20 | Correct | 1 ms | 604 KB | Output is correct |
| 21 | Correct | 1 ms | 604 KB | Output is correct |
| 22 | Correct | 2 ms | 756 KB | Output is correct |
| 23 | Correct | 1 ms | 604 KB | Output is correct |
| 24 | Correct | 5 ms | 604 KB | Output is correct |
| 25 | Correct | 2 ms | 600 KB | Output is correct |
| 26 | Execution timed out | 5046 ms | 604 KB | Time limit exceeded |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| 5 | Correct | 1 ms | 604 KB | Output is correct |
| 6 | Correct | 1 ms | 604 KB | Output is correct |
| 7 | Correct | 1 ms | 600 KB | Output is correct |
| 8 | Correct | 1 ms | 604 KB | Output is correct |
| 9 | Correct | 1 ms | 604 KB | Output is correct |
| 10 | Correct | 1 ms | 604 KB | Output is correct |
| 11 | Correct | 1 ms | 604 KB | Output is correct |
| 12 | Correct | 1 ms | 604 KB | Output is correct |
| 13 | Correct | 1 ms | 604 KB | Output is correct |
| 14 | Correct | 1 ms | 604 KB | Output is correct |
| 15 | Correct | 1 ms | 604 KB | Output is correct |
| 16 | Correct | 1 ms | 600 KB | Output is correct |
| 17 | Correct | 1 ms | 600 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 600 KB | Output is correct |
| 20 | Correct | 1 ms | 604 KB | Output is correct |
| 21 | Correct | 1 ms | 604 KB | Output is correct |
| 22 | Correct | 2 ms | 756 KB | Output is correct |
| 23 | Correct | 1 ms | 604 KB | Output is correct |
| 24 | Correct | 5 ms | 604 KB | Output is correct |
| 25 | Correct | 2 ms | 600 KB | Output is correct |
| 26 | Execution timed out | 5046 ms | 604 KB | Time limit exceeded |
| 27 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 604 KB | Output is correct |
| 2 | Correct | 1 ms | 604 KB | Output is correct |
| 3 | Correct | 1 ms | 604 KB | Output is correct |
| 4 | Correct | 1 ms | 604 KB | Output is correct |
| 5 | Correct | 1 ms | 604 KB | Output is correct |
| 6 | Correct | 1 ms | 604 KB | Output is correct |
| 7 | Correct | 1 ms | 600 KB | Output is correct |
| 8 | Correct | 1 ms | 604 KB | Output is correct |
| 9 | Correct | 1 ms | 604 KB | Output is correct |
| 10 | Correct | 1 ms | 604 KB | Output is correct |
| 11 | Correct | 1 ms | 604 KB | Output is correct |
| 12 | Correct | 1 ms | 604 KB | Output is correct |
| 13 | Correct | 1 ms | 604 KB | Output is correct |
| 14 | Correct | 1 ms | 604 KB | Output is correct |
| 15 | Correct | 1 ms | 604 KB | Output is correct |
| 16 | Correct | 1 ms | 600 KB | Output is correct |
| 17 | Correct | 1 ms | 600 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 600 KB | Output is correct |
| 20 | Correct | 1 ms | 604 KB | Output is correct |
| 21 | Correct | 1 ms | 604 KB | Output is correct |
| 22 | Correct | 2 ms | 756 KB | Output is correct |
| 23 | Correct | 1 ms | 604 KB | Output is correct |
| 24 | Correct | 5 ms | 604 KB | Output is correct |
| 25 | Correct | 2 ms | 600 KB | Output is correct |
| 26 | Execution timed out | 5046 ms | 604 KB | Time limit exceeded |
| 27 | Halted | 0 ms | 0 KB | - |