답안 #490979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
490979	2021-11-30T02:41:52 Z	NhatMinh0208	Toys (CEOI18_toy)	C++14	100 / 100	2154 ms	87084 KB

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
 
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}
 
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
 
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> sus,susr;
int n,m,i,j,k,t,t1,u,v,a,b;
set<int> dp[1501];
int main()
{
	fio;
	cin>>n;
	for (i=1;i*i<=n;i++) {
		if (i*i==n) sus.push_back(i);
		else if (n%i==0) {
			sus.push_back(i);
			susr.push_back(n/i);
		}
	}
	reverse(susr.begin(), susr.end());
	for (auto g: susr) {
		sus.push_back(g);
	}
	dp[0].insert(0);
	for (i=1;i<sus.size();i++) {
		for (j=0;j<i;j++) if (sus[i]%sus[j]==0) {
			a=sus[i]/sus[j];
			for (auto g : dp[j]) dp[i].insert(g+a-1);
		}
	}
	susr.clear();
	for (auto g : dp[sus.size()-1]) susr.push_back(g);
	sort(susr.begin(), susr.end());
	cout<<susr.size()<<endl;
	for (auto g: susr) cout<<g<<' ';
}

Compilation message

toy.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
toy.cpp: In function 'int main()':
toy.cpp:119:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |  for (i=1;i<sus.size();i++) {
      |           ~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	0 ms	332 KB	Output is correct
39	Correct	0 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	0 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	0 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	0 ms	332 KB	Output is correct
39	Correct	0 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	0 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	0 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	3 ms	588 KB	Output is correct
53	Correct	2 ms	588 KB	Output is correct
54	Correct	1 ms	460 KB	Output is correct
55	Correct	5 ms	716 KB	Output is correct
56	Correct	4 ms	716 KB	Output is correct
57	Correct	3 ms	716 KB	Output is correct
58	Correct	0 ms	332 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	2 ms	460 KB	Output is correct
62	Correct	1 ms	460 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	2 ms	460 KB	Output is correct
66	Correct	0 ms	332 KB	Output is correct
67	Correct	0 ms	332 KB	Output is correct
68	Correct	1 ms	332 KB	Output is correct
69	Correct	1 ms	332 KB	Output is correct
70	Correct	1 ms	460 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	0 ms	332 KB	Output is correct
39	Correct	0 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	0 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	0 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	3 ms	588 KB	Output is correct
53	Correct	2 ms	588 KB	Output is correct
54	Correct	1 ms	460 KB	Output is correct
55	Correct	5 ms	716 KB	Output is correct
56	Correct	4 ms	716 KB	Output is correct
57	Correct	3 ms	716 KB	Output is correct
58	Correct	0 ms	332 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	2 ms	460 KB	Output is correct
62	Correct	1 ms	460 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	2 ms	460 KB	Output is correct
66	Correct	0 ms	332 KB	Output is correct
67	Correct	0 ms	332 KB	Output is correct
68	Correct	1 ms	332 KB	Output is correct
69	Correct	1 ms	332 KB	Output is correct
70	Correct	1 ms	460 KB	Output is correct
71	Correct	306 ms	18632 KB	Output is correct
72	Correct	210 ms	14164 KB	Output is correct
73	Correct	356 ms	16656 KB	Output is correct
74	Correct	158 ms	11188 KB	Output is correct
75	Correct	186 ms	11896 KB	Output is correct
76	Correct	505 ms	25032 KB	Output is correct
77	Correct	456 ms	22056 KB	Output is correct
78	Correct	386 ms	20788 KB	Output is correct
79	Correct	389 ms	20264 KB	Output is correct
80	Correct	1 ms	332 KB	Output is correct
81	Correct	0 ms	332 KB	Output is correct
82	Correct	3 ms	716 KB	Output is correct
83	Correct	38 ms	3612 KB	Output is correct
84	Correct	59 ms	4388 KB	Output is correct
85	Correct	15 ms	1612 KB	Output is correct
86	Correct	1 ms	332 KB	Output is correct
87	Correct	59 ms	5076 KB	Output is correct
88	Correct	1 ms	332 KB	Output is correct
89	Correct	0 ms	332 KB	Output is correct
90	Correct	1 ms	332 KB	Output is correct
91	Correct	15 ms	2132 KB	Output is correct
92	Correct	83 ms	6576 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	0 ms	332 KB	Output is correct
39	Correct	0 ms	332 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	0 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	0 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	3 ms	588 KB	Output is correct
53	Correct	2 ms	588 KB	Output is correct
54	Correct	1 ms	460 KB	Output is correct
55	Correct	5 ms	716 KB	Output is correct
56	Correct	4 ms	716 KB	Output is correct
57	Correct	3 ms	716 KB	Output is correct
58	Correct	0 ms	332 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	2 ms	460 KB	Output is correct
62	Correct	1 ms	460 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	2 ms	460 KB	Output is correct
66	Correct	0 ms	332 KB	Output is correct
67	Correct	0 ms	332 KB	Output is correct
68	Correct	1 ms	332 KB	Output is correct
69	Correct	1 ms	332 KB	Output is correct
70	Correct	1 ms	460 KB	Output is correct
71	Correct	306 ms	18632 KB	Output is correct
72	Correct	210 ms	14164 KB	Output is correct
73	Correct	356 ms	16656 KB	Output is correct
74	Correct	158 ms	11188 KB	Output is correct
75	Correct	186 ms	11896 KB	Output is correct
76	Correct	505 ms	25032 KB	Output is correct
77	Correct	456 ms	22056 KB	Output is correct
78	Correct	386 ms	20788 KB	Output is correct
79	Correct	389 ms	20264 KB	Output is correct
80	Correct	1 ms	332 KB	Output is correct
81	Correct	0 ms	332 KB	Output is correct
82	Correct	3 ms	716 KB	Output is correct
83	Correct	38 ms	3612 KB	Output is correct
84	Correct	59 ms	4388 KB	Output is correct
85	Correct	15 ms	1612 KB	Output is correct
86	Correct	1 ms	332 KB	Output is correct
87	Correct	59 ms	5076 KB	Output is correct
88	Correct	1 ms	332 KB	Output is correct
89	Correct	0 ms	332 KB	Output is correct
90	Correct	1 ms	332 KB	Output is correct
91	Correct	15 ms	2132 KB	Output is correct
92	Correct	83 ms	6576 KB	Output is correct
93	Correct	1854 ms	77560 KB	Output is correct
94	Correct	1010 ms	52368 KB	Output is correct
95	Correct	1177 ms	54916 KB	Output is correct
96	Correct	1075 ms	48960 KB	Output is correct
97	Correct	940 ms	44768 KB	Output is correct
98	Correct	2114 ms	85684 KB	Output is correct
99	Correct	2154 ms	87084 KB	Output is correct
100	Correct	1990 ms	83740 KB	Output is correct
101	Correct	1875 ms	77468 KB	Output is correct
102	Correct	1650 ms	69800 KB	Output is correct
103	Correct	1315 ms	62608 KB	Output is correct
104	Correct	1 ms	332 KB	Output is correct
105	Correct	0 ms	332 KB	Output is correct
106	Correct	4 ms	972 KB	Output is correct
107	Correct	127 ms	9796 KB	Output is correct
108	Correct	341 ms	20552 KB	Output is correct
109	Correct	28 ms	3276 KB	Output is correct
110	Correct	1 ms	332 KB	Output is correct
111	Correct	168 ms	12404 KB	Output is correct
112	Correct	1 ms	332 KB	Output is correct
113	Correct	0 ms	332 KB	Output is correct
114	Correct	4 ms	968 KB	Output is correct
115	Correct	1 ms	332 KB	Output is correct
116	Correct	10 ms	1760 KB	Output is correct
117	Correct	336 ms	24816 KB	Output is correct

답안 #490979

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 21.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
21.0 / 21.0