제출 #1051508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051508		anton	Toys (CEOI18_toy)	C++17	59 / 100	5041 ms	812 KiB

toy

#include<bits/stdc++.h>

using namespace std;
#define int long long

struct Venice{
    unordered_set<int> s;
    int d = 0;

    void add(int k){
        d+=k;
    }
    void insert(int i){
        s.insert(i-d);
    }
    vector<int> iter(){
        vector<int> res;
        for(auto e: s){
            res.push_back(e+d);
        }
        return res;
    }

    void merge(Venice& b){
        if(b.s.size()>s.size()){
            swap(b.s, s);
            swap(d, b.d);
        }

        for(auto e: b.iter()){
            insert(e);
        }
    }
};


int N;
vector<int> factorize(int n){
    vector<int> res;
    for(int i = 2; i*i<=n;i++){
        if(n%i == 0){
            res.push_back(i);
            if(i*i!=n){
                res.push_back(n/i);
            }
        }
    }
    res.push_back(n);
    return res;
}

void recur(int pos, int max_c, vector<vector<int>>& res, vector<int>& cur){
    if(pos == cur.size()){
        res.push_back(cur);
        return;
    }
    for(int i = 0; i<max_c; i++){
        cur[pos] = i;
        recur(pos+1, max_c, res, cur);
    }
}

unordered_set<int, Venice> sums;
Venice get_sums(int n){
    Venice res;
    if(n==1){
        res.insert(0);
        return res;
    }
    auto factors = factorize(n);
    for(auto e: factors){
        auto ch_s = get_sums(n/e);
        ch_s.add(e-1);
        res.merge(ch_s);
    }

    return res;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>N;

    auto possib = get_sums(N);
    
    vector<int> res;
    for(auto e: possib.iter()){
        res.push_back(e);
    }

    sort(res.begin(), res.end());

    
    cout<<res.size()<<endl;
    for(auto e: res){
        cout<<e<<" ";
    }
    cout<<endl;
}

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

toy.cpp: In function 'void recur(long long int, long long int, std::vector<std::vector<long long int> >&, std::vector<long long int>&)':
toy.cpp:53:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     if(pos == cur.size()){
      |        ~~~~^~~~~~~~~~~~~

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21