답안 #38504 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38504	2018-01-04T10:24:26 Z	grumpy_gordon	Bootfall (IZhO17_bootfall)	C++14	13 / 100	6 ms	17808 KB

bootfall

/*
                     .:*+=%@@@@@@=-.
                 .:=@#@@@#@@#######%==*.
              .-=####@######%*-.....:%##%.
            .*@###########%+:--........-%@-
          .*@##############@+--.........-:%-
        .+##################@==%%%%=+*:----+.
      .-@####################%++%@@@@@=+**%@@*
      .%###################@%%@@@###@%+:--%@@%.
     -@###################@%%%%*::*%++:-----=@+.
    -#####################@%=++++++*:-------.-=:
   .+####################@%++*::-:::--::*:::***=:
   .@#####################%=++*::::-:::++*=##@@#@-
  ..#####################@%%=++**:::::**+%@#@%%##-..
   .%####################@@%=+++*+****::*=@######@.
  .=######################@%%==+==++**+=@%@##@###+:...
  -#######################@@@%%%===++=@@@%=++===*::--...
  -########################@@@@@@@%==%%=++==@@:::::*:--.
..:#########################@@@@@@%%======++++::-..:-.--...
%#############################@###@%%@@%==%=%*----.--.::---.
#############################################*-:*:-:---*---- .
#############################################*--*--:---*---:-.
#############################################+--::--::-*::-::.
###########################################+:*-.---.---.:---*-..
###########################################**:-----------------.
##########################################@::**:--::::::--:::::-
###########################################:--:*:::::::::**::*+*
###########################################=:::***::::::**:::*+*
############################@@@@@@#########@+****::::********+++
############################@%%%%%@@@@@@@###%+***::::::::***+==+
############################@%%%%%%%%%%%@####=+:::-::::-::*+=%%+
#############################@%%%%%%%%%%@#####=::--------:*=%@%+
%###########################@%%%%==%%%%%%@##@#=:------..-:+%@@%=
----------------------------------------------
--------------------------------------------
----------------------------------------------
--------------------------------------------
----------------------------------------------

         o###########oo
      o##"          ""##o
    o#"                "##
  o#"                    "#o
 #"  ##              ##   "##
#"                          ##
#  ###################       #
#                            #
#                            #
#                            #
#                            #
#                            #
#                            #
#o                           #
"#o                         ##
 "#o                       ##
  "#o                    o#"
   "#o                  ##
     "#o              o#"
       "#ooo      ooo#######oo
        ###############   "######o
     o###""        "###o      # ###
   o###o     oooo    ###    oo####"
 o###**#     #**#   ############"
 ""##""""""""""###########    #
    # oooooooo#"#**     ##    #
    # #       # # **    ##    #
    #o#       #o#  *****###ooo#
                        ##
                        ##   o###o
                        ## o##***##
               o########## #***#**##o
             o##"   ""###  #***##***#
 o#######o  ###   oo####   ##**####*#
o##"  ""#############""     ##****###
##"         ##              ##*##*###
##          ###              ##### ##
##           ###              # ##  #
##            ##                 #
##             ##
##             ###
##              ###oo
###              ""###
 ###
  ###
*/
#include <bits/stdc++.h>

//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

typedef long double ld;

int mysqrt(ll x){
    int l = 0, r = 1e9 + 1;
    while (r - l > 1){
        int m = (l + r) / 2;
        if (m * (ll)m <= x)
            l = m;
        else
            r = m;
    }
    return l;
}

mt19937 rnd(1337);

ll AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;

ll myrand(){
    ll ZR = (XR * AR + YR * BR + CR) % MODR;
    XR = YR;
    YR = ZR;
    return ZR;
}

const int Mod = 1e9 + 7;

int bpow(int x, int y){
    if (y == 0)
        return 1;
    if (y == 1)
        return x;
    int ret = bpow(x, y >> 1);
    ret = (ret * (ll)ret) % Mod;
    if (y & 1)
        ret = (ret * (ll)x) % Mod;
    return ret;
}

int bdiv(int x, int y){
    return (x * (ll)bpow(y, Mod - 2)) % Mod;
}

void setmin(int &x, int y){
    x = min(x, y);
}

void setmax(int &x, int y){
    x = max(x, y);
}

const ll llinf = 1e18 + 100;

const int maxn = 1e5 + 100, inf = 2e9 + 100, sq = 2000, mod = 1e9 + 7, LG = 17;

ull q[500 * 500 + 1][8];

int n, a[500];

int main()
{
    #ifdef ONPC
    //ifstream cin("a.in");
    //ofstream cout("a.out");
    freopen("a.in", "r", stdin);
    freopen("a.out", "w", stdout);
    #else
    //ifstream cin("bootfall.in");
    //ofstream cout("bootfall.out");
    //freopen("trap.in", "r", stdin);
    //freopen("trap.out", "w", stdout);
    #endif // ONPC
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++)
        q[0][i >> 6] |= (1ll << (i & 63));
    int W = 0;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        W += a[i];
    }
    for (int i = 1; i < n; i++)
    if ((a[i] & 1) != (a[0] & 1)){
        cout << 0 << '\n';
        return 0;
    }
    for (int i = 0; i < n; i++){
        for (int j = W; j >= a[i]; j--){
            bool z = q[j][i >> 6] & (1ll << (i & 63));
            for (int k = 0; k < 8; k++)
                q[j][k] |= q[j - a[i]][k];
            if (!z && (q[j][i >> 6] & (1ll << (i & 63))))
                q[j][i >> 6] ^= (1ll << (i & 63));
        }
    }
    if (W & 1){
        cout << 0;
        return 0;
    }
    int ss = 0;
    for (int i = 0; i < 8; i++)
    if (q[W / 2][i]){
        ss = 1;
        break;
    }
    if (!ss){
        cout << 0 << '\n';
        return 0;
    }
    vector<int> ans;
    for (int k = 1; k <= W; k++)
    if ((k & 1) == (a[0] & 1)){
        bool is = 1;
        for (int i = 0; i < n && is; i++)
            if (((W + k - a[i]) / 2 > W || !(q[(W + k - a[i]) / 2][i >> 6] & (1ll << (i & 63)))) && (W - k - a[i] < 0 || !(q[(W - k - a[i]) / 2][i >> 6] & (1ll << (i & 63)))))
                is = 0;
        if (is)
            ans.push_back(k);
    }
    cout << ans.size() << '\n';
    for (auto i : ans)
        cout << i << ' ';
}

Subtask #1
6.0 / 6.0

#	결과	메모리	Grader output
1	Correct	17808 KB	Output is correct
2	Correct	17808 KB	Output is correct
3	Correct	17808 KB	Output is correct
4	Correct	17808 KB	Output is correct
5	Correct	17808 KB	Output is correct
6	Correct	17808 KB	Output is correct
7	Correct	17808 KB	Output is correct
8	Correct	17808 KB	Output is correct
9	Correct	17808 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	메모리	Grader output
1	Correct	17808 KB	Output is correct
2	Correct	17808 KB	Output is correct
3	Correct	17808 KB	Output is correct
4	Correct	17808 KB	Output is correct
5	Correct	17808 KB	Output is correct
6	Correct	17808 KB	Output is correct
7	Correct	17808 KB	Output is correct
8	Correct	17808 KB	Output is correct
9	Correct	17808 KB	Output is correct
10	Correct	17808 KB	Output is correct
11	Correct	17808 KB	Output is correct
12	Correct	17808 KB	Output is correct
13	Correct	17808 KB	Output is correct
14	Correct	17808 KB	Output is correct
15	Correct	17808 KB	Output is correct
16	Correct	17808 KB	Output is correct
17	Correct	17808 KB	Output is correct
18	Correct	17808 KB	Output is correct
19	Correct	17808 KB	Output is correct
20	Correct	17808 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	17808 KB	Output is correct
2	Correct	0 ms	17808 KB	Output is correct
3	Correct	0 ms	17808 KB	Output is correct
4	Correct	0 ms	17808 KB	Output is correct
5	Correct	0 ms	17808 KB	Output is correct
6	Correct	0 ms	17808 KB	Output is correct
7	Correct	0 ms	17808 KB	Output is correct
8	Correct	0 ms	17808 KB	Output is correct
9	Correct	0 ms	17808 KB	Output is correct
10	Correct	0 ms	17808 KB	Output is correct
11	Correct	0 ms	17808 KB	Output is correct
12	Correct	0 ms	17808 KB	Output is correct
13	Correct	0 ms	17808 KB	Output is correct
14	Correct	0 ms	17808 KB	Output is correct
15	Correct	0 ms	17808 KB	Output is correct
16	Correct	0 ms	17808 KB	Output is correct
17	Correct	0 ms	17808 KB	Output is correct
18	Correct	0 ms	17808 KB	Output is correct
19	Correct	0 ms	17808 KB	Output is correct
20	Correct	0 ms	17808 KB	Output is correct
21	Correct	3 ms	17808 KB	Output is correct
22	Correct	3 ms	17808 KB	Output is correct
23	Correct	0 ms	17808 KB	Output is correct
24	Runtime error	6 ms	17808 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	17808 KB	Output is correct
2	Correct	0 ms	17808 KB	Output is correct
3	Correct	0 ms	17808 KB	Output is correct
4	Correct	0 ms	17808 KB	Output is correct
5	Correct	0 ms	17808 KB	Output is correct
6	Correct	0 ms	17808 KB	Output is correct
7	Correct	0 ms	17808 KB	Output is correct
8	Correct	0 ms	17808 KB	Output is correct
9	Correct	0 ms	17808 KB	Output is correct
10	Correct	0 ms	17808 KB	Output is correct
11	Correct	0 ms	17808 KB	Output is correct
12	Correct	0 ms	17808 KB	Output is correct
13	Correct	0 ms	17808 KB	Output is correct
14	Correct	0 ms	17808 KB	Output is correct
15	Correct	0 ms	17808 KB	Output is correct
16	Correct	0 ms	17808 KB	Output is correct
17	Correct	0 ms	17808 KB	Output is correct
18	Correct	0 ms	17808 KB	Output is correct
19	Correct	0 ms	17808 KB	Output is correct
20	Correct	0 ms	17808 KB	Output is correct
21	Correct	3 ms	17808 KB	Output is correct
22	Correct	3 ms	17808 KB	Output is correct
23	Correct	0 ms	17808 KB	Output is correct
24	Runtime error	6 ms	17808 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	17808 KB	Output is correct
2	Correct	0 ms	17808 KB	Output is correct
3	Correct	0 ms	17808 KB	Output is correct
4	Correct	0 ms	17808 KB	Output is correct
5	Correct	0 ms	17808 KB	Output is correct
6	Correct	0 ms	17808 KB	Output is correct
7	Correct	0 ms	17808 KB	Output is correct
8	Correct	0 ms	17808 KB	Output is correct
9	Correct	0 ms	17808 KB	Output is correct
10	Correct	0 ms	17808 KB	Output is correct
11	Correct	0 ms	17808 KB	Output is correct
12	Correct	0 ms	17808 KB	Output is correct
13	Correct	0 ms	17808 KB	Output is correct
14	Correct	0 ms	17808 KB	Output is correct
15	Correct	0 ms	17808 KB	Output is correct
16	Correct	0 ms	17808 KB	Output is correct
17	Correct	0 ms	17808 KB	Output is correct
18	Correct	0 ms	17808 KB	Output is correct
19	Correct	0 ms	17808 KB	Output is correct
20	Correct	0 ms	17808 KB	Output is correct
21	Correct	3 ms	17808 KB	Output is correct
22	Correct	3 ms	17808 KB	Output is correct
23	Correct	0 ms	17808 KB	Output is correct
24	Runtime error	6 ms	17808 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	17808 KB	Output is correct
2	Correct	0 ms	17808 KB	Output is correct
3	Correct	0 ms	17808 KB	Output is correct
4	Correct	0 ms	17808 KB	Output is correct
5	Correct	0 ms	17808 KB	Output is correct
6	Correct	0 ms	17808 KB	Output is correct
7	Correct	0 ms	17808 KB	Output is correct
8	Correct	0 ms	17808 KB	Output is correct
9	Correct	0 ms	17808 KB	Output is correct
10	Correct	0 ms	17808 KB	Output is correct
11	Correct	0 ms	17808 KB	Output is correct
12	Correct	0 ms	17808 KB	Output is correct
13	Correct	0 ms	17808 KB	Output is correct
14	Correct	0 ms	17808 KB	Output is correct
15	Correct	0 ms	17808 KB	Output is correct
16	Correct	0 ms	17808 KB	Output is correct
17	Correct	0 ms	17808 KB	Output is correct
18	Correct	0 ms	17808 KB	Output is correct
19	Correct	0 ms	17808 KB	Output is correct
20	Correct	0 ms	17808 KB	Output is correct
21	Correct	3 ms	17808 KB	Output is correct
22	Correct	3 ms	17808 KB	Output is correct
23	Correct	0 ms	17808 KB	Output is correct
24	Runtime error	6 ms	17808 KB	Execution killed because of forbidden syscall writev (20)
25	Halted	0 ms	0 KB	-

답안 #38504

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 15.0

Subtask #4 0 / 16.0

Subtask #5 0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0