Submission #943035

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
943035	2024-03-11T07:47:44 Z	vjudge1	Toys (CEOI18_toy)	C++17	79 / 100	5000 ms	57388 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 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 = 31624, mxc = 105, inf = 1e18, MX = 1e5 + 10;

set <int> ans;
vector <int> pr;
int p[N];

map <pair <int,int>, int> mp;
unordered_map <int, vector <int> > d;

void calc(int x, int sum = 0){
	if(x == 1){
		ans.insert(sum);
		return;
	}
	if(mp.count({x, sum}))return;
	mp[{x, sum}] = 1;
	vector <pair <int,int> > fact;
	vector <int> div = {1};
	int A = x;
	if(!d.count(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);
		d[A] = div;
	}else
		div = d[x];
	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

toy.cpp:19:39: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int N = 31624, mxc = 105, inf = 1e18, MX = 1e5 + 10;
      |                                       ^~~~
toy.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main(){
      | ^~~~
toy.cpp: In function 'void fp(std::string)':
toy.cpp:14:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:14:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 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	604 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	0 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	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 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	604 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	0 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	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	3 ms	604 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	3 ms	600 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 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	604 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	0 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	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	3 ms	604 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	3 ms	600 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	8 ms	876 KB	Output is correct
51	Correct	7 ms	860 KB	Output is correct
52	Correct	7 ms	860 KB	Output is correct
53	Correct	6 ms	924 KB	Output is correct
54	Correct	4 ms	600 KB	Output is correct
55	Correct	11 ms	1116 KB	Output is correct
56	Correct	10 ms	860 KB	Output is correct
57	Correct	9 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	600 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	5 ms	600 KB	Output is correct
62	Correct	3 ms	604 KB	Output is correct
63	Correct	2 ms	604 KB	Output is correct
64	Correct	1 ms	600 KB	Output is correct
65	Correct	5 ms	860 KB	Output is correct
66	Correct	1 ms	612 KB	Output is correct
67	Correct	1 ms	604 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	3 ms	604 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 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	604 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	0 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	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	3 ms	604 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	3 ms	600 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	8 ms	876 KB	Output is correct
51	Correct	7 ms	860 KB	Output is correct
52	Correct	7 ms	860 KB	Output is correct
53	Correct	6 ms	924 KB	Output is correct
54	Correct	4 ms	600 KB	Output is correct
55	Correct	11 ms	1116 KB	Output is correct
56	Correct	10 ms	860 KB	Output is correct
57	Correct	9 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	600 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	5 ms	600 KB	Output is correct
62	Correct	3 ms	604 KB	Output is correct
63	Correct	2 ms	604 KB	Output is correct
64	Correct	1 ms	600 KB	Output is correct
65	Correct	5 ms	860 KB	Output is correct
66	Correct	1 ms	612 KB	Output is correct
67	Correct	1 ms	604 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	3 ms	604 KB	Output is correct
71	Correct	1388 ms	24960 KB	Output is correct
72	Correct	836 ms	18912 KB	Output is correct
73	Correct	1261 ms	22148 KB	Output is correct
74	Correct	609 ms	14932 KB	Output is correct
75	Correct	747 ms	15936 KB	Output is correct
76	Correct	2396 ms	33400 KB	Output is correct
77	Correct	2181 ms	29332 KB	Output is correct
78	Correct	1808 ms	27632 KB	Output is correct
79	Correct	1795 ms	26644 KB	Output is correct
80	Correct	1 ms	604 KB	Output is correct
81	Correct	1 ms	600 KB	Output is correct
82	Correct	6 ms	860 KB	Output is correct
83	Correct	137 ms	4720 KB	Output is correct
84	Correct	187 ms	5840 KB	Output is correct
85	Correct	31 ms	2128 KB	Output is correct
86	Correct	2 ms	600 KB	Output is correct
87	Correct	194 ms	6740 KB	Output is correct
88	Correct	1 ms	600 KB	Output is correct
89	Correct	0 ms	604 KB	Output is correct
90	Correct	2 ms	604 KB	Output is correct
91	Correct	45 ms	2820 KB	Output is correct
92	Correct	219 ms	8784 KB	Output is correct

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 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	604 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	0 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	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	3 ms	604 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	3 ms	600 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	8 ms	876 KB	Output is correct
51	Correct	7 ms	860 KB	Output is correct
52	Correct	7 ms	860 KB	Output is correct
53	Correct	6 ms	924 KB	Output is correct
54	Correct	4 ms	600 KB	Output is correct
55	Correct	11 ms	1116 KB	Output is correct
56	Correct	10 ms	860 KB	Output is correct
57	Correct	9 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	600 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	5 ms	600 KB	Output is correct
62	Correct	3 ms	604 KB	Output is correct
63	Correct	2 ms	604 KB	Output is correct
64	Correct	1 ms	600 KB	Output is correct
65	Correct	5 ms	860 KB	Output is correct
66	Correct	1 ms	612 KB	Output is correct
67	Correct	1 ms	604 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	3 ms	604 KB	Output is correct
71	Correct	1388 ms	24960 KB	Output is correct
72	Correct	836 ms	18912 KB	Output is correct
73	Correct	1261 ms	22148 KB	Output is correct
74	Correct	609 ms	14932 KB	Output is correct
75	Correct	747 ms	15936 KB	Output is correct
76	Correct	2396 ms	33400 KB	Output is correct
77	Correct	2181 ms	29332 KB	Output is correct
78	Correct	1808 ms	27632 KB	Output is correct
79	Correct	1795 ms	26644 KB	Output is correct
80	Correct	1 ms	604 KB	Output is correct
81	Correct	1 ms	600 KB	Output is correct
82	Correct	6 ms	860 KB	Output is correct
83	Correct	137 ms	4720 KB	Output is correct
84	Correct	187 ms	5840 KB	Output is correct
85	Correct	31 ms	2128 KB	Output is correct
86	Correct	2 ms	600 KB	Output is correct
87	Correct	194 ms	6740 KB	Output is correct
88	Correct	1 ms	600 KB	Output is correct
89	Correct	0 ms	604 KB	Output is correct
90	Correct	2 ms	604 KB	Output is correct
91	Correct	45 ms	2820 KB	Output is correct
92	Correct	219 ms	8784 KB	Output is correct
93	Execution timed out	5008 ms	57388 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-

Submission #943035

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 21.0

Subtask #1
19.0 / 19.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 21.0