제출 #1313970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313970		Zbyszek99	Toys (CEOI18_toy)	C++20	100 / 100	1804 ms	80396 KiB

toy

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

unordered_set<int> sum[2000];
unordered_map<int,int> ind;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    ll n;
    cin >> n;
    vl d = {n};
    for(ll i = 2; i*i <= n; i++)
    {
        if(n%i == 0)
        {
            d.pb(i);
            if(i*i != n) d.pb(n/i);
        }
    }
    sort(all(d));
    int cur = 0;
    forall(it,d) ind[it] = cur++;
    forall(it,d) sum[ind[it]].insert(it-1);
    rep(i,siz(d)-1)
    {
        rep(j,siz(d))
        {
            if(n%(d[i]*d[j]) != 0) continue;
            forall(s,sum[i])
            {
                sum[ind[d[i]*d[j]]].insert(s+d[j]-1);
            }
        }
    }
    vl x;
    forall(it,sum[siz(d)-1]) x.pb(it);
    sort(all(x));
    cout << siz(x) << "\n";
    forall(it,x) cout << it << " ";
}

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