oj.uz

답안 #678402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678402 2023-01-05T18:01:19 Z Ahmed57 Bootfall (IZhO17_bootfall) C++17
100 / 100
 514 ms 6136 KB 
/*
        IZhO 17-bootfall

    Do knapsack for the initial n items. We will store count[i] = how many subsets have sum i, mod some big prime.

    When we want to remove 1 item, we have to reverse the knapsack and then revert back to the initial state.

    At the end, we need to check how many differences appear in all of the n removals, and this can be counted with a frequency array.

*/
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
    long long a = rng();
    return a;
}
int n;
int v[502];

int frq[1000002];
bool dp[250002];
int ct[250002], ct2[250002];
int fi[250002];
int lst[250002];
bool canruk(int lack)
{
    int sm = 0;
    for(int i = 1; i <= n; ++i)
        if(i != lack)
            sm += v[i];
    if(lack == 0)
    {
        int mxval = 0;
        dp[0] = 1;
        ct[0] = 1;
        for(int i = 1; i <= n; ++i)
        {
            for(int j = mxval; j >= 0; --j)
                if(dp[j])
                {
                    ct[j + v[i]] = add(ct[j + v[i]], ct[j]);
                    if(!fi[j + v[i]])
                        fi[j + v[i]] = i;
                    lst[j + v[i]] = i;
                    dp[j + v[i]] = 1;
                }
            mxval += v[i];
        }
        if(mxval % 2 == 0 && dp[mxval / 2])
            return 1;
        return 0;
    }
    else
    {
        for(int j = 0; j <= sm + v[lack]; ++j)
            ct2[j] = ct[j];
        for(int j = v[lack]; j <= sm + v[lack]; ++j)
            ct[j] = add(ct[j], -ct[j - v[lack]]);
        for(int i = 0; i <= sm/2; ++i)
            if(ct[i])
                frq[sm - 2 * i]++;
        for(int j = 0; j <= sm + v[lack]; ++j)
            ct[j] = ct2[j];
        return 1;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> v[i];
    sort(v+1, v+n+1);
    if(!canruk(0))
    {
        cout << 0;
        return 0;
    }
    for(int i = 1; i <= n; ++i)
        canruk(i);
    int nrok = 0;
    for(int i = 0; i <= 1000000; ++i)
        if(frq[i] == n)
            ++nrok;
    cout << nrok << '\n';
    for(int i = 0; i <= 1000000; ++i)
        if(frq[i] == n)
            cout << i << " ";
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 4 ms 572 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 3 ms 392 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 4 ms 572 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 3 ms 392 KB Output is correct
37 Correct 18 ms 724 KB Output is correct
38 Correct 22 ms 724 KB Output is correct
39 Correct 32 ms 1516 KB Output is correct
40 Correct 36 ms 1016 KB Output is correct
41 Correct 37 ms 1748 KB Output is correct
42 Correct 30 ms 972 KB Output is correct
43 Correct 58 ms 1608 KB Output is correct
44 Correct 64 ms 1564 KB Output is correct
45 Correct 63 ms 1640 KB Output is correct
46 Correct 27 ms 1004 KB Output is correct
47 Correct 37 ms 1076 KB Output is correct
48 Correct 50 ms 1656 KB Output is correct
49 Correct 40 ms 1628 KB Output is correct
50 Correct 32 ms 1032 KB Output is correct
51 Correct 16 ms 664 KB Output is correct
52 Correct 77 ms 1908 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 4 ms 572 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 3 ms 392 KB Output is correct
37 Correct 18 ms 724 KB Output is correct
38 Correct 22 ms 724 KB Output is correct
39 Correct 32 ms 1516 KB Output is correct
40 Correct 36 ms 1016 KB Output is correct
41 Correct 37 ms 1748 KB Output is correct
42 Correct 30 ms 972 KB Output is correct
43 Correct 58 ms 1608 KB Output is correct
44 Correct 64 ms 1564 KB Output is correct
45 Correct 63 ms 1640 KB Output is correct
46 Correct 27 ms 1004 KB Output is correct
47 Correct 37 ms 1076 KB Output is correct
48 Correct 50 ms 1656 KB Output is correct
49 Correct 40 ms 1628 KB Output is correct
50 Correct 32 ms 1032 KB Output is correct
51 Correct 16 ms 664 KB Output is correct
52 Correct 77 ms 1908 KB Output is correct
53 Correct 55 ms 1356 KB Output is correct
54 Correct 81 ms 1608 KB Output is correct
55 Correct 163 ms 2896 KB Output is correct
56 Correct 73 ms 1640 KB Output is correct
57 Correct 170 ms 3064 KB Output is correct
58 Correct 80 ms 1736 KB Output is correct
59 Correct 117 ms 2048 KB Output is correct
60 Correct 44 ms 1056 KB Output is correct
61 Correct 132 ms 2308 KB Output is correct
62 Correct 151 ms 2520 KB Output is correct
63 Correct 142 ms 2684 KB Output is correct
64 Correct 142 ms 2700 KB Output is correct
65 Correct 32 ms 1236 KB Output is correct
66 Correct 44 ms 1448 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 372 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 5 ms 468 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 4 ms 572 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 4 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Correct 3 ms 392 KB Output is correct
37 Correct 18 ms 724 KB Output is correct
38 Correct 22 ms 724 KB Output is correct
39 Correct 32 ms 1516 KB Output is correct
40 Correct 36 ms 1016 KB Output is correct
41 Correct 37 ms 1748 KB Output is correct
42 Correct 30 ms 972 KB Output is correct
43 Correct 58 ms 1608 KB Output is correct
44 Correct 64 ms 1564 KB Output is correct
45 Correct 63 ms 1640 KB Output is correct
46 Correct 27 ms 1004 KB Output is correct
47 Correct 37 ms 1076 KB Output is correct
48 Correct 50 ms 1656 KB Output is correct
49 Correct 40 ms 1628 KB Output is correct
50 Correct 32 ms 1032 KB Output is correct
51 Correct 16 ms 664 KB Output is correct
52 Correct 77 ms 1908 KB Output is correct
53 Correct 55 ms 1356 KB Output is correct
54 Correct 81 ms 1608 KB Output is correct
55 Correct 163 ms 2896 KB Output is correct
56 Correct 73 ms 1640 KB Output is correct
57 Correct 170 ms 3064 KB Output is correct
58 Correct 80 ms 1736 KB Output is correct
59 Correct 117 ms 2048 KB Output is correct
60 Correct 44 ms 1056 KB Output is correct
61 Correct 132 ms 2308 KB Output is correct
62 Correct 151 ms 2520 KB Output is correct
63 Correct 142 ms 2684 KB Output is correct
64 Correct 142 ms 2700 KB Output is correct
65 Correct 32 ms 1236 KB Output is correct
66 Correct 44 ms 1448 KB Output is correct
67 Correct 123 ms 2116 KB Output is correct
68 Correct 67 ms 1888 KB Output is correct
69 Correct 470 ms 5376 KB Output is correct
70 Correct 253 ms 3340 KB Output is correct
71 Correct 236 ms 3160 KB Output is correct
72 Correct 229 ms 3044 KB Output is correct
73 Correct 225 ms 2900 KB Output is correct
74 Correct 505 ms 5768 KB Output is correct
75 Correct 376 ms 4428 KB Output is correct
76 Correct 463 ms 6136 KB Output is correct
77 Correct 514 ms 5924 KB Output is correct