Submission #942987

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
942987	2024-03-11T07:33:17 Z	vjudge1	Toys (CEOI18_toy)	C++17	39 / 100	111 ms	1208 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;
	}
	if(mp.count({x, sum}))return;
	mp[{x, sum}] = 1;
		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});
		}
		
		 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

toy.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main(){
      | ^~~~
toy.cpp: In function 'void fp(std::string)':
toy.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | 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	600 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	600 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	0 ms	604 KB	Output is correct
11	Correct	0 ms	600 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	604 KB	Output is correct
24	Correct	1 ms	604 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	604 KB	Output is correct
2	Correct	1 ms	600 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	600 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	0 ms	604 KB	Output is correct
11	Correct	0 ms	600 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	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	19 ms	604 KB	Output is correct
27	Correct	17 ms	772 KB	Output is correct
28	Correct	9 ms	604 KB	Output is correct
29	Correct	7 ms	604 KB	Output is correct
30	Correct	5 ms	604 KB	Output is correct
31	Correct	23 ms	604 KB	Output is correct
32	Correct	19 ms	604 KB	Output is correct
33	Correct	18 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	4 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	5 ms	856 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	13 ms	772 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	1 ms	600 KB	Output is correct
45	Correct	5 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	12 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	600 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	600 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	0 ms	604 KB	Output is correct
11	Correct	0 ms	600 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	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	19 ms	604 KB	Output is correct
27	Correct	17 ms	772 KB	Output is correct
28	Correct	9 ms	604 KB	Output is correct
29	Correct	7 ms	604 KB	Output is correct
30	Correct	5 ms	604 KB	Output is correct
31	Correct	23 ms	604 KB	Output is correct
32	Correct	19 ms	604 KB	Output is correct
33	Correct	18 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	4 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	5 ms	856 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	13 ms	772 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	1 ms	600 KB	Output is correct
45	Correct	5 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	12 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct
50	Correct	83 ms	928 KB	Output is correct
51	Correct	71 ms	848 KB	Output is correct
52	Correct	74 ms	980 KB	Output is correct
53	Correct	66 ms	848 KB	Output is correct
54	Correct	38 ms	852 KB	Output is correct
55	Correct	111 ms	1068 KB	Output is correct
56	Correct	101 ms	1108 KB	Output is correct
57	Correct	94 ms	1208 KB	Output is correct
58	Incorrect	0 ms	604 KB	Output isn't correct
59	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	600 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	600 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	0 ms	604 KB	Output is correct
11	Correct	0 ms	600 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	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	19 ms	604 KB	Output is correct
27	Correct	17 ms	772 KB	Output is correct
28	Correct	9 ms	604 KB	Output is correct
29	Correct	7 ms	604 KB	Output is correct
30	Correct	5 ms	604 KB	Output is correct
31	Correct	23 ms	604 KB	Output is correct
32	Correct	19 ms	604 KB	Output is correct
33	Correct	18 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	4 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	5 ms	856 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	13 ms	772 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	1 ms	600 KB	Output is correct
45	Correct	5 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	12 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct
50	Correct	83 ms	928 KB	Output is correct
51	Correct	71 ms	848 KB	Output is correct
52	Correct	74 ms	980 KB	Output is correct
53	Correct	66 ms	848 KB	Output is correct
54	Correct	38 ms	852 KB	Output is correct
55	Correct	111 ms	1068 KB	Output is correct
56	Correct	101 ms	1108 KB	Output is correct
57	Correct	94 ms	1208 KB	Output is correct
58	Incorrect	0 ms	604 KB	Output isn't correct
59	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	1 ms	600 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	600 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	0 ms	604 KB	Output is correct
11	Correct	0 ms	600 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	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	19 ms	604 KB	Output is correct
27	Correct	17 ms	772 KB	Output is correct
28	Correct	9 ms	604 KB	Output is correct
29	Correct	7 ms	604 KB	Output is correct
30	Correct	5 ms	604 KB	Output is correct
31	Correct	23 ms	604 KB	Output is correct
32	Correct	19 ms	604 KB	Output is correct
33	Correct	18 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	4 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	5 ms	856 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	13 ms	772 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	1 ms	600 KB	Output is correct
45	Correct	5 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	12 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct
50	Correct	83 ms	928 KB	Output is correct
51	Correct	71 ms	848 KB	Output is correct
52	Correct	74 ms	980 KB	Output is correct
53	Correct	66 ms	848 KB	Output is correct
54	Correct	38 ms	852 KB	Output is correct
55	Correct	111 ms	1068 KB	Output is correct
56	Correct	101 ms	1108 KB	Output is correct
57	Correct	94 ms	1208 KB	Output is correct
58	Incorrect	0 ms	604 KB	Output isn't correct
59	Halted	0 ms	0 KB	-

Submission #942987

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 20.0

Subtask #4 0 / 20.0

Subtask #5 0 / 21.0

Subtask #1
19.0 / 19.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 21.0