Submission #893607

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
893607	2023-12-27T07:26:19 Z	vjudge1	Toys (CEOI18_toy)	C++17	19 / 100	38 ms	2392 KB

#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 4e3 + 2;
const int M = 7e6 + 1;
int mod = 1e9+7;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod;
}

int sum(int a, int b) {
    a %= mod; 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}

vector<int> ds;
map<int, int> mp;
set<int> st;

void getans(int n, int cs = 0, int mx = 0){
    if(cs + n - 1 <= 5e3)
        return;
    if(n == 1){
        st.insert(cs);
        return;
    }
    for(auto d : ds){
        if(n % d == 0 && d >= mx)
            getans(n / d, cs + d - 1, d);
    }
}

void solve(){
    int n;
    cin >> n;
    if(n == 1){
        cout << 1 << '\n' << 0 << '\n';
        return;
    }
    for(int i = 2; i * i <= n; i++){
        if(n % i)
            continue;
        ds.pb(i);
        if(i * i != n)
            ds.pb(n / i);
    }
    ds.pb(n);
    getans(n);
    ds.pb(1);
    sort(all(ds));
    for(int i = 0; i < sz(ds); i++)
        mp[ds[i]] = i;
    int dp[sz(ds)][N];
    memset(dp, 0, sizeof dp);
    dp[0][0] = 1;
    for(int i = 1; i < sz(ds); i++){
        int x = ds[i];
        vector<int> da = {};
        for(auto d : ds)
            if(x % d == 0)
                da.pb(d);
        for(int s = 0; s < N; s++){
            for(auto d : da){
                if(s - d + 1 < 0)
                    continue;
                dp[i][s] |= dp[mp[x / d]][s - d + 1];
            }
        }
    }
    for(int i = 0; i < N; i++)
        if(dp[sz(ds) - 1][i])
            st.insert(i);
    cout << sz(st) << '\n';
    for(auto e : st)
        cout << e << ' ';
    cout << '\n';
}   

signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	1 ms	604 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct

Subtask #2
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	1 ms	604 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	38 ms	2392 KB	Output is correct
27	Correct	28 ms	2140 KB	Output is correct
28	Correct	18 ms	1884 KB	Output is correct
29	Correct	13 ms	1628 KB	Output is correct
30	Correct	10 ms	1576 KB	Output is correct
31	Incorrect	29 ms	2220 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	1 ms	604 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	38 ms	2392 KB	Output is correct
27	Correct	28 ms	2140 KB	Output is correct
28	Correct	18 ms	1884 KB	Output is correct
29	Correct	13 ms	1628 KB	Output is correct
30	Correct	10 ms	1576 KB	Output is correct
31	Incorrect	29 ms	2220 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	1 ms	604 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	38 ms	2392 KB	Output is correct
27	Correct	28 ms	2140 KB	Output is correct
28	Correct	18 ms	1884 KB	Output is correct
29	Correct	13 ms	1628 KB	Output is correct
30	Correct	10 ms	1576 KB	Output is correct
31	Incorrect	29 ms	2220 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	1 ms	604 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	38 ms	2392 KB	Output is correct
27	Correct	28 ms	2140 KB	Output is correct
28	Correct	18 ms	1884 KB	Output is correct
29	Correct	13 ms	1628 KB	Output is correct
30	Correct	10 ms	1576 KB	Output is correct
31	Incorrect	29 ms	2220 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Submission #893607

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 0 / 20.0

Subtask #3 0 / 20.0

Subtask #4 0 / 20.0

Subtask #5 0 / 21.0

Subtask #1
19.0 / 19.0

Subtask #2
0 / 20.0

Subtask #3
0 / 20.0

Subtask #4
0 / 20.0

Subtask #5
0 / 21.0