Submission #943272

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
943272	2024-03-11T09:51:02 Z	vjudge1	Toys (CEOI18_toy)	C++17	79 / 100	5000 ms	80544 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;

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

unordered_map <int, unordered_map<int, bool> > mp;
unordered_map <int, vector <int> > d;

int sum;

void calc(int x){
	if(x == 1){
		ans.insert(sum);
		return;
	}
	if(mp[x][sum] == 1)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){
			if(p > sqrt(A))break;
			int cnt = 0;
			while(x % p == 0){
				x /= p;
					cnt++;
			}
			if(cnt != 0)
				fact.pb({p, cnt});
		}
		if(x != 1)
			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){
			sum = sum+xx-1;
			calc(A / xx);
			sum = 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:69:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   69 | 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	604 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 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	608 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	0 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	0 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	0 ms	604 KB	Output is correct
19	Correct	0 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	0 ms	604 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 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	608 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	0 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	0 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	0 ms	604 KB	Output is correct
19	Correct	0 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	0 ms	604 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	804 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	1 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	600 KB	Output is correct
40	Correct	1 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	0 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	0 ms	600 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	600 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 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	608 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	0 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	0 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	0 ms	604 KB	Output is correct
19	Correct	0 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	0 ms	604 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	804 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	1 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	600 KB	Output is correct
40	Correct	1 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	0 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	0 ms	600 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	600 KB	Output is correct
50	Correct	3 ms	860 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	2 ms	860 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	600 KB	Output is correct
55	Correct	3 ms	924 KB	Output is correct
56	Correct	3 ms	860 KB	Output is correct
57	Correct	3 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	604 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	2 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	1 ms	604 KB	Output is correct
64	Correct	0 ms	604 KB	Output is correct
65	Correct	2 ms	600 KB	Output is correct
66	Correct	1 ms	604 KB	Output is correct
67	Correct	1 ms	600 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	1 ms	600 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 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	608 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	0 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	0 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	0 ms	604 KB	Output is correct
19	Correct	0 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	0 ms	604 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	804 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	1 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	600 KB	Output is correct
40	Correct	1 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	0 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	0 ms	600 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	600 KB	Output is correct
50	Correct	3 ms	860 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	2 ms	860 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	600 KB	Output is correct
55	Correct	3 ms	924 KB	Output is correct
56	Correct	3 ms	860 KB	Output is correct
57	Correct	3 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	604 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	2 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	1 ms	604 KB	Output is correct
64	Correct	0 ms	604 KB	Output is correct
65	Correct	2 ms	600 KB	Output is correct
66	Correct	1 ms	604 KB	Output is correct
67	Correct	1 ms	600 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	1 ms	600 KB	Output is correct
71	Correct	329 ms	17492 KB	Output is correct
72	Correct	211 ms	13396 KB	Output is correct
73	Correct	365 ms	15696 KB	Output is correct
74	Correct	167 ms	10600 KB	Output is correct
75	Correct	182 ms	11360 KB	Output is correct
76	Correct	611 ms	23380 KB	Output is correct
77	Correct	594 ms	20664 KB	Output is correct
78	Correct	413 ms	19280 KB	Output is correct
79	Correct	460 ms	18952 KB	Output is correct
80	Correct	0 ms	604 KB	Output is correct
81	Correct	0 ms	604 KB	Output is correct
82	Correct	3 ms	860 KB	Output is correct
83	Correct	34 ms	3428 KB	Output is correct
84	Correct	44 ms	4200 KB	Output is correct
85	Correct	10 ms	1628 KB	Output is correct
86	Correct	1 ms	600 KB	Output is correct
87	Correct	57 ms	4952 KB	Output is correct
88	Correct	1 ms	600 KB	Output is correct
89	Correct	1 ms	600 KB	Output is correct
90	Correct	1 ms	604 KB	Output is correct
91	Correct	14 ms	2140 KB	Output is correct
92	Correct	64 ms	6480 KB	Output is correct

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	604 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 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	608 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	0 ms	604 KB	Output is correct
12	Correct	0 ms	604 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	0 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	0 ms	604 KB	Output is correct
19	Correct	0 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	0 ms	604 KB	Output is correct
24	Correct	0 ms	600 KB	Output is correct
25	Correct	1 ms	600 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	1 ms	804 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	1 ms	604 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	600 KB	Output is correct
40	Correct	1 ms	600 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	0 ms	604 KB	Output is correct
43	Correct	1 ms	600 KB	Output is correct
44	Correct	0 ms	600 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	600 KB	Output is correct
50	Correct	3 ms	860 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	2 ms	860 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	600 KB	Output is correct
55	Correct	3 ms	924 KB	Output is correct
56	Correct	3 ms	860 KB	Output is correct
57	Correct	3 ms	860 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	1 ms	604 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	2 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	1 ms	604 KB	Output is correct
64	Correct	0 ms	604 KB	Output is correct
65	Correct	2 ms	600 KB	Output is correct
66	Correct	1 ms	604 KB	Output is correct
67	Correct	1 ms	600 KB	Output is correct
68	Correct	1 ms	604 KB	Output is correct
69	Correct	1 ms	604 KB	Output is correct
70	Correct	1 ms	600 KB	Output is correct
71	Correct	329 ms	17492 KB	Output is correct
72	Correct	211 ms	13396 KB	Output is correct
73	Correct	365 ms	15696 KB	Output is correct
74	Correct	167 ms	10600 KB	Output is correct
75	Correct	182 ms	11360 KB	Output is correct
76	Correct	611 ms	23380 KB	Output is correct
77	Correct	594 ms	20664 KB	Output is correct
78	Correct	413 ms	19280 KB	Output is correct
79	Correct	460 ms	18952 KB	Output is correct
80	Correct	0 ms	604 KB	Output is correct
81	Correct	0 ms	604 KB	Output is correct
82	Correct	3 ms	860 KB	Output is correct
83	Correct	34 ms	3428 KB	Output is correct
84	Correct	44 ms	4200 KB	Output is correct
85	Correct	10 ms	1628 KB	Output is correct
86	Correct	1 ms	600 KB	Output is correct
87	Correct	57 ms	4952 KB	Output is correct
88	Correct	1 ms	600 KB	Output is correct
89	Correct	1 ms	600 KB	Output is correct
90	Correct	1 ms	604 KB	Output is correct
91	Correct	14 ms	2140 KB	Output is correct
92	Correct	64 ms	6480 KB	Output is correct
93	Correct	3829 ms	71648 KB	Output is correct
94	Correct	1876 ms	48340 KB	Output is correct
95	Correct	2106 ms	50636 KB	Output is correct
96	Correct	1847 ms	45516 KB	Output is correct
97	Correct	1691 ms	41604 KB	Output is correct
98	Correct	4629 ms	79344 KB	Output is correct
99	Execution timed out	5011 ms	80544 KB	Time limit exceeded
100	Halted	0 ms	0 KB	-

Submission #943272

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