oj.uz

Submission #554884

# Submission time Handle Problem Language Result Execution time Memory
554884 2022-04-29T14:18:56 Z SmolBrain Toys (CEOI18_toy) C++17
59 / 100
 2760 ms 262144 KB 
// Om Namah Shivaya
// GM in 95 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

ll n;
vector<ll> a;
set<ll> ans;
ll siz;
set<array<ll, 3>> vis;

void calc(ll i, ll sum, ll prod) {
    if (prod == n) {
        ans.insert(sum);
        return;
    }

    if (i == siz) {
        return;
    }

    array<ll, 3> key = {i, sum, prod};
    if (vis.count(key)) return;

    vis.insert(key);

    calc(i + 1, sum, prod);

    ll curr = a[i] + 1;

    while (true) {
        prod *= curr;
        sum += curr - 1;

        if (n % prod) break;

        calc(i + 1, sum, prod);
    }
}

void solve(int test_case)
{
    cin >> n;
    for (ll i = 1; i * i <= n; ++i) {
        if (n % i) conts;

        if (i - 1 >= 1) a.pb(i - 1);

        ll temp = n / i;
        if (temp != i and temp - 1 >= 1) a.pb(temp - 1);
    }

    sort(all(a));
    siz = sz(a);

    calc(0, 0, 1);

    cout << sz(ans) << endl;
    trav(x, ans) cout << x << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

toy.cpp: In function 'void usaco(std::string)':
toy.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 18 ms 3508 KB Output is correct
27 Correct 14 ms 2804 KB Output is correct
28 Correct 6 ms 1364 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 2 ms 644 KB Output is correct
31 Correct 21 ms 3652 KB Output is correct
32 Correct 17 ms 2900 KB Output is correct
33 Correct 16 ms 2860 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 1492 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 9 ms 1892 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 1236 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 2 ms 468 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 18 ms 3508 KB Output is correct
27 Correct 14 ms 2804 KB Output is correct
28 Correct 6 ms 1364 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 2 ms 644 KB Output is correct
31 Correct 21 ms 3652 KB Output is correct
32 Correct 17 ms 2900 KB Output is correct
33 Correct 16 ms 2860 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 1492 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 9 ms 1892 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 1236 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 225 ms 29096 KB Output is correct
51 Correct 167 ms 23632 KB Output is correct
52 Correct 168 ms 22220 KB Output is correct
53 Correct 138 ms 18376 KB Output is correct
54 Correct 63 ms 10144 KB Output is correct
55 Correct 279 ms 36716 KB Output is correct
56 Correct 248 ms 30156 KB Output is correct
57 Correct 227 ms 30952 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 2 ms 596 KB Output is correct
61 Correct 46 ms 8140 KB Output is correct
62 Correct 29 ms 4984 KB Output is correct
63 Correct 9 ms 1640 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 67 ms 10448 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 980 KB Output is correct
70 Correct 40 ms 7072 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 18 ms 3508 KB Output is correct
27 Correct 14 ms 2804 KB Output is correct
28 Correct 6 ms 1364 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 2 ms 644 KB Output is correct
31 Correct 21 ms 3652 KB Output is correct
32 Correct 17 ms 2900 KB Output is correct
33 Correct 16 ms 2860 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 1492 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 9 ms 1892 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 1236 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 225 ms 29096 KB Output is correct
51 Correct 167 ms 23632 KB Output is correct
52 Correct 168 ms 22220 KB Output is correct
53 Correct 138 ms 18376 KB Output is correct
54 Correct 63 ms 10144 KB Output is correct
55 Correct 279 ms 36716 KB Output is correct
56 Correct 248 ms 30156 KB Output is correct
57 Correct 227 ms 30952 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 2 ms 596 KB Output is correct
61 Correct 46 ms 8140 KB Output is correct
62 Correct 29 ms 4984 KB Output is correct
63 Correct 9 ms 1640 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 67 ms 10448 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 980 KB Output is correct
70 Correct 40 ms 7072 KB Output is correct
71 Runtime error 2760 ms 262144 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 18 ms 3508 KB Output is correct
27 Correct 14 ms 2804 KB Output is correct
28 Correct 6 ms 1364 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 2 ms 644 KB Output is correct
31 Correct 21 ms 3652 KB Output is correct
32 Correct 17 ms 2900 KB Output is correct
33 Correct 16 ms 2860 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 1492 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 9 ms 1892 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 2 ms 596 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 7 ms 1236 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 225 ms 29096 KB Output is correct
51 Correct 167 ms 23632 KB Output is correct
52 Correct 168 ms 22220 KB Output is correct
53 Correct 138 ms 18376 KB Output is correct
54 Correct 63 ms 10144 KB Output is correct
55 Correct 279 ms 36716 KB Output is correct
56 Correct 248 ms 30156 KB Output is correct
57 Correct 227 ms 30952 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 2 ms 596 KB Output is correct
61 Correct 46 ms 8140 KB Output is correct
62 Correct 29 ms 4984 KB Output is correct
63 Correct 9 ms 1640 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 67 ms 10448 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 4 ms 980 KB Output is correct
70 Correct 40 ms 7072 KB Output is correct
71 Runtime error 2760 ms 262144 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -