oj.uz

Submission #464955

# Submission time Handle Problem Language Result Execution time Memory
464955 2021-08-14T15:03:58 Z idk321 Toys (CEOI18_toy) C++17
79 / 100
 5000 ms 88160 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

unordered_map<int, unordered_set<int>> possibleAt;

const int N = 10000000;

int divFac[N];


void getDivisors(vector<int>& divisors, vector<array<int, 2>>& freqs, int ind, int cur) {
    if (ind == freqs.size()) {
        divisors.push_back(cur);
        return;
    }
    for (int i = 0; i <= (freqs[ind][1]); i++) {
        getDivisors(divisors, freqs, ind + 1, cur);
        cur *= freqs[ind][0];
    }
}

void solveFor(int num) {
    if (possibleAt.find(num) != possibleAt.end()) return;
    possibleAt[num].insert(num - 1);
    if (num < N) {
        map<int, int> mapp;
        int cnum = num;
        while (cnum != 1) {
            mapp[divFac[cnum]]++;
            cnum /= divFac[cnum];
        }
        vector<int> divisors;
        vector<array<int, 2>> freqs;
        for (auto it = mapp.begin(); it != mapp.end(); it++) freqs.push_back({it->first, it->second});
        getDivisors(divisors, freqs, 0, 1);
        for (int divisor : divisors) {
            if (divisor != 1 && divisor <= num / 2) {
                solveFor(divisor);
                solveFor(num / divisor);
                for (auto it = possibleAt[divisor].begin(); it != possibleAt[divisor].end(); it++) {
                    for (auto it2 = possibleAt[num / divisor].begin(); it2 != possibleAt[num / divisor].end(); it2++) {
                        possibleAt[num].insert(*it + *it2);
                    }
                }
            }
        }
    } else {
        int cur = 2;
        while (cur * cur <= num) {
            if (num % cur == 0) {
                solveFor(cur);
                solveFor(num / cur);
                for (auto it = possibleAt[cur].begin(); it != possibleAt[cur].end(); it++) {
                    for (auto it2 = possibleAt[num / cur].begin(); it2 != possibleAt[num / cur].end(); it2++) {
                        possibleAt[num].insert(*it + *it2);
                    }
                }

            }
            cur++;
        }

    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);


    for (int i = 2; i < N; i++) {
        if (!divFac[i]) {
            divFac[i] = i;
            for (int j = i; j < N; j += i) {
                divFac[j] = i;
            }
        }
    }

    int n;
    cin  >> n;
    solveFor(n);
    cout << possibleAt[n].size() << "\n";
    vector<int> res(possibleAt[n].begin(), possibleAt[n].end());
    sort(res.begin(), res.end());
    for (int i : res) cout << i << " ";
    cout << "\n";
}

Compilation message

toy.cpp: In function 'void getDivisors(std::vector<int>&, std::vector<std::array<int, 2> >&, int, int)':
toy.cpp:14:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     if (ind == freqs.size()) {
      |         ~~~~^~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 39372 KB Output is correct
2 Correct 206 ms 39380 KB Output is correct
3 Correct 214 ms 39436 KB Output is correct
4 Correct 207 ms 39428 KB Output is correct
5 Correct 221 ms 39372 KB Output is correct
6 Correct 214 ms 39424 KB Output is correct
7 Correct 208 ms 39492 KB Output is correct
8 Correct 205 ms 39324 KB Output is correct
9 Correct 214 ms 39496 KB Output is correct
10 Correct 218 ms 39372 KB Output is correct
11 Correct 212 ms 39372 KB Output is correct
12 Correct 210 ms 39408 KB Output is correct
13 Correct 218 ms 39496 KB Output is correct
14 Correct 212 ms 39428 KB Output is correct
15 Correct 219 ms 39384 KB Output is correct
16 Correct 211 ms 39424 KB Output is correct
17 Correct 228 ms 39432 KB Output is correct
18 Correct 229 ms 39372 KB Output is correct
19 Correct 221 ms 39372 KB Output is correct
20 Correct 216 ms 39424 KB Output is correct
21 Correct 210 ms 39428 KB Output is correct
22 Correct 210 ms 39428 KB Output is correct
23 Correct 207 ms 39372 KB Output is correct
24 Correct 213 ms 39372 KB Output is correct
25 Correct 210 ms 39424 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 39372 KB Output is correct
2 Correct 206 ms 39380 KB Output is correct
3 Correct 214 ms 39436 KB Output is correct
4 Correct 207 ms 39428 KB Output is correct
5 Correct 221 ms 39372 KB Output is correct
6 Correct 214 ms 39424 KB Output is correct
7 Correct 208 ms 39492 KB Output is correct
8 Correct 205 ms 39324 KB Output is correct
9 Correct 214 ms 39496 KB Output is correct
10 Correct 218 ms 39372 KB Output is correct
11 Correct 212 ms 39372 KB Output is correct
12 Correct 210 ms 39408 KB Output is correct
13 Correct 218 ms 39496 KB Output is correct
14 Correct 212 ms 39428 KB Output is correct
15 Correct 219 ms 39384 KB Output is correct
16 Correct 211 ms 39424 KB Output is correct
17 Correct 228 ms 39432 KB Output is correct
18 Correct 229 ms 39372 KB Output is correct
19 Correct 221 ms 39372 KB Output is correct
20 Correct 216 ms 39424 KB Output is correct
21 Correct 210 ms 39428 KB Output is correct
22 Correct 210 ms 39428 KB Output is correct
23 Correct 207 ms 39372 KB Output is correct
24 Correct 213 ms 39372 KB Output is correct
25 Correct 210 ms 39424 KB Output is correct
26 Correct 214 ms 39428 KB Output is correct
27 Correct 216 ms 39492 KB Output is correct
28 Correct 215 ms 39428 KB Output is correct
29 Correct 208 ms 39424 KB Output is correct
30 Correct 211 ms 39432 KB Output is correct
31 Correct 207 ms 39424 KB Output is correct
32 Correct 216 ms 39428 KB Output is correct
33 Correct 210 ms 39492 KB Output is correct
34 Correct 222 ms 39428 KB Output is correct
35 Correct 218 ms 39424 KB Output is correct
36 Correct 210 ms 39548 KB Output is correct
37 Correct 215 ms 39428 KB Output is correct
38 Correct 208 ms 39396 KB Output is correct
39 Correct 225 ms 39436 KB Output is correct
40 Correct 216 ms 39428 KB Output is correct
41 Correct 218 ms 39412 KB Output is correct
42 Correct 217 ms 39364 KB Output is correct
43 Correct 223 ms 39440 KB Output is correct
44 Correct 206 ms 39372 KB Output is correct
45 Correct 205 ms 39440 KB Output is correct
46 Correct 222 ms 39440 KB Output is correct
47 Correct 220 ms 39372 KB Output is correct
48 Correct 203 ms 39320 KB Output is correct
49 Correct 214 ms 39544 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 39372 KB Output is correct
2 Correct 206 ms 39380 KB Output is correct
3 Correct 214 ms 39436 KB Output is correct
4 Correct 207 ms 39428 KB Output is correct
5 Correct 221 ms 39372 KB Output is correct
6 Correct 214 ms 39424 KB Output is correct
7 Correct 208 ms 39492 KB Output is correct
8 Correct 205 ms 39324 KB Output is correct
9 Correct 214 ms 39496 KB Output is correct
10 Correct 218 ms 39372 KB Output is correct
11 Correct 212 ms 39372 KB Output is correct
12 Correct 210 ms 39408 KB Output is correct
13 Correct 218 ms 39496 KB Output is correct
14 Correct 212 ms 39428 KB Output is correct
15 Correct 219 ms 39384 KB Output is correct
16 Correct 211 ms 39424 KB Output is correct
17 Correct 228 ms 39432 KB Output is correct
18 Correct 229 ms 39372 KB Output is correct
19 Correct 221 ms 39372 KB Output is correct
20 Correct 216 ms 39424 KB Output is correct
21 Correct 210 ms 39428 KB Output is correct
22 Correct 210 ms 39428 KB Output is correct
23 Correct 207 ms 39372 KB Output is correct
24 Correct 213 ms 39372 KB Output is correct
25 Correct 210 ms 39424 KB Output is correct
26 Correct 214 ms 39428 KB Output is correct
27 Correct 216 ms 39492 KB Output is correct
28 Correct 215 ms 39428 KB Output is correct
29 Correct 208 ms 39424 KB Output is correct
30 Correct 211 ms 39432 KB Output is correct
31 Correct 207 ms 39424 KB Output is correct
32 Correct 216 ms 39428 KB Output is correct
33 Correct 210 ms 39492 KB Output is correct
34 Correct 222 ms 39428 KB Output is correct
35 Correct 218 ms 39424 KB Output is correct
36 Correct 210 ms 39548 KB Output is correct
37 Correct 215 ms 39428 KB Output is correct
38 Correct 208 ms 39396 KB Output is correct
39 Correct 225 ms 39436 KB Output is correct
40 Correct 216 ms 39428 KB Output is correct
41 Correct 218 ms 39412 KB Output is correct
42 Correct 217 ms 39364 KB Output is correct
43 Correct 223 ms 39440 KB Output is correct
44 Correct 206 ms 39372 KB Output is correct
45 Correct 205 ms 39440 KB Output is correct
46 Correct 222 ms 39440 KB Output is correct
47 Correct 220 ms 39372 KB Output is correct
48 Correct 203 ms 39320 KB Output is correct
49 Correct 214 ms 39544 KB Output is correct
50 Correct 216 ms 39684 KB Output is correct
51 Correct 215 ms 39680 KB Output is correct
52 Correct 219 ms 39684 KB Output is correct
53 Correct 218 ms 39560 KB Output is correct
54 Correct 216 ms 39552 KB Output is correct
55 Correct 220 ms 39684 KB Output is correct
56 Correct 228 ms 39692 KB Output is correct
57 Correct 212 ms 39688 KB Output is correct
58 Correct 208 ms 39392 KB Output is correct
59 Correct 210 ms 39440 KB Output is correct
60 Correct 219 ms 39428 KB Output is correct
61 Correct 210 ms 39620 KB Output is correct
62 Correct 217 ms 39440 KB Output is correct
63 Correct 206 ms 39440 KB Output is correct
64 Correct 215 ms 39428 KB Output is correct
65 Correct 213 ms 39592 KB Output is correct
66 Correct 206 ms 39428 KB Output is correct
67 Correct 209 ms 39372 KB Output is correct
68 Correct 202 ms 39444 KB Output is correct
69 Correct 214 ms 39440 KB Output is correct
70 Correct 207 ms 39504 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 39372 KB Output is correct
2 Correct 206 ms 39380 KB Output is correct
3 Correct 214 ms 39436 KB Output is correct
4 Correct 207 ms 39428 KB Output is correct
5 Correct 221 ms 39372 KB Output is correct
6 Correct 214 ms 39424 KB Output is correct
7 Correct 208 ms 39492 KB Output is correct
8 Correct 205 ms 39324 KB Output is correct
9 Correct 214 ms 39496 KB Output is correct
10 Correct 218 ms 39372 KB Output is correct
11 Correct 212 ms 39372 KB Output is correct
12 Correct 210 ms 39408 KB Output is correct
13 Correct 218 ms 39496 KB Output is correct
14 Correct 212 ms 39428 KB Output is correct
15 Correct 219 ms 39384 KB Output is correct
16 Correct 211 ms 39424 KB Output is correct
17 Correct 228 ms 39432 KB Output is correct
18 Correct 229 ms 39372 KB Output is correct
19 Correct 221 ms 39372 KB Output is correct
20 Correct 216 ms 39424 KB Output is correct
21 Correct 210 ms 39428 KB Output is correct
22 Correct 210 ms 39428 KB Output is correct
23 Correct 207 ms 39372 KB Output is correct
24 Correct 213 ms 39372 KB Output is correct
25 Correct 210 ms 39424 KB Output is correct
26 Correct 214 ms 39428 KB Output is correct
27 Correct 216 ms 39492 KB Output is correct
28 Correct 215 ms 39428 KB Output is correct
29 Correct 208 ms 39424 KB Output is correct
30 Correct 211 ms 39432 KB Output is correct
31 Correct 207 ms 39424 KB Output is correct
32 Correct 216 ms 39428 KB Output is correct
33 Correct 210 ms 39492 KB Output is correct
34 Correct 222 ms 39428 KB Output is correct
35 Correct 218 ms 39424 KB Output is correct
36 Correct 210 ms 39548 KB Output is correct
37 Correct 215 ms 39428 KB Output is correct
38 Correct 208 ms 39396 KB Output is correct
39 Correct 225 ms 39436 KB Output is correct
40 Correct 216 ms 39428 KB Output is correct
41 Correct 218 ms 39412 KB Output is correct
42 Correct 217 ms 39364 KB Output is correct
43 Correct 223 ms 39440 KB Output is correct
44 Correct 206 ms 39372 KB Output is correct
45 Correct 205 ms 39440 KB Output is correct
46 Correct 222 ms 39440 KB Output is correct
47 Correct 220 ms 39372 KB Output is correct
48 Correct 203 ms 39320 KB Output is correct
49 Correct 214 ms 39544 KB Output is correct
50 Correct 216 ms 39684 KB Output is correct
51 Correct 215 ms 39680 KB Output is correct
52 Correct 219 ms 39684 KB Output is correct
53 Correct 218 ms 39560 KB Output is correct
54 Correct 216 ms 39552 KB Output is correct
55 Correct 220 ms 39684 KB Output is correct
56 Correct 228 ms 39692 KB Output is correct
57 Correct 212 ms 39688 KB Output is correct
58 Correct 208 ms 39392 KB Output is correct
59 Correct 210 ms 39440 KB Output is correct
60 Correct 219 ms 39428 KB Output is correct
61 Correct 210 ms 39620 KB Output is correct
62 Correct 217 ms 39440 KB Output is correct
63 Correct 206 ms 39440 KB Output is correct
64 Correct 215 ms 39428 KB Output is correct
65 Correct 213 ms 39592 KB Output is correct
66 Correct 206 ms 39428 KB Output is correct
67 Correct 209 ms 39372 KB Output is correct
68 Correct 202 ms 39444 KB Output is correct
69 Correct 214 ms 39440 KB Output is correct
70 Correct 207 ms 39504 KB Output is correct
71 Correct 1564 ms 56204 KB Output is correct
72 Correct 980 ms 51980 KB Output is correct
73 Correct 1833 ms 54284 KB Output is correct
74 Correct 849 ms 49464 KB Output is correct
75 Correct 1081 ms 50008 KB Output is correct
76 Correct 3152 ms 62104 KB Output is correct
77 Correct 3481 ms 59336 KB Output is correct
78 Correct 2494 ms 58104 KB Output is correct
79 Correct 2679 ms 57656 KB Output is correct
80 Correct 211 ms 39436 KB Output is correct
81 Correct 206 ms 39428 KB Output is correct
82 Correct 218 ms 39748 KB Output is correct
83 Correct 516 ms 42528 KB Output is correct
84 Correct 495 ms 43140 KB Output is correct
85 Correct 246 ms 40556 KB Output is correct
86 Correct 207 ms 39424 KB Output is correct
87 Correct 480 ms 43700 KB Output is correct
88 Correct 204 ms 39372 KB Output is correct
89 Correct 210 ms 39396 KB Output is correct
90 Correct 211 ms 39492 KB Output is correct
91 Correct 234 ms 41108 KB Output is correct
92 Correct 380 ms 45124 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 39372 KB Output is correct
2 Correct 206 ms 39380 KB Output is correct
3 Correct 214 ms 39436 KB Output is correct
4 Correct 207 ms 39428 KB Output is correct
5 Correct 221 ms 39372 KB Output is correct
6 Correct 214 ms 39424 KB Output is correct
7 Correct 208 ms 39492 KB Output is correct
8 Correct 205 ms 39324 KB Output is correct
9 Correct 214 ms 39496 KB Output is correct
10 Correct 218 ms 39372 KB Output is correct
11 Correct 212 ms 39372 KB Output is correct
12 Correct 210 ms 39408 KB Output is correct
13 Correct 218 ms 39496 KB Output is correct
14 Correct 212 ms 39428 KB Output is correct
15 Correct 219 ms 39384 KB Output is correct
16 Correct 211 ms 39424 KB Output is correct
17 Correct 228 ms 39432 KB Output is correct
18 Correct 229 ms 39372 KB Output is correct
19 Correct 221 ms 39372 KB Output is correct
20 Correct 216 ms 39424 KB Output is correct
21 Correct 210 ms 39428 KB Output is correct
22 Correct 210 ms 39428 KB Output is correct
23 Correct 207 ms 39372 KB Output is correct
24 Correct 213 ms 39372 KB Output is correct
25 Correct 210 ms 39424 KB Output is correct
26 Correct 214 ms 39428 KB Output is correct
27 Correct 216 ms 39492 KB Output is correct
28 Correct 215 ms 39428 KB Output is correct
29 Correct 208 ms 39424 KB Output is correct
30 Correct 211 ms 39432 KB Output is correct
31 Correct 207 ms 39424 KB Output is correct
32 Correct 216 ms 39428 KB Output is correct
33 Correct 210 ms 39492 KB Output is correct
34 Correct 222 ms 39428 KB Output is correct
35 Correct 218 ms 39424 KB Output is correct
36 Correct 210 ms 39548 KB Output is correct
37 Correct 215 ms 39428 KB Output is correct
38 Correct 208 ms 39396 KB Output is correct
39 Correct 225 ms 39436 KB Output is correct
40 Correct 216 ms 39428 KB Output is correct
41 Correct 218 ms 39412 KB Output is correct
42 Correct 217 ms 39364 KB Output is correct
43 Correct 223 ms 39440 KB Output is correct
44 Correct 206 ms 39372 KB Output is correct
45 Correct 205 ms 39440 KB Output is correct
46 Correct 222 ms 39440 KB Output is correct
47 Correct 220 ms 39372 KB Output is correct
48 Correct 203 ms 39320 KB Output is correct
49 Correct 214 ms 39544 KB Output is correct
50 Correct 216 ms 39684 KB Output is correct
51 Correct 215 ms 39680 KB Output is correct
52 Correct 219 ms 39684 KB Output is correct
53 Correct 218 ms 39560 KB Output is correct
54 Correct 216 ms 39552 KB Output is correct
55 Correct 220 ms 39684 KB Output is correct
56 Correct 228 ms 39692 KB Output is correct
57 Correct 212 ms 39688 KB Output is correct
58 Correct 208 ms 39392 KB Output is correct
59 Correct 210 ms 39440 KB Output is correct
60 Correct 219 ms 39428 KB Output is correct
61 Correct 210 ms 39620 KB Output is correct
62 Correct 217 ms 39440 KB Output is correct
63 Correct 206 ms 39440 KB Output is correct
64 Correct 215 ms 39428 KB Output is correct
65 Correct 213 ms 39592 KB Output is correct
66 Correct 206 ms 39428 KB Output is correct
67 Correct 209 ms 39372 KB Output is correct
68 Correct 202 ms 39444 KB Output is correct
69 Correct 214 ms 39440 KB Output is correct
70 Correct 207 ms 39504 KB Output is correct
71 Correct 1564 ms 56204 KB Output is correct
72 Correct 980 ms 51980 KB Output is correct
73 Correct 1833 ms 54284 KB Output is correct
74 Correct 849 ms 49464 KB Output is correct
75 Correct 1081 ms 50008 KB Output is correct
76 Correct 3152 ms 62104 KB Output is correct
77 Correct 3481 ms 59336 KB Output is correct
78 Correct 2494 ms 58104 KB Output is correct
79 Correct 2679 ms 57656 KB Output is correct
80 Correct 211 ms 39436 KB Output is correct
81 Correct 206 ms 39428 KB Output is correct
82 Correct 218 ms 39748 KB Output is correct
83 Correct 516 ms 42528 KB Output is correct
84 Correct 495 ms 43140 KB Output is correct
85 Correct 246 ms 40556 KB Output is correct
86 Correct 207 ms 39424 KB Output is correct
87 Correct 480 ms 43700 KB Output is correct
88 Correct 204 ms 39372 KB Output is correct
89 Correct 210 ms 39396 KB Output is correct
90 Correct 211 ms 39492 KB Output is correct
91 Correct 234 ms 41108 KB Output is correct
92 Correct 380 ms 45124 KB Output is correct
93 Execution timed out 5049 ms 88160 KB Time limit exceeded
94 Halted 0 ms 0 KB -