oj.uz

Submission #493245

# Submission time Handle Problem Language Result Execution time Memory
493245 2021-12-10T13:39:33 Z blue Toys (CEOI18_toy) C++17
59 / 100
 351 ms 262148 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
#include <cassert>
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];

vi visited(1+40'000, 0);
vi visited2(1+40'000, 0);

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];
}

int& get_visited(long long u)
{
    if(u*u <= n) return visited[u];
    else return visited2[n/u];
}



void solve(long long i)
{
    if(get_solved(i)) return;
    else get_solved(i) = 1;

    vi ans(1, i-1);

    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))
        {
            if(get_visited(a) == 1) continue;
            get_visited(a) = 1;
            for(int b: get_res(v))
            {
                // if(b > a) break;
                ans.push_back(a+b);
            }
        }

        for(int a: get_res(u))
            get_visited(a) = 0;
    }
    if(i == n)
    {
        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;
    // assert(n <= 8'5000'0000);

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



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

    sf.push_back(n);

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

    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];

    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 3 ms 4684 KB Output is correct
2 Correct 2 ms 4684 KB Output is correct
3 Correct 3 ms 4684 KB Output is correct
4 Correct 2 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 3 ms 4684 KB Output is correct
8 Correct 3 ms 4724 KB Output is correct
9 Correct 3 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 3 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4684 KB Output is correct
14 Correct 2 ms 4684 KB Output is correct
15 Correct 2 ms 4684 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 3 ms 4684 KB Output is correct
20 Correct 3 ms 4684 KB Output is correct
21 Correct 2 ms 4684 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 2 ms 4684 KB Output is correct
24 Correct 3 ms 4684 KB Output is correct
25 Correct 2 ms 4684 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 2 ms 4684 KB Output is correct
3 Correct 3 ms 4684 KB Output is correct
4 Correct 2 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 3 ms 4684 KB Output is correct
8 Correct 3 ms 4724 KB Output is correct
9 Correct 3 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 3 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4684 KB Output is correct
14 Correct 2 ms 4684 KB Output is correct
15 Correct 2 ms 4684 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 3 ms 4684 KB Output is correct
20 Correct 3 ms 4684 KB Output is correct
21 Correct 2 ms 4684 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 2 ms 4684 KB Output is correct
24 Correct 3 ms 4684 KB Output is correct
25 Correct 2 ms 4684 KB Output is correct
26 Correct 4 ms 5196 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4684 KB Output is correct
29 Correct 3 ms 4812 KB Output is correct
30 Correct 2 ms 4716 KB Output is correct
31 Correct 11 ms 6656 KB Output is correct
32 Correct 7 ms 5576 KB Output is correct
33 Correct 6 ms 5416 KB Output is correct
34 Correct 3 ms 4684 KB Output is correct
35 Correct 3 ms 4684 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 6 ms 5548 KB Output is correct
38 Correct 3 ms 4728 KB Output is correct
39 Correct 3 ms 4684 KB Output is correct
40 Correct 5 ms 4976 KB Output is correct
41 Correct 3 ms 4684 KB Output is correct
42 Correct 3 ms 4684 KB Output is correct
43 Correct 3 ms 4684 KB Output is correct
44 Correct 3 ms 4684 KB Output is correct
45 Correct 3 ms 4684 KB Output is correct
46 Correct 4 ms 4684 KB Output is correct
47 Correct 6 ms 5196 KB Output is correct
48 Correct 3 ms 4684 KB Output is correct
49 Correct 3 ms 4684 KB Output is correct
50 Correct 28 ms 11292 KB Output is correct
51 Correct 21 ms 8508 KB Output is correct
52 Correct 55 ms 17068 KB Output is correct
53 Correct 46 ms 13404 KB Output is correct
54 Correct 6 ms 5516 KB Output is correct
55 Correct 248 ms 59460 KB Output is correct
56 Correct 351 ms 70912 KB Output is correct
57 Correct 87 ms 20004 KB Output is correct
58 Correct 3 ms 4684 KB Output is correct
59 Correct 4 ms 4684 KB Output is correct
60 Correct 33 ms 12332 KB Output is correct
61 Correct 289 ms 78188 KB Output is correct
62 Correct 8 ms 5756 KB Output is correct
63 Correct 6 ms 5708 KB Output is correct
64 Correct 2 ms 4684 KB Output is correct
65 Correct 30 ms 11380 KB Output is correct
66 Correct 3 ms 4684 KB Output is correct
67 Correct 3 ms 4684 KB Output is correct
68 Correct 3 ms 4684 KB Output is correct
69 Correct 4 ms 4684 KB Output is correct
70 Correct 4 ms 4940 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 2 ms 4684 KB Output is correct
3 Correct 3 ms 4684 KB Output is correct
4 Correct 2 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 3 ms 4684 KB Output is correct
8 Correct 3 ms 4724 KB Output is correct
9 Correct 3 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 3 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4684 KB Output is correct
14 Correct 2 ms 4684 KB Output is correct
15 Correct 2 ms 4684 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 3 ms 4684 KB Output is correct
20 Correct 3 ms 4684 KB Output is correct
21 Correct 2 ms 4684 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 2 ms 4684 KB Output is correct
24 Correct 3 ms 4684 KB Output is correct
25 Correct 2 ms 4684 KB Output is correct
26 Correct 4 ms 5196 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4684 KB Output is correct
29 Correct 3 ms 4812 KB Output is correct
30 Correct 2 ms 4716 KB Output is correct
31 Correct 11 ms 6656 KB Output is correct
32 Correct 7 ms 5576 KB Output is correct
33 Correct 6 ms 5416 KB Output is correct
34 Correct 3 ms 4684 KB Output is correct
35 Correct 3 ms 4684 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 6 ms 5548 KB Output is correct
38 Correct 3 ms 4728 KB Output is correct
39 Correct 3 ms 4684 KB Output is correct
40 Correct 5 ms 4976 KB Output is correct
41 Correct 3 ms 4684 KB Output is correct
42 Correct 3 ms 4684 KB Output is correct
43 Correct 3 ms 4684 KB Output is correct
44 Correct 3 ms 4684 KB Output is correct
45 Correct 3 ms 4684 KB Output is correct
46 Correct 4 ms 4684 KB Output is correct
47 Correct 6 ms 5196 KB Output is correct
48 Correct 3 ms 4684 KB Output is correct
49 Correct 3 ms 4684 KB Output is correct
50 Correct 28 ms 11292 KB Output is correct
51 Correct 21 ms 8508 KB Output is correct
52 Correct 55 ms 17068 KB Output is correct
53 Correct 46 ms 13404 KB Output is correct
54 Correct 6 ms 5516 KB Output is correct
55 Correct 248 ms 59460 KB Output is correct
56 Correct 351 ms 70912 KB Output is correct
57 Correct 87 ms 20004 KB Output is correct
58 Correct 3 ms 4684 KB Output is correct
59 Correct 4 ms 4684 KB Output is correct
60 Correct 33 ms 12332 KB Output is correct
61 Correct 289 ms 78188 KB Output is correct
62 Correct 8 ms 5756 KB Output is correct
63 Correct 6 ms 5708 KB Output is correct
64 Correct 2 ms 4684 KB Output is correct
65 Correct 30 ms 11380 KB Output is correct
66 Correct 3 ms 4684 KB Output is correct
67 Correct 3 ms 4684 KB Output is correct
68 Correct 3 ms 4684 KB Output is correct
69 Correct 4 ms 4684 KB Output is correct
70 Correct 4 ms 4940 KB Output is correct
71 Runtime error 315 ms 262148 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4684 KB Output is correct
2 Correct 2 ms 4684 KB Output is correct
3 Correct 3 ms 4684 KB Output is correct
4 Correct 2 ms 4684 KB Output is correct
5 Correct 3 ms 4684 KB Output is correct
6 Correct 3 ms 4684 KB Output is correct
7 Correct 3 ms 4684 KB Output is correct
8 Correct 3 ms 4724 KB Output is correct
9 Correct 3 ms 4684 KB Output is correct
10 Correct 3 ms 4684 KB Output is correct
11 Correct 3 ms 4684 KB Output is correct
12 Correct 3 ms 4684 KB Output is correct
13 Correct 2 ms 4684 KB Output is correct
14 Correct 2 ms 4684 KB Output is correct
15 Correct 2 ms 4684 KB Output is correct
16 Correct 3 ms 4684 KB Output is correct
17 Correct 3 ms 4684 KB Output is correct
18 Correct 3 ms 4684 KB Output is correct
19 Correct 3 ms 4684 KB Output is correct
20 Correct 3 ms 4684 KB Output is correct
21 Correct 2 ms 4684 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 2 ms 4684 KB Output is correct
24 Correct 3 ms 4684 KB Output is correct
25 Correct 2 ms 4684 KB Output is correct
26 Correct 4 ms 5196 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4684 KB Output is correct
29 Correct 3 ms 4812 KB Output is correct
30 Correct 2 ms 4716 KB Output is correct
31 Correct 11 ms 6656 KB Output is correct
32 Correct 7 ms 5576 KB Output is correct
33 Correct 6 ms 5416 KB Output is correct
34 Correct 3 ms 4684 KB Output is correct
35 Correct 3 ms 4684 KB Output is correct
36 Correct 4 ms 5196 KB Output is correct
37 Correct 6 ms 5548 KB Output is correct
38 Correct 3 ms 4728 KB Output is correct
39 Correct 3 ms 4684 KB Output is correct
40 Correct 5 ms 4976 KB Output is correct
41 Correct 3 ms 4684 KB Output is correct
42 Correct 3 ms 4684 KB Output is correct
43 Correct 3 ms 4684 KB Output is correct
44 Correct 3 ms 4684 KB Output is correct
45 Correct 3 ms 4684 KB Output is correct
46 Correct 4 ms 4684 KB Output is correct
47 Correct 6 ms 5196 KB Output is correct
48 Correct 3 ms 4684 KB Output is correct
49 Correct 3 ms 4684 KB Output is correct
50 Correct 28 ms 11292 KB Output is correct
51 Correct 21 ms 8508 KB Output is correct
52 Correct 55 ms 17068 KB Output is correct
53 Correct 46 ms 13404 KB Output is correct
54 Correct 6 ms 5516 KB Output is correct
55 Correct 248 ms 59460 KB Output is correct
56 Correct 351 ms 70912 KB Output is correct
57 Correct 87 ms 20004 KB Output is correct
58 Correct 3 ms 4684 KB Output is correct
59 Correct 4 ms 4684 KB Output is correct
60 Correct 33 ms 12332 KB Output is correct
61 Correct 289 ms 78188 KB Output is correct
62 Correct 8 ms 5756 KB Output is correct
63 Correct 6 ms 5708 KB Output is correct
64 Correct 2 ms 4684 KB Output is correct
65 Correct 30 ms 11380 KB Output is correct
66 Correct 3 ms 4684 KB Output is correct
67 Correct 3 ms 4684 KB Output is correct
68 Correct 3 ms 4684 KB Output is correct
69 Correct 4 ms 4684 KB Output is correct
70 Correct 4 ms 4940 KB Output is correct
71 Runtime error 315 ms 262148 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -