oj.uz

Submission #147797

# Submission time Handle Problem Language Result Execution time Memory
147797 2019-08-30T16:44:20 Z 12tqian Toys (CEOI18_toy) C++14
79 / 100
 5000 ms 16348 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.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>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 1500;
const int INF = 2e9 + 7;
set<int> ans;
set<int> s;
unordered_map<int, int> um;
unordered_map<int, int> fin;
map<pii, int> use;
vi divisors;
vi nums[MAX];
///index of the divisor, find largest divisor of d less than or
///equal to mx
int val[MAX][MAX];
int get(int d, int mx){
    int l = 0;
    int r = sz(nums[d])-1;
    while(abs(l-r)>1){
        int m = (l + r)/2;
        if(nums[d][m]>mx){
            r = m-1;
        }
        else{
            l = m;
        }
    }
    if(l>r) swap(l, r);
    if(nums[d][r] <= mx) return r;
    return l;
}
int cnt = 0;
void solve(int left, int last, int sum){
    if(left == 1){
        cnt++;
        fin[sum] = 1;
        return;
    }
    int id = um[left];
    int idx;
    if(left <= last) idx = sz(nums[id]) - 1;
    else idx = val[id][um[last]];
    f1r(i, 1, idx+1){
        int divisor = nums[id][i];
        solve(left/divisors[divisor], divisors[divisor], sum + divisors[divisor] - 1);
    }
}
int main(){
    fast_io();
    int n;
   // cin >> n;
    scanf("%d", &n);
    f1r(i, 1, sqrt(n) + 1){
        if(n%i == 0){
            s.insert(i);
            s.insert(n/i);
        }
    }
    for(auto x: s) divisors.eb(x);
    f0r(i, sz(divisors)){
        um[divisors[i]] = i;
        f0r(j, i+1){
            if(divisors[i]%divisors[j] == 0){
                nums[i].eb(j);
            }
        }
    }
    f0r(i, sz(divisors)){
        f0r(j, sz(divisors)){
            val[i][j] = get(i, divisors[j]);
        }
    }
    solve(n, INF, 0);
    for(auto i: fin) ans.insert(i.f);
  //  cout << sz(ans) << endl;
    printf("%d\n", sz(ans));
    for(auto x: ans) printf("%d ", x);
   // cout << endl;
   // cout << cnt << endl;
    return 0;
}

Compilation message

toy.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
toy.cpp: In function 'void io(std::__cxx11::string)':
toy.cpp:52:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
toy.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~
toy.cpp: In function 'int main()':
toy.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 3 ms 632 KB Output is correct
32 Correct 3 ms 632 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 632 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 4 ms 1016 KB Output is correct
51 Correct 4 ms 1020 KB Output is correct
52 Correct 4 ms 888 KB Output is correct
53 Correct 4 ms 888 KB Output is correct
54 Correct 3 ms 888 KB Output is correct
55 Correct 6 ms 1016 KB Output is correct
56 Correct 6 ms 1016 KB Output is correct
57 Correct 5 ms 1016 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 7 ms 632 KB Output is correct
62 Correct 3 ms 760 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 2 ms 504 KB Output is correct
65 Correct 3 ms 760 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 2 ms 376 KB Output is correct
68 Correct 2 ms 504 KB Output is correct
69 Correct 2 ms 636 KB Output is correct
70 Correct 3 ms 888 KB Output is correct
71 Correct 244 ms 7220 KB Output is correct
72 Correct 130 ms 6648 KB Output is correct
73 Correct 374 ms 6520 KB Output is correct
74 Correct 127 ms 5784 KB Output is correct
75 Correct 185 ms 5752 KB Output is correct
76 Correct 634 ms 7696 KB Output is correct
77 Correct 1569 ms 6508 KB Output is correct
78 Correct 629 ms 6912 KB Output is correct
79 Correct 603 ms 6652 KB Output is correct
80 Correct 3 ms 376 KB Output is correct
81 Correct 3 ms 380 KB Output is correct
82 Correct 255 ms 760 KB Output is correct
83 Correct 1533 ms 1892 KB Output is correct
84 Correct 103 ms 2168 KB Output is correct
85 Correct 45 ms 1016 KB Output is correct
86 Correct 3 ms 632 KB Output is correct
87 Correct 90 ms 2368 KB Output is correct
88 Correct 2 ms 504 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 632 KB Output is correct
91 Correct 16 ms 2072 KB Output is correct
92 Correct 56 ms 5112 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 2 ms 508 KB Output is correct
31 Correct 3 ms 632 KB Output is correct
32 Correct 3 ms 632 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 632 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 504 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 4 ms 1016 KB Output is correct
51 Correct 4 ms 1020 KB Output is correct
52 Correct 4 ms 888 KB Output is correct
53 Correct 4 ms 888 KB Output is correct
54 Correct 3 ms 888 KB Output is correct
55 Correct 6 ms 1016 KB Output is correct
56 Correct 6 ms 1016 KB Output is correct
57 Correct 5 ms 1016 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 7 ms 632 KB Output is correct
62 Correct 3 ms 760 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 2 ms 504 KB Output is correct
65 Correct 3 ms 760 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 2 ms 376 KB Output is correct
68 Correct 2 ms 504 KB Output is correct
69 Correct 2 ms 636 KB Output is correct
70 Correct 3 ms 888 KB Output is correct
71 Correct 244 ms 7220 KB Output is correct
72 Correct 130 ms 6648 KB Output is correct
73 Correct 374 ms 6520 KB Output is correct
74 Correct 127 ms 5784 KB Output is correct
75 Correct 185 ms 5752 KB Output is correct
76 Correct 634 ms 7696 KB Output is correct
77 Correct 1569 ms 6508 KB Output is correct
78 Correct 629 ms 6912 KB Output is correct
79 Correct 603 ms 6652 KB Output is correct
80 Correct 3 ms 376 KB Output is correct
81 Correct 3 ms 380 KB Output is correct
82 Correct 255 ms 760 KB Output is correct
83 Correct 1533 ms 1892 KB Output is correct
84 Correct 103 ms 2168 KB Output is correct
85 Correct 45 ms 1016 KB Output is correct
86 Correct 3 ms 632 KB Output is correct
87 Correct 90 ms 2368 KB Output is correct
88 Correct 2 ms 504 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 632 KB Output is correct
91 Correct 16 ms 2072 KB Output is correct
92 Correct 56 ms 5112 KB Output is correct
93 Correct 2118 ms 16044 KB Output is correct
94 Correct 751 ms 14248 KB Output is correct
95 Correct 1119 ms 13832 KB Output is correct
96 Correct 947 ms 12472 KB Output is correct
97 Correct 1167 ms 11312 KB Output is correct
98 Correct 3490 ms 16348 KB Output is correct
99 Correct 3749 ms 16320 KB Output is correct
100 Correct 3771 ms 16056 KB Output is correct
101 Execution timed out 5069 ms 7540 KB Time limit exceeded
102 Halted 0 ms 0 KB -