oj.uz

답안 #469390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469390 2021-08-31T18:29:50 Z Carmel_Ab1 Toys (CEOI18_toy) C++17
59 / 100
 1353 ms 262148 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(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);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t:a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
set<int>ans;
vl pf;
ll n;
void solve() {
    cin >> n;

    const ll maxs=1e5+1;
    vl s(maxs,1),primes;
    vvl divs(n+1);
    for(int i=1; i<=n; i++)
        for(int j=i; j<=n; j+=i)
            divs[j].pb(i);

    vvl dp(n+1);
    for(int i=1; i<=n; i++){
        for(int j:divs[i]){
            if(j==i || j==1)continue;

            for(ll x:dp[j])
                for(ll y:dp[i/j])
                    dp[i].pb(x+y);
        }
        dp[i].pb(i-1);
        sort(all(dp[i]));
        dp[i]=UNQ(dp[i]);
    }

    cout << dp[n].size() << "\n";
    print(dp[n])
}

Compilation message

toy.cpp: In function 'void usaco(std::string)':
toy.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
toy.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1000 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1000 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 37 ms 3404 KB Output is correct
27 Correct 21 ms 2508 KB Output is correct
28 Correct 8 ms 1740 KB Output is correct
29 Correct 5 ms 1484 KB Output is correct
30 Correct 4 ms 1356 KB Output is correct
31 Correct 44 ms 3828 KB Output is correct
32 Correct 35 ms 3264 KB Output is correct
33 Correct 31 ms 3136 KB Output is correct
34 Correct 52 ms 4256 KB Output is correct
35 Correct 51 ms 4156 KB Output is correct
36 Correct 43 ms 3692 KB Output is correct
37 Correct 44 ms 3524 KB Output is correct
38 Correct 53 ms 4256 KB Output is correct
39 Correct 53 ms 4180 KB Output is correct
40 Correct 46 ms 3912 KB Output is correct
41 Correct 52 ms 4268 KB Output is correct
42 Correct 55 ms 4156 KB Output is correct
43 Correct 46 ms 3852 KB Output is correct
44 Correct 52 ms 4224 KB Output is correct
45 Correct 53 ms 4204 KB Output is correct
46 Correct 52 ms 4212 KB Output is correct
47 Correct 60 ms 4256 KB Output is correct
48 Correct 56 ms 4260 KB Output is correct
49 Correct 63 ms 4256 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1000 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 37 ms 3404 KB Output is correct
27 Correct 21 ms 2508 KB Output is correct
28 Correct 8 ms 1740 KB Output is correct
29 Correct 5 ms 1484 KB Output is correct
30 Correct 4 ms 1356 KB Output is correct
31 Correct 44 ms 3828 KB Output is correct
32 Correct 35 ms 3264 KB Output is correct
33 Correct 31 ms 3136 KB Output is correct
34 Correct 52 ms 4256 KB Output is correct
35 Correct 51 ms 4156 KB Output is correct
36 Correct 43 ms 3692 KB Output is correct
37 Correct 44 ms 3524 KB Output is correct
38 Correct 53 ms 4256 KB Output is correct
39 Correct 53 ms 4180 KB Output is correct
40 Correct 46 ms 3912 KB Output is correct
41 Correct 52 ms 4268 KB Output is correct
42 Correct 55 ms 4156 KB Output is correct
43 Correct 46 ms 3852 KB Output is correct
44 Correct 52 ms 4224 KB Output is correct
45 Correct 53 ms 4204 KB Output is correct
46 Correct 52 ms 4212 KB Output is correct
47 Correct 60 ms 4256 KB Output is correct
48 Correct 56 ms 4260 KB Output is correct
49 Correct 63 ms 4256 KB Output is correct
50 Correct 1034 ms 36332 KB Output is correct
51 Correct 597 ms 23276 KB Output is correct
52 Correct 506 ms 21308 KB Output is correct
53 Correct 449 ms 19056 KB Output is correct
54 Correct 220 ms 11216 KB Output is correct
55 Correct 1173 ms 40224 KB Output is correct
56 Correct 989 ms 35788 KB Output is correct
57 Correct 895 ms 32832 KB Output is correct
58 Correct 1333 ms 44592 KB Output is correct
59 Correct 1304 ms 43448 KB Output is correct
60 Correct 752 ms 28084 KB Output is correct
61 Correct 1224 ms 41192 KB Output is correct
62 Correct 208 ms 10956 KB Output is correct
63 Correct 1353 ms 44584 KB Output is correct
64 Correct 1303 ms 44748 KB Output is correct
65 Correct 1155 ms 39504 KB Output is correct
66 Correct 1298 ms 44604 KB Output is correct
67 Correct 1289 ms 44584 KB Output is correct
68 Correct 1296 ms 44652 KB Output is correct
69 Correct 1299 ms 44576 KB Output is correct
70 Correct 1134 ms 39416 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1000 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 37 ms 3404 KB Output is correct
27 Correct 21 ms 2508 KB Output is correct
28 Correct 8 ms 1740 KB Output is correct
29 Correct 5 ms 1484 KB Output is correct
30 Correct 4 ms 1356 KB Output is correct
31 Correct 44 ms 3828 KB Output is correct
32 Correct 35 ms 3264 KB Output is correct
33 Correct 31 ms 3136 KB Output is correct
34 Correct 52 ms 4256 KB Output is correct
35 Correct 51 ms 4156 KB Output is correct
36 Correct 43 ms 3692 KB Output is correct
37 Correct 44 ms 3524 KB Output is correct
38 Correct 53 ms 4256 KB Output is correct
39 Correct 53 ms 4180 KB Output is correct
40 Correct 46 ms 3912 KB Output is correct
41 Correct 52 ms 4268 KB Output is correct
42 Correct 55 ms 4156 KB Output is correct
43 Correct 46 ms 3852 KB Output is correct
44 Correct 52 ms 4224 KB Output is correct
45 Correct 53 ms 4204 KB Output is correct
46 Correct 52 ms 4212 KB Output is correct
47 Correct 60 ms 4256 KB Output is correct
48 Correct 56 ms 4260 KB Output is correct
49 Correct 63 ms 4256 KB Output is correct
50 Correct 1034 ms 36332 KB Output is correct
51 Correct 597 ms 23276 KB Output is correct
52 Correct 506 ms 21308 KB Output is correct
53 Correct 449 ms 19056 KB Output is correct
54 Correct 220 ms 11216 KB Output is correct
55 Correct 1173 ms 40224 KB Output is correct
56 Correct 989 ms 35788 KB Output is correct
57 Correct 895 ms 32832 KB Output is correct
58 Correct 1333 ms 44592 KB Output is correct
59 Correct 1304 ms 43448 KB Output is correct
60 Correct 752 ms 28084 KB Output is correct
61 Correct 1224 ms 41192 KB Output is correct
62 Correct 208 ms 10956 KB Output is correct
63 Correct 1353 ms 44584 KB Output is correct
64 Correct 1303 ms 44748 KB Output is correct
65 Correct 1155 ms 39504 KB Output is correct
66 Correct 1298 ms 44604 KB Output is correct
67 Correct 1289 ms 44584 KB Output is correct
68 Correct 1296 ms 44652 KB Output is correct
69 Correct 1299 ms 44576 KB Output is correct
70 Correct 1134 ms 39416 KB Output is correct
71 Runtime error 134 ms 262148 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1000 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1084 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 37 ms 3404 KB Output is correct
27 Correct 21 ms 2508 KB Output is correct
28 Correct 8 ms 1740 KB Output is correct
29 Correct 5 ms 1484 KB Output is correct
30 Correct 4 ms 1356 KB Output is correct
31 Correct 44 ms 3828 KB Output is correct
32 Correct 35 ms 3264 KB Output is correct
33 Correct 31 ms 3136 KB Output is correct
34 Correct 52 ms 4256 KB Output is correct
35 Correct 51 ms 4156 KB Output is correct
36 Correct 43 ms 3692 KB Output is correct
37 Correct 44 ms 3524 KB Output is correct
38 Correct 53 ms 4256 KB Output is correct
39 Correct 53 ms 4180 KB Output is correct
40 Correct 46 ms 3912 KB Output is correct
41 Correct 52 ms 4268 KB Output is correct
42 Correct 55 ms 4156 KB Output is correct
43 Correct 46 ms 3852 KB Output is correct
44 Correct 52 ms 4224 KB Output is correct
45 Correct 53 ms 4204 KB Output is correct
46 Correct 52 ms 4212 KB Output is correct
47 Correct 60 ms 4256 KB Output is correct
48 Correct 56 ms 4260 KB Output is correct
49 Correct 63 ms 4256 KB Output is correct
50 Correct 1034 ms 36332 KB Output is correct
51 Correct 597 ms 23276 KB Output is correct
52 Correct 506 ms 21308 KB Output is correct
53 Correct 449 ms 19056 KB Output is correct
54 Correct 220 ms 11216 KB Output is correct
55 Correct 1173 ms 40224 KB Output is correct
56 Correct 989 ms 35788 KB Output is correct
57 Correct 895 ms 32832 KB Output is correct
58 Correct 1333 ms 44592 KB Output is correct
59 Correct 1304 ms 43448 KB Output is correct
60 Correct 752 ms 28084 KB Output is correct
61 Correct 1224 ms 41192 KB Output is correct
62 Correct 208 ms 10956 KB Output is correct
63 Correct 1353 ms 44584 KB Output is correct
64 Correct 1303 ms 44748 KB Output is correct
65 Correct 1155 ms 39504 KB Output is correct
66 Correct 1298 ms 44604 KB Output is correct
67 Correct 1289 ms 44584 KB Output is correct
68 Correct 1296 ms 44652 KB Output is correct
69 Correct 1299 ms 44576 KB Output is correct
70 Correct 1134 ms 39416 KB Output is correct
71 Runtime error 134 ms 262148 KB Execution killed with signal 9
72 Halted 0 ms 0 KB -