답안 #986013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986013	2024-05-19T16:00:50 Z	raphaelp	Toys (CEOI18_toy)	C++14	79 / 100	5000 ms	109416 KB

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    if (N == 1)
    {
        cout << 1 << '\n'
             << 0;
        return 0;
    }
    vector<int> div;
    unordered_map<int, int> M;
    for (int i = 2; i <= sqrt(N); i++)
    {
        if (N % i == 0)
        {
            div.push_back(i);
            if (i != N / i)
                div.push_back(N / i);
        }
    }
    div.push_back(N);
    sort(div.begin(), div.end());
    for (int i = 0; i < div.size(); i++)
        M[div[i]] = i;
    vector<vector<int>> pos(div.size());
    for (int i = 0; i < div.size(); i++)
        pos[i].push_back(div[i] - 1);
    for (int i = 0; i < div.size(); i++)
    {
        for (int j = 0; div[j] <= sqrt(div[i]); j++)
        {
            if (div[i] % div[j] != 0)
                continue;
            if ((N % (div[i] / div[j])) != 0)
                continue;
            int x = M[div[i] / div[j]];
            for (int k = 0; k < pos[j].size(); k++)
            {
                for (int l = 0; l < pos[x].size(); l++)
                {
                    pos[i].push_back(pos[j][k] + pos[x][l]);
                }
            }
        }
        sort(pos[i].begin(), pos[i].end());
        vector<int> temp = {pos[i][0]};
        for (int j = 1; j < pos[i].size(); j++)
            if (pos[i][j] != pos[i][j - 1])
                temp.push_back(pos[i][j]);
        swap(temp, pos[i]);
    }
    cout << pos[pos.size() - 1].size() << '\n';
    for (int i = 0; i < pos[pos.size() - 1].size(); i++)
    {
        cout << pos[pos.size() - 1][i] << ' ';
    }
}

Compilation message

toy.cpp: In function 'int main()':
toy.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for (int i = 0; i < div.size(); i++)
      |                     ~~^~~~~~~~~~~~
toy.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 0; i < div.size(); i++)
      |                     ~~^~~~~~~~~~~~
toy.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < div.size(); i++)
      |                     ~~^~~~~~~~~~~~
toy.cpp:40:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for (int k = 0; k < pos[j].size(); k++)
      |                             ~~^~~~~~~~~~~~~~~
toy.cpp:42:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |                 for (int l = 0; l < pos[x].size(); l++)
      |                                 ~~^~~~~~~~~~~~~~~
toy.cpp:50:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         for (int j = 1; j < pos[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~
toy.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < pos[pos.size() - 1].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	436 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	3 ms	800 KB	Output is correct
51	Correct	3 ms	348 KB	Output is correct
52	Correct	3 ms	604 KB	Output is correct
53	Correct	3 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	5 ms	604 KB	Output is correct
56	Correct	5 ms	604 KB	Output is correct
57	Correct	4 ms	604 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	3 ms	504 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	2 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	779 ms	33108 KB	Output is correct
72	Correct	447 ms	27024 KB	Output is correct
73	Correct	865 ms	33932 KB	Output is correct
74	Correct	328 ms	16336 KB	Output is correct
75	Correct	464 ms	26832 KB	Output is correct
76	Correct	1730 ms	63924 KB	Output is correct
77	Correct	1938 ms	65376 KB	Output is correct
78	Correct	1315 ms	57612 KB	Output is correct
79	Correct	1375 ms	60096 KB	Output is correct
80	Correct	0 ms	600 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	9 ms	904 KB	Output is correct
83	Correct	173 ms	8552 KB	Output is correct
84	Correct	151 ms	7256 KB	Output is correct
85	Correct	26 ms	2080 KB	Output is correct
86	Correct	0 ms	348 KB	Output is correct
87	Correct	172 ms	8752 KB	Output is correct
88	Correct	1 ms	348 KB	Output is correct
89	Correct	0 ms	348 KB	Output is correct
90	Correct	0 ms	348 KB	Output is correct
91	Correct	20 ms	1328 KB	Output is correct
92	Correct	98 ms	6936 KB	Output is correct

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	436 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	3 ms	800 KB	Output is correct
51	Correct	3 ms	348 KB	Output is correct
52	Correct	3 ms	604 KB	Output is correct
53	Correct	3 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	5 ms	604 KB	Output is correct
56	Correct	5 ms	604 KB	Output is correct
57	Correct	4 ms	604 KB	Output is correct
58	Correct	1 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	348 KB	Output is correct
61	Correct	3 ms	504 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	2 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	1 ms	344 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	779 ms	33108 KB	Output is correct
72	Correct	447 ms	27024 KB	Output is correct
73	Correct	865 ms	33932 KB	Output is correct
74	Correct	328 ms	16336 KB	Output is correct
75	Correct	464 ms	26832 KB	Output is correct
76	Correct	1730 ms	63924 KB	Output is correct
77	Correct	1938 ms	65376 KB	Output is correct
78	Correct	1315 ms	57612 KB	Output is correct
79	Correct	1375 ms	60096 KB	Output is correct
80	Correct	0 ms	600 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	9 ms	904 KB	Output is correct
83	Correct	173 ms	8552 KB	Output is correct
84	Correct	151 ms	7256 KB	Output is correct
85	Correct	26 ms	2080 KB	Output is correct
86	Correct	0 ms	348 KB	Output is correct
87	Correct	172 ms	8752 KB	Output is correct
88	Correct	1 ms	348 KB	Output is correct
89	Correct	0 ms	348 KB	Output is correct
90	Correct	0 ms	348 KB	Output is correct
91	Correct	20 ms	1328 KB	Output is correct
92	Correct	98 ms	6936 KB	Output is correct
93	Execution timed out	5032 ms	109416 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-

답안 #986013

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