oj.uz

Submission #493236

# Submission time Handle Problem Language Result Execution time Memory
493236 2021-12-10T13:26:49 Z blue Toys (CEOI18_toy) C++17
79 / 100
 5000 ms 76664 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
using namespace std;

#define sz(x) (int(x.size()))
using vi = vector<int>;
using ll = long long;

// map< int, vector<int> > res;

vi sf;

long long n;

vector<int> res[40'000]; //i*i <= n
vector<int> res2[40'000]; //i*i >= n, access n/i.

vi solved(1+40'000, 0);
vi solved2(1+40'000, 0);

vector<int> factors[40'000];
vector<int> factors2[40'000];

vector<int>& get_res(long long u)
{
    if(u*u <= n) return res[u];
    else return res2[n/u];
}

vector<int>& get_factors(long long u)
{
    if(u*u <= n) return factors[u];
    else return factors2[n/u];
}

int& get_solved(long long u)
{
    if(u*u <= n) return solved[u];
    else return solved2[n/u];
}



void solve(long long i)
{
    // cerr << "solve " << i << '\n';
    // if(solved[i]) return;
    // solved[i] = 1;

    if(get_solved(i)) return;
    else get_solved(i) = 1;
    // cerr << "\n\n\n";
    // cerr << "solve:  " << i << '\n';
    // cerr << "cond = " << int(res.find(i) != res.end()) << '\n';
    // if(res.find(i) != res.end()) return;
    // cerr << "entered\n";

    vi ans(1, i-1);
    // for(int j = 2; j < i && j*j <= i; j++)

    // cerr << "#\n";
    // for(int y: sf) cerr << "y = " << y << '\n';
    // cerr << "#2\n";

    for(ll j: get_factors(i))
    {
        // cerr << "j = " << j << '\n';
        if(j >= i || j*j > i) break;
            // cerr << i << " -> " << j << '\n';
        long long u = j;
        long long v = i/j;
        solve(u);
        solve(v);
        for(int a: get_res(u))
        {
            for(int b: get_res(v))
            {
                // if(b > a) break;
                ans.push_back(a+b);
            }
        }

    }
    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());

    // for(int a: ans) cerr << "a = " << a << '\n';


    get_res(i) = ans;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;

    if(n == 1)
    {
        cout << "1\n 0\n";
        return 0;
    }



    for(int i = 2; i < n; i++)
    {
        // cerr << i << " " << n%i << ' ' << int(n%i == 0) << '\n';
        if(i*i > n) break;
        if(n % i == 0)
        {
            sf.push_back(i);
            sf.push_back(n/i);
        }
    }

    // for(int i = 2; i <= n; i++)
    // {
    //     // cerr << i << " " << n%i << ' ' << int(n%i == 0) << '\n';
    //     if(n % i == 0)
    //         sf.push_back(i);
    // }

    sf.push_back(n);

    sort(sf.begin(), sf.end());
    sf.erase(unique(sf.begin(), sf.end()), sf.end());

    // for(int q: sf) cerr << q << ' ';
    // cerr << '\n';

    for(int a: sf)
        for(int b: sf)
            if(a < b && b%a==0)
                get_factors(b).push_back(a);


    solve(n);
    vi ans = res2[1];

    // cerr << "sf init = " ;
    // for(int q: sf) cerr << q << " ";
    // cerr << "\n";

    cout << sz(ans) << '\n';
    for(int r: ans) cout << r << ' ';
    cout << '\n';
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 3 ms 4300 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4300 KB Output is correct
9 Correct 2 ms 4300 KB Output is correct
10 Correct 2 ms 4300 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 2 ms 4300 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 2 ms 4300 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4300 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 2 ms 4300 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 2 ms 4300 KB Output is correct
24 Correct 2 ms 4300 KB Output is correct
25 Correct 2 ms 4300 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 3 ms 4300 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4300 KB Output is correct
9 Correct 2 ms 4300 KB Output is correct
10 Correct 2 ms 4300 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 2 ms 4300 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 2 ms 4300 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4300 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 2 ms 4300 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 2 ms 4300 KB Output is correct
24 Correct 2 ms 4300 KB Output is correct
25 Correct 2 ms 4300 KB Output is correct
26 Correct 2 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 3 ms 4300 KB Output is correct
29 Correct 3 ms 4300 KB Output is correct
30 Correct 2 ms 4300 KB Output is correct
31 Correct 3 ms 4428 KB Output is correct
32 Correct 2 ms 4428 KB Output is correct
33 Correct 3 ms 4416 KB Output is correct
34 Correct 2 ms 4300 KB Output is correct
35 Correct 2 ms 4300 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 3 ms 4428 KB Output is correct
38 Correct 2 ms 4300 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 2 ms 4428 KB Output is correct
41 Correct 2 ms 4300 KB Output is correct
42 Correct 2 ms 4300 KB Output is correct
43 Correct 3 ms 4300 KB Output is correct
44 Correct 2 ms 4300 KB Output is correct
45 Correct 2 ms 4300 KB Output is correct
46 Correct 2 ms 4300 KB Output is correct
47 Correct 3 ms 4300 KB Output is correct
48 Correct 2 ms 4300 KB Output is correct
49 Correct 2 ms 4300 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 3 ms 4300 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4300 KB Output is correct
9 Correct 2 ms 4300 KB Output is correct
10 Correct 2 ms 4300 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 2 ms 4300 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 2 ms 4300 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4300 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 2 ms 4300 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 2 ms 4300 KB Output is correct
24 Correct 2 ms 4300 KB Output is correct
25 Correct 2 ms 4300 KB Output is correct
26 Correct 2 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 3 ms 4300 KB Output is correct
29 Correct 3 ms 4300 KB Output is correct
30 Correct 2 ms 4300 KB Output is correct
31 Correct 3 ms 4428 KB Output is correct
32 Correct 2 ms 4428 KB Output is correct
33 Correct 3 ms 4416 KB Output is correct
34 Correct 2 ms 4300 KB Output is correct
35 Correct 2 ms 4300 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 3 ms 4428 KB Output is correct
38 Correct 2 ms 4300 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 2 ms 4428 KB Output is correct
41 Correct 2 ms 4300 KB Output is correct
42 Correct 2 ms 4300 KB Output is correct
43 Correct 3 ms 4300 KB Output is correct
44 Correct 2 ms 4300 KB Output is correct
45 Correct 2 ms 4300 KB Output is correct
46 Correct 2 ms 4300 KB Output is correct
47 Correct 3 ms 4300 KB Output is correct
48 Correct 2 ms 4300 KB Output is correct
49 Correct 2 ms 4300 KB Output is correct
50 Correct 5 ms 4556 KB Output is correct
51 Correct 4 ms 4556 KB Output is correct
52 Correct 5 ms 4556 KB Output is correct
53 Correct 5 ms 4556 KB Output is correct
54 Correct 3 ms 4428 KB Output is correct
55 Correct 8 ms 4684 KB Output is correct
56 Correct 8 ms 4616 KB Output is correct
57 Correct 7 ms 4556 KB Output is correct
58 Correct 2 ms 4300 KB Output is correct
59 Correct 3 ms 4300 KB Output is correct
60 Correct 3 ms 4428 KB Output is correct
61 Correct 5 ms 4556 KB Output is correct
62 Correct 3 ms 4428 KB Output is correct
63 Correct 3 ms 4332 KB Output is correct
64 Correct 2 ms 4300 KB Output is correct
65 Correct 4 ms 4556 KB Output is correct
66 Correct 2 ms 4300 KB Output is correct
67 Correct 2 ms 4300 KB Output is correct
68 Correct 2 ms 4324 KB Output is correct
69 Correct 2 ms 4300 KB Output is correct
70 Correct 3 ms 4428 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 3 ms 4300 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4300 KB Output is correct
9 Correct 2 ms 4300 KB Output is correct
10 Correct 2 ms 4300 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 2 ms 4300 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 2 ms 4300 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4300 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 2 ms 4300 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 2 ms 4300 KB Output is correct
24 Correct 2 ms 4300 KB Output is correct
25 Correct 2 ms 4300 KB Output is correct
26 Correct 2 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 3 ms 4300 KB Output is correct
29 Correct 3 ms 4300 KB Output is correct
30 Correct 2 ms 4300 KB Output is correct
31 Correct 3 ms 4428 KB Output is correct
32 Correct 2 ms 4428 KB Output is correct
33 Correct 3 ms 4416 KB Output is correct
34 Correct 2 ms 4300 KB Output is correct
35 Correct 2 ms 4300 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 3 ms 4428 KB Output is correct
38 Correct 2 ms 4300 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 2 ms 4428 KB Output is correct
41 Correct 2 ms 4300 KB Output is correct
42 Correct 2 ms 4300 KB Output is correct
43 Correct 3 ms 4300 KB Output is correct
44 Correct 2 ms 4300 KB Output is correct
45 Correct 2 ms 4300 KB Output is correct
46 Correct 2 ms 4300 KB Output is correct
47 Correct 3 ms 4300 KB Output is correct
48 Correct 2 ms 4300 KB Output is correct
49 Correct 2 ms 4300 KB Output is correct
50 Correct 5 ms 4556 KB Output is correct
51 Correct 4 ms 4556 KB Output is correct
52 Correct 5 ms 4556 KB Output is correct
53 Correct 5 ms 4556 KB Output is correct
54 Correct 3 ms 4428 KB Output is correct
55 Correct 8 ms 4684 KB Output is correct
56 Correct 8 ms 4616 KB Output is correct
57 Correct 7 ms 4556 KB Output is correct
58 Correct 2 ms 4300 KB Output is correct
59 Correct 3 ms 4300 KB Output is correct
60 Correct 3 ms 4428 KB Output is correct
61 Correct 5 ms 4556 KB Output is correct
62 Correct 3 ms 4428 KB Output is correct
63 Correct 3 ms 4332 KB Output is correct
64 Correct 2 ms 4300 KB Output is correct
65 Correct 4 ms 4556 KB Output is correct
66 Correct 2 ms 4300 KB Output is correct
67 Correct 2 ms 4300 KB Output is correct
68 Correct 2 ms 4324 KB Output is correct
69 Correct 2 ms 4300 KB Output is correct
70 Correct 3 ms 4428 KB Output is correct
71 Correct 827 ms 36508 KB Output is correct
72 Correct 476 ms 30120 KB Output is correct
73 Correct 929 ms 37304 KB Output is correct
74 Correct 351 ms 19892 KB Output is correct
75 Correct 515 ms 30036 KB Output is correct
76 Correct 1806 ms 67072 KB Output is correct
77 Correct 2037 ms 67712 KB Output is correct
78 Correct 1460 ms 60620 KB Output is correct
79 Correct 1504 ms 61504 KB Output is correct
80 Correct 2 ms 4300 KB Output is correct
81 Correct 3 ms 4300 KB Output is correct
82 Correct 12 ms 4892 KB Output is correct
83 Correct 192 ms 10740 KB Output is correct
84 Correct 166 ms 11740 KB Output is correct
85 Correct 32 ms 5916 KB Output is correct
86 Correct 3 ms 4300 KB Output is correct
87 Correct 193 ms 10988 KB Output is correct
88 Correct 3 ms 4300 KB Output is correct
89 Correct 2 ms 4300 KB Output is correct
90 Correct 2 ms 4300 KB Output is correct
91 Correct 24 ms 5216 KB Output is correct
92 Correct 110 ms 10972 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 3 ms 4300 KB Output is correct
5 Correct 2 ms 4300 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4300 KB Output is correct
9 Correct 2 ms 4300 KB Output is correct
10 Correct 2 ms 4300 KB Output is correct
11 Correct 2 ms 4300 KB Output is correct
12 Correct 2 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 2 ms 4300 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 2 ms 4300 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4300 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 2 ms 4300 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 2 ms 4300 KB Output is correct
24 Correct 2 ms 4300 KB Output is correct
25 Correct 2 ms 4300 KB Output is correct
26 Correct 2 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 3 ms 4300 KB Output is correct
29 Correct 3 ms 4300 KB Output is correct
30 Correct 2 ms 4300 KB Output is correct
31 Correct 3 ms 4428 KB Output is correct
32 Correct 2 ms 4428 KB Output is correct
33 Correct 3 ms 4416 KB Output is correct
34 Correct 2 ms 4300 KB Output is correct
35 Correct 2 ms 4300 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 3 ms 4428 KB Output is correct
38 Correct 2 ms 4300 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 2 ms 4428 KB Output is correct
41 Correct 2 ms 4300 KB Output is correct
42 Correct 2 ms 4300 KB Output is correct
43 Correct 3 ms 4300 KB Output is correct
44 Correct 2 ms 4300 KB Output is correct
45 Correct 2 ms 4300 KB Output is correct
46 Correct 2 ms 4300 KB Output is correct
47 Correct 3 ms 4300 KB Output is correct
48 Correct 2 ms 4300 KB Output is correct
49 Correct 2 ms 4300 KB Output is correct
50 Correct 5 ms 4556 KB Output is correct
51 Correct 4 ms 4556 KB Output is correct
52 Correct 5 ms 4556 KB Output is correct
53 Correct 5 ms 4556 KB Output is correct
54 Correct 3 ms 4428 KB Output is correct
55 Correct 8 ms 4684 KB Output is correct
56 Correct 8 ms 4616 KB Output is correct
57 Correct 7 ms 4556 KB Output is correct
58 Correct 2 ms 4300 KB Output is correct
59 Correct 3 ms 4300 KB Output is correct
60 Correct 3 ms 4428 KB Output is correct
61 Correct 5 ms 4556 KB Output is correct
62 Correct 3 ms 4428 KB Output is correct
63 Correct 3 ms 4332 KB Output is correct
64 Correct 2 ms 4300 KB Output is correct
65 Correct 4 ms 4556 KB Output is correct
66 Correct 2 ms 4300 KB Output is correct
67 Correct 2 ms 4300 KB Output is correct
68 Correct 2 ms 4324 KB Output is correct
69 Correct 2 ms 4300 KB Output is correct
70 Correct 3 ms 4428 KB Output is correct
71 Correct 827 ms 36508 KB Output is correct
72 Correct 476 ms 30120 KB Output is correct
73 Correct 929 ms 37304 KB Output is correct
74 Correct 351 ms 19892 KB Output is correct
75 Correct 515 ms 30036 KB Output is correct
76 Correct 1806 ms 67072 KB Output is correct
77 Correct 2037 ms 67712 KB Output is correct
78 Correct 1460 ms 60620 KB Output is correct
79 Correct 1504 ms 61504 KB Output is correct
80 Correct 2 ms 4300 KB Output is correct
81 Correct 3 ms 4300 KB Output is correct
82 Correct 12 ms 4892 KB Output is correct
83 Correct 192 ms 10740 KB Output is correct
84 Correct 166 ms 11740 KB Output is correct
85 Correct 32 ms 5916 KB Output is correct
86 Correct 3 ms 4300 KB Output is correct
87 Correct 193 ms 10988 KB Output is correct
88 Correct 3 ms 4300 KB Output is correct
89 Correct 2 ms 4300 KB Output is correct
90 Correct 2 ms 4300 KB Output is correct
91 Correct 24 ms 5216 KB Output is correct
92 Correct 110 ms 10972 KB Output is correct
93 Execution timed out 5060 ms 76664 KB Time limit exceeded
94 Halted 0 ms 0 KB -