oj.uz

답안 #523567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523567 2022-02-07T19:26:53 Z Carmel_Ab1 Toys (CEOI18_toy) C++17
79 / 100
 5000 ms 78868 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#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 vector<pi> vpi;

//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 outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.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;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
umap<int,unordered_set<int>>dp;

int sqr(int n){
   int l=1,r=31623,ans=-1;
   while(l<=r){
        int m=(l+r)/2;
        if(m*m<=n)
            l=m+1,ans=m;
        else
            r=m-1;
   }
   return ans;
}

void dfs(int n){
    if(dp[n].size())
        return;
    if(n==1){
        dp[n]={0};
        return;
    }
    dp[n]={n-1};

    for(int i=sqr(n); i>1; i--){
        if(n%i)continue;
        dfs(i);
        dfs(n/i);

        for(int x:dp[i])
            for(int y:dp[n/i])
                dp[n].insert(x+y);
    }

}
void solve() {
    ll n;
    cin >> n;
    dfs(n);
    vi v;
    for(int x:dp[n])
        v.pb(x);
    sort(all(v));
    cout << dp[n].size() << "\n";
    print(v)

}

Compilation message

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

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 308 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 308 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 3 ms 568 KB Output is correct
53 Correct 2 ms 460 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 3 ms 588 KB Output is correct
56 Correct 4 ms 588 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 460 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 308 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 3 ms 568 KB Output is correct
53 Correct 2 ms 460 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 3 ms 588 KB Output is correct
56 Correct 4 ms 588 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 460 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 393 ms 17188 KB Output is correct
72 Correct 247 ms 12996 KB Output is correct
73 Correct 425 ms 15396 KB Output is correct
74 Correct 175 ms 10236 KB Output is correct
75 Correct 227 ms 10944 KB Output is correct
76 Correct 793 ms 22944 KB Output is correct
77 Correct 900 ms 20432 KB Output is correct
78 Correct 654 ms 19196 KB Output is correct
79 Correct 694 ms 18576 KB Output is correct
80 Correct 1 ms 204 KB Output is correct
81 Correct 0 ms 204 KB Output is correct
82 Correct 6 ms 568 KB Output is correct
83 Correct 92 ms 3284 KB Output is correct
84 Correct 80 ms 4132 KB Output is correct
85 Correct 16 ms 1356 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 91 ms 4652 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 1 ms 204 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 13 ms 1996 KB Output is correct
92 Correct 56 ms 6084 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 308 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 3 ms 568 KB Output is correct
53 Correct 2 ms 460 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 3 ms 588 KB Output is correct
56 Correct 4 ms 588 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 460 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 1 ms 460 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 393 ms 17188 KB Output is correct
72 Correct 247 ms 12996 KB Output is correct
73 Correct 425 ms 15396 KB Output is correct
74 Correct 175 ms 10236 KB Output is correct
75 Correct 227 ms 10944 KB Output is correct
76 Correct 793 ms 22944 KB Output is correct
77 Correct 900 ms 20432 KB Output is correct
78 Correct 654 ms 19196 KB Output is correct
79 Correct 694 ms 18576 KB Output is correct
80 Correct 1 ms 204 KB Output is correct
81 Correct 0 ms 204 KB Output is correct
82 Correct 6 ms 568 KB Output is correct
83 Correct 92 ms 3284 KB Output is correct
84 Correct 80 ms 4132 KB Output is correct
85 Correct 16 ms 1356 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 91 ms 4652 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 1 ms 204 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 13 ms 1996 KB Output is correct
92 Correct 56 ms 6084 KB Output is correct
93 Correct 3712 ms 71412 KB Output is correct
94 Correct 1538 ms 47892 KB Output is correct
95 Correct 1925 ms 50068 KB Output is correct
96 Correct 1711 ms 45220 KB Output is correct
97 Correct 1737 ms 41400 KB Output is correct
98 Correct 4442 ms 78868 KB Output is correct
99 Execution timed out 5089 ms 78668 KB Time limit exceeded
100 Halted 0 ms 0 KB -