oj.uz

Submission #481183

# Submission time Handle Problem Language Result Execution time Memory
481183 2021-10-19T18:12:19 Z hidden1 Toys (CEOI18_toy) C++14
59 / 100
 1597 ms 94632 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(ll i = 0; i < n; i ++)
#define revn(i, n) for(ll i = n - 1; i >= 0; i --)
typedef long long ll;
template<class T, template<class T2, class A=allocator<T2> > class cont> inline ostream &operator <<(ostream &out, const cont<T> &x) { for(const auto &it : x) { out << it << " ";} return out;}
template<class T, template<class T2, class A=allocator<T2> > class cont> inline istream &operator >>(istream &in, cont<T> &x) { for(auto &it : x) { in >> it;} return in;}
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;

const ll MAX_N = 1e6 + 10, MAX_CORD = 1e3 + 10;
ll n;
vector<ll> divis;

void comp(ll x) {
    for(ll i = 1; i * i <= x; i ++) {
        if(x % i == 0) {
            divis.push_back(i);
            if(i * i != x) {
                divis.push_back(x / i);
            }
        }
    }

    sort(all(divis));
}

bitset<MAX_N> dp[MAX_CORD];
ll who[MAX_CORD][MAX_CORD];

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

    cin >> n;
    if(n == 1) {
        cout << 1 << endl << 0 << endl;
        return 0;
    }

    comp(n);

    dp[0][0] = true;

    forn(i, divis.size() - 1) {
        cerr << "Starting " << i << ": ";
        forn(j, MAX_N) {
            if(dp[i][j]) {
                cerr << j << " ";
            }
        }
        cerr << endl;
        forn(j, divis.size() - 1) {
            ll prod = divis[i] * divis[j];
            ll to = -1;
            if(n % prod == 0) {
                to = lower_bound(all(divis), prod) - divis.begin();
            } else {
                continue;
            }
            cerr << "from " << divis[i] << " " << divis[j] << " -> " << divis[to] << endl;
            dp[to] |= dp[i] << (divis[j] - 1);
        }
    }

    cout << dp[divis.size() - 1].count() + 1 << endl;
    forn(i, MAX_N) {
        if(dp[divis.size() - 1][i]) {
            cout << i << " ";
        }
    }
    cout << n - 1 << endl;

    return 0;
}

Compilation message

toy.cpp: In function 'int main()':
toy.cpp:10:36: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | #define forn(i, n) for(ll i = 0; i < n; i ++)
......
   54 |     forn(i, divis.size() - 1) {
      |          ~~~~~~~~~~~~~~~~~~~        
toy.cpp:54:5: note: in expansion of macro 'forn'
   54 |     forn(i, divis.size() - 1) {
      |     ^~~~
toy.cpp:10:36: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | #define forn(i, n) for(ll i = 0; i < n; i ++)
......
   62 |         forn(j, divis.size() - 1) {
      |              ~~~~~~~~~~~~~~~~~~~    
toy.cpp:62:9: note: in expansion of macro 'forn'
   62 |         forn(j, divis.size() - 1) {
      |         ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 684 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 3 ms 1228 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1228 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 2 ms 844 KB Output is correct
24 Correct 4 ms 1740 KB Output is correct
25 Correct 3 ms 1612 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 684 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 3 ms 1228 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1228 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 2 ms 844 KB Output is correct
24 Correct 4 ms 1740 KB Output is correct
25 Correct 3 ms 1612 KB Output is correct
26 Correct 29 ms 8392 KB Output is correct
27 Correct 31 ms 7884 KB Output is correct
28 Correct 20 ms 6348 KB Output is correct
29 Correct 14 ms 5452 KB Output is correct
30 Correct 13 ms 4940 KB Output is correct
31 Correct 30 ms 7320 KB Output is correct
32 Correct 28 ms 7116 KB Output is correct
33 Correct 24 ms 7304 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 1064 KB Output is correct
36 Correct 5 ms 2280 KB Output is correct
37 Correct 18 ms 4964 KB Output is correct
38 Correct 9 ms 3532 KB Output is correct
39 Correct 5 ms 1996 KB Output is correct
40 Correct 23 ms 6436 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 8 ms 3404 KB Output is correct
44 Correct 2 ms 972 KB Output is correct
45 Correct 12 ms 4868 KB Output is correct
46 Correct 5 ms 1996 KB Output is correct
47 Correct 16 ms 4964 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 11 ms 4480 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 684 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 3 ms 1228 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1228 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 2 ms 844 KB Output is correct
24 Correct 4 ms 1740 KB Output is correct
25 Correct 3 ms 1612 KB Output is correct
26 Correct 29 ms 8392 KB Output is correct
27 Correct 31 ms 7884 KB Output is correct
28 Correct 20 ms 6348 KB Output is correct
29 Correct 14 ms 5452 KB Output is correct
30 Correct 13 ms 4940 KB Output is correct
31 Correct 30 ms 7320 KB Output is correct
32 Correct 28 ms 7116 KB Output is correct
33 Correct 24 ms 7304 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 1064 KB Output is correct
36 Correct 5 ms 2280 KB Output is correct
37 Correct 18 ms 4964 KB Output is correct
38 Correct 9 ms 3532 KB Output is correct
39 Correct 5 ms 1996 KB Output is correct
40 Correct 23 ms 6436 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 8 ms 3404 KB Output is correct
44 Correct 2 ms 972 KB Output is correct
45 Correct 12 ms 4868 KB Output is correct
46 Correct 5 ms 1996 KB Output is correct
47 Correct 16 ms 4964 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 11 ms 4480 KB Output is correct
50 Correct 93 ms 16204 KB Output is correct
51 Correct 75 ms 15124 KB Output is correct
52 Correct 78 ms 13772 KB Output is correct
53 Correct 68 ms 12776 KB Output is correct
54 Correct 53 ms 12296 KB Output is correct
55 Correct 83 ms 15180 KB Output is correct
56 Correct 78 ms 13772 KB Output is correct
57 Correct 93 ms 15112 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 3 ms 972 KB Output is correct
60 Correct 8 ms 2636 KB Output is correct
61 Correct 37 ms 7372 KB Output is correct
62 Correct 36 ms 8276 KB Output is correct
63 Correct 16 ms 4940 KB Output is correct
64 Correct 5 ms 1996 KB Output is correct
65 Correct 47 ms 9728 KB Output is correct
66 Correct 3 ms 972 KB Output is correct
67 Correct 3 ms 1228 KB Output is correct
68 Correct 8 ms 3404 KB Output is correct
69 Correct 17 ms 6348 KB Output is correct
70 Correct 51 ms 12236 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 684 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 3 ms 1228 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1228 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 2 ms 844 KB Output is correct
24 Correct 4 ms 1740 KB Output is correct
25 Correct 3 ms 1612 KB Output is correct
26 Correct 29 ms 8392 KB Output is correct
27 Correct 31 ms 7884 KB Output is correct
28 Correct 20 ms 6348 KB Output is correct
29 Correct 14 ms 5452 KB Output is correct
30 Correct 13 ms 4940 KB Output is correct
31 Correct 30 ms 7320 KB Output is correct
32 Correct 28 ms 7116 KB Output is correct
33 Correct 24 ms 7304 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 1064 KB Output is correct
36 Correct 5 ms 2280 KB Output is correct
37 Correct 18 ms 4964 KB Output is correct
38 Correct 9 ms 3532 KB Output is correct
39 Correct 5 ms 1996 KB Output is correct
40 Correct 23 ms 6436 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 8 ms 3404 KB Output is correct
44 Correct 2 ms 972 KB Output is correct
45 Correct 12 ms 4868 KB Output is correct
46 Correct 5 ms 1996 KB Output is correct
47 Correct 16 ms 4964 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 11 ms 4480 KB Output is correct
50 Correct 93 ms 16204 KB Output is correct
51 Correct 75 ms 15124 KB Output is correct
52 Correct 78 ms 13772 KB Output is correct
53 Correct 68 ms 12776 KB Output is correct
54 Correct 53 ms 12296 KB Output is correct
55 Correct 83 ms 15180 KB Output is correct
56 Correct 78 ms 13772 KB Output is correct
57 Correct 93 ms 15112 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 3 ms 972 KB Output is correct
60 Correct 8 ms 2636 KB Output is correct
61 Correct 37 ms 7372 KB Output is correct
62 Correct 36 ms 8276 KB Output is correct
63 Correct 16 ms 4940 KB Output is correct
64 Correct 5 ms 1996 KB Output is correct
65 Correct 47 ms 9728 KB Output is correct
66 Correct 3 ms 972 KB Output is correct
67 Correct 3 ms 1228 KB Output is correct
68 Correct 8 ms 3404 KB Output is correct
69 Correct 17 ms 6348 KB Output is correct
70 Correct 51 ms 12236 KB Output is correct
71 Incorrect 1597 ms 94632 KB Output isn't correct
72 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 684 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 3 ms 844 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 972 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 3 ms 1228 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 3 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1228 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 3 ms 1228 KB Output is correct
21 Correct 3 ms 1228 KB Output is correct
22 Correct 3 ms 1484 KB Output is correct
23 Correct 2 ms 844 KB Output is correct
24 Correct 4 ms 1740 KB Output is correct
25 Correct 3 ms 1612 KB Output is correct
26 Correct 29 ms 8392 KB Output is correct
27 Correct 31 ms 7884 KB Output is correct
28 Correct 20 ms 6348 KB Output is correct
29 Correct 14 ms 5452 KB Output is correct
30 Correct 13 ms 4940 KB Output is correct
31 Correct 30 ms 7320 KB Output is correct
32 Correct 28 ms 7116 KB Output is correct
33 Correct 24 ms 7304 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 1064 KB Output is correct
36 Correct 5 ms 2280 KB Output is correct
37 Correct 18 ms 4964 KB Output is correct
38 Correct 9 ms 3532 KB Output is correct
39 Correct 5 ms 1996 KB Output is correct
40 Correct 23 ms 6436 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 588 KB Output is correct
43 Correct 8 ms 3404 KB Output is correct
44 Correct 2 ms 972 KB Output is correct
45 Correct 12 ms 4868 KB Output is correct
46 Correct 5 ms 1996 KB Output is correct
47 Correct 16 ms 4964 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 11 ms 4480 KB Output is correct
50 Correct 93 ms 16204 KB Output is correct
51 Correct 75 ms 15124 KB Output is correct
52 Correct 78 ms 13772 KB Output is correct
53 Correct 68 ms 12776 KB Output is correct
54 Correct 53 ms 12296 KB Output is correct
55 Correct 83 ms 15180 KB Output is correct
56 Correct 78 ms 13772 KB Output is correct
57 Correct 93 ms 15112 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 3 ms 972 KB Output is correct
60 Correct 8 ms 2636 KB Output is correct
61 Correct 37 ms 7372 KB Output is correct
62 Correct 36 ms 8276 KB Output is correct
63 Correct 16 ms 4940 KB Output is correct
64 Correct 5 ms 1996 KB Output is correct
65 Correct 47 ms 9728 KB Output is correct
66 Correct 3 ms 972 KB Output is correct
67 Correct 3 ms 1228 KB Output is correct
68 Correct 8 ms 3404 KB Output is correct
69 Correct 17 ms 6348 KB Output is correct
70 Correct 51 ms 12236 KB Output is correct
71 Incorrect 1597 ms 94632 KB Output isn't correct
72 Halted 0 ms 0 KB -