제출 #1068639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068639		cpdreamer	Toys (CEOI18_toy)	C++14	59 / 100	833 ms	262144 KiB

toy

#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%m;
}
bool prime(ll p){
    for(int i=0;i<500;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;
    for(int i=1;i*i<=n;i++){
        if(i==1){
            if(prime(n))
                primes.pb(n);
            continue;
        }
        if(n%i==0){
            if(prime(i))
                primes.pb(i);
            if(prime(n/i))
                primes.pb(n/i);
        }
    }
    sort(all(primes));
    auto it1=unique(all(primes));
    primes.resize(distance(primes.begin(),it1));
    int p=0;
    while(n>1){
        if(n%primes[p]==0){
            n/=primes[p];
            factor.pb(primes[p]);
        }
        else
            p++;
    }
    set<map<int,int>>st;
    map<int,int>mp1;
    mp1[factor[0]]++;
    st.insert(mp1);
    V<int>ans;
    for(int i=1;i<factor.size();i++){
        set<map<int,int>>st1;
        for(auto u:st){
            for(auto x:u){
                map<int,int>mp=u;
                mp[x.F]--;
                if(mp[x.F]==0)
                    mp.erase(x.F);
                mp[x.F*factor[i]]++;
                st1.insert(mp);
            }
            map<int,int>mp=u;
            mp[factor[i]]++;
            st1.insert(mp);
        }
        st=st1;
        st1.clear();

    }
    for(auto u:st) {
        int c = 0;
        for (auto x: u) {
            c +=x.S* x.F - x.S;
        }
        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<<endl;
}
int main(){
    //file();
    solve();
}

컴파일 시 표준 에러 (stderr) 메시지

toy.cpp: In function 'void solve()':
toy.cpp:81:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=1;i<factor.size();i++){
      |                 ~^~~~~~~~~~~~~~
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 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21