답안 #1068471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068471	2024-08-21T10:04:07 Z	cpdreamer	Toys (CEOI18_toy)	C++14	59 / 100	5000 ms	2444 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define V vector
#define F first
#define S second
#define P pair
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7

void file(){
    freopen("input.txt.txt","r",stdin);
    freopen("output.txt.txt","w",stdout);
}
ll binary_expo(ll a,ll b,ll m){
    ll res=1;
    while(b){
        if(b%2==1){res=(res*a)%m;b--;}
        b/=2;
        a=(a*a)%m;
    }
    return res;
}
bool prime(ll p){
    for(int i=0;i<100;i++) {
        ll b = rand()%p;
        if(b!=0) {
            ll res = binary_expo(b, p, p);
            if (res != b % p)
                return false;
        }
    }
    return true;
}
void  solve() {
    int n;
    cin>>n;
    if(n==1){
        cout<<1<<endl;
        cout<<0<<endl;
        return;
    }
    V<int>primes;
    V<int>factor;
    primes.pb(2);
    primes.pb(3);
    for(int i=1;(6*i)-1<=n;i++){
        if(prime((6*i)-1))
            primes.pb((6*i)-1);
        if(prime((6*i)+1))
            primes.pb((6*i)+1);
    }
    int p=0;
    while(n>1){
        if(n%primes[p]==0){
            n/=primes[p];
            factor.pb(primes[p]);
        }
        else
            p++;
    }
    set<V<int>>st;
    st.insert({factor[0]});
    for(int i=1;i<factor.size();i++) {
        set<V<int>>st1;
        for (auto &u: st) {
            for (int j=0;j<u.size();j++) {
                V<int>v=u;
                v[j]*=factor[i];
                sort(all(v));
                st1.insert(v);
            }
            V<int>v=u;
            v.pb(factor[i]);
            sort(all(v));
            st1.insert(v);
        }
        st=st1;
    }
    V<int>ans;
    for(auto u:st) {
        int c = 0;
        for (auto x: u) {
            c += x - 1;
        }
        ans.pb(c);
    }
    sort(all(ans));
    auto it=unique(all(ans));
    ans.resize(distance(ans.begin(),it));
    cout<<ans.size()<<endl;
    for(auto u:ans)
        cout<<u<<" ";
    cout<<"\n";
}
int main(){
    //file();
    ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
    solve();
}

Compilation message

toy.cpp: In function 'void solve()':
toy.cpp:70:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i=1;i<factor.size();i++) {
      |                 ~^~~~~~~~~~~~~~
toy.cpp:73:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             for (int j=0;j<u.size();j++) {
      |                          ~^~~~~~~~~
toy.cpp: In function 'void file()':
toy.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen("input.txt.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen("output.txt.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp: At global scope:
toy.cpp:15:12: warning: 'called' defined but not used [-Wunused-variable]
   15 | static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7
      |            ^~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	600 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	6 ms	348 KB	Output is correct
27	Correct	4 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	7 ms	348 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	5 ms	348 KB	Output is correct
34	Correct	7 ms	348 KB	Output is correct
35	Correct	7 ms	452 KB	Output is correct
36	Correct	7 ms	348 KB	Output is correct
37	Correct	6 ms	348 KB	Output is correct
38	Correct	7 ms	456 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	7 ms	456 KB	Output is correct
42	Correct	8 ms	600 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	7 ms	464 KB	Output is correct
46	Correct	7 ms	348 KB	Output is correct
47	Correct	8 ms	348 KB	Output is correct
48	Correct	7 ms	348 KB	Output is correct
49	Correct	8 ms	348 KB	Output is correct
50	Correct	57 ms	752 KB	Output is correct
51	Correct	39 ms	592 KB	Output is correct
52	Correct	36 ms	756 KB	Output is correct
53	Correct	34 ms	712 KB	Output is correct
54	Correct	20 ms	604 KB	Output is correct
55	Correct	66 ms	992 KB	Output is correct
56	Correct	57 ms	1104 KB	Output is correct
57	Correct	53 ms	848 KB	Output is correct
58	Correct	68 ms	348 KB	Output is correct
59	Correct	71 ms	344 KB	Output is correct
60	Correct	45 ms	348 KB	Output is correct
61	Correct	66 ms	712 KB	Output is correct
62	Correct	19 ms	344 KB	Output is correct
63	Correct	68 ms	492 KB	Output is correct
64	Correct	68 ms	528 KB	Output is correct
65	Correct	66 ms	592 KB	Output is correct
66	Correct	67 ms	348 KB	Output is correct
67	Correct	67 ms	452 KB	Output is correct
68	Correct	68 ms	344 KB	Output is correct
69	Correct	68 ms	348 KB	Output is correct
70	Correct	61 ms	492 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	600 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	6 ms	348 KB	Output is correct
27	Correct	4 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	7 ms	348 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	5 ms	348 KB	Output is correct
34	Correct	7 ms	348 KB	Output is correct
35	Correct	7 ms	452 KB	Output is correct
36	Correct	7 ms	348 KB	Output is correct
37	Correct	6 ms	348 KB	Output is correct
38	Correct	7 ms	456 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	7 ms	456 KB	Output is correct
42	Correct	8 ms	600 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	7 ms	464 KB	Output is correct
46	Correct	7 ms	348 KB	Output is correct
47	Correct	8 ms	348 KB	Output is correct
48	Correct	7 ms	348 KB	Output is correct
49	Correct	8 ms	348 KB	Output is correct
50	Correct	57 ms	752 KB	Output is correct
51	Correct	39 ms	592 KB	Output is correct
52	Correct	36 ms	756 KB	Output is correct
53	Correct	34 ms	712 KB	Output is correct
54	Correct	20 ms	604 KB	Output is correct
55	Correct	66 ms	992 KB	Output is correct
56	Correct	57 ms	1104 KB	Output is correct
57	Correct	53 ms	848 KB	Output is correct
58	Correct	68 ms	348 KB	Output is correct
59	Correct	71 ms	344 KB	Output is correct
60	Correct	45 ms	348 KB	Output is correct
61	Correct	66 ms	712 KB	Output is correct
62	Correct	19 ms	344 KB	Output is correct
63	Correct	68 ms	492 KB	Output is correct
64	Correct	68 ms	528 KB	Output is correct
65	Correct	66 ms	592 KB	Output is correct
66	Correct	67 ms	348 KB	Output is correct
67	Correct	67 ms	452 KB	Output is correct
68	Correct	68 ms	344 KB	Output is correct
69	Correct	68 ms	348 KB	Output is correct
70	Correct	61 ms	492 KB	Output is correct
71	Execution timed out	5042 ms	2444 KB	Time limit exceeded
72	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	600 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	6 ms	348 KB	Output is correct
27	Correct	4 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	7 ms	348 KB	Output is correct
32	Correct	6 ms	348 KB	Output is correct
33	Correct	5 ms	348 KB	Output is correct
34	Correct	7 ms	348 KB	Output is correct
35	Correct	7 ms	452 KB	Output is correct
36	Correct	7 ms	348 KB	Output is correct
37	Correct	6 ms	348 KB	Output is correct
38	Correct	7 ms	456 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	7 ms	456 KB	Output is correct
42	Correct	8 ms	600 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	7 ms	464 KB	Output is correct
46	Correct	7 ms	348 KB	Output is correct
47	Correct	8 ms	348 KB	Output is correct
48	Correct	7 ms	348 KB	Output is correct
49	Correct	8 ms	348 KB	Output is correct
50	Correct	57 ms	752 KB	Output is correct
51	Correct	39 ms	592 KB	Output is correct
52	Correct	36 ms	756 KB	Output is correct
53	Correct	34 ms	712 KB	Output is correct
54	Correct	20 ms	604 KB	Output is correct
55	Correct	66 ms	992 KB	Output is correct
56	Correct	57 ms	1104 KB	Output is correct
57	Correct	53 ms	848 KB	Output is correct
58	Correct	68 ms	348 KB	Output is correct
59	Correct	71 ms	344 KB	Output is correct
60	Correct	45 ms	348 KB	Output is correct
61	Correct	66 ms	712 KB	Output is correct
62	Correct	19 ms	344 KB	Output is correct
63	Correct	68 ms	492 KB	Output is correct
64	Correct	68 ms	528 KB	Output is correct
65	Correct	66 ms	592 KB	Output is correct
66	Correct	67 ms	348 KB	Output is correct
67	Correct	67 ms	452 KB	Output is correct
68	Correct	68 ms	344 KB	Output is correct
69	Correct	68 ms	348 KB	Output is correct
70	Correct	61 ms	492 KB	Output is correct
71	Execution timed out	5042 ms	2444 KB	Time limit exceeded
72	Halted	0 ms	0 KB	-

답안 #1068471

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 20.0

Subtask #5 0 / 21.0

Subtask #1
19.0 / 19.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 21.0