제출 #248788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
248788		Sorting	Toys (CEOI18_toy)	C++14	79 / 100	5076 ms	9632 KiB

toy

#include <bits/stdc++.h>

using namespace std;

unordered_map<int, vector<int>> dp;

void solve(int n){
    vector<int> div;
    for(int i = 2; i * i <= n; ++i){
        if(n % i == 0){
            div.push_back(i);
            if(i * i != n)
                div.push_back(n / i);
        }
    }
    div.push_back(n);

    for(int d: div){
        vector<int> add;
        for(int x: dp[n])
            add.push_back(x + d - 1);

        int i = 0, j = 0;
        int nd = n / d;
        vector<int> new_v;
        while(i != add.size() && j != dp[nd].size()){
            if(add[i] == dp[nd][j])
                new_v.push_back(add[i]), i++, j++;
            else if(add[i] < dp[nd][j])
                new_v.push_back(add[i]), i++;
            else
                new_v.push_back(dp[nd][j]), j++;
        }

        while(i != add.size())
            new_v.push_back(add[i]), i++;
        while(j != dp[nd].size())
            new_v.push_back(dp[nd][j]), j++;

        dp[nd] = new_v;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    

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

    sort(div.begin(), div.end());
    reverse(div.begin(), div.end());

    dp[n].push_back(0);

    for(int d: div)
        solve(d);

    cout << dp[1].size() << "\n";
    for(int x: dp[1])
        cout << x << " ";
    cout << "\n";
}

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

toy.cpp: In function 'void solve(int)':
toy.cpp:26:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i != add.size() && j != dp[nd].size()){
               ~~^~~~~~~~~~~~~
toy.cpp:26:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i != add.size() && j != dp[nd].size()){
                                  ~~^~~~~~~~~~~~~~~~
toy.cpp:35:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i != add.size())
               ~~^~~~~~~~~~~~~
toy.cpp:37:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(j != dp[nd].size())
               ~~^~~~~~~~~~~~~~~~

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