답안 #663553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
663553	2022-11-27T02:47:29 Z	Ninja_Kunai	Bootfall (IZhO17_bootfall)	C++14	28 / 100	1000 ms	716 KB

bootfall

/**
*    Author :  Nguyen Tuan Vu
*    Created : 27.11.2022
**/

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define MASK(x) ((1)<<(x))
#define BIT(x, i) (((x)>>(i))&(1))
#define ALL(v)  (v).begin(), (v).end()
#define REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define FORD(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)
#define db(val) "["#val" = "<<(val)<<"] "
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l, int r) {return l + rng() % (r - l + 1);}

void file(){
    #define TASK "TASK"
    if(fopen(TASK".in", "r")) {
        freopen(TASK".in", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
}

const int N = 5e2 + 5;
const int M = 5e2 * 5e2;
int n, a[N], b[N];
bitset <2 * M + 5> dp[2];

bitset <2 * M + 5> calc(int n) {
	dp[0].reset(); dp[1].reset();
	dp[0][M] = 1;
	REP(i, n) {
		if (dp[i & 1].count() == 0) break; 
		dp[(i + 1) & 1] |= dp[i & 1] << b[i + 1];
		dp[(i + 1) & 1] |= dp[i & 1] >> b[i + 1];

		dp[i & 1].reset();
	}

	return dp[n & 1];
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    file();
    cin >> n;
    FOR(i, 1, n) cin >> a[i], b[i] = a[i];
    if (calc(n)[M] == 0) return cout << 0, 0;
    bitset <2 * M + 5> tmp;
    FOR(i, 0, 2 * M) tmp[i] = 1;
    vector <int> ID;
    FOR(i, 1, n) ID.push_back(i);

    if (n <= 200) {
	    FOR(i, 1, n) {
	    	int cnt = 0;
	    	FOR(j, 1, n) if (i != j) b[++cnt] = a[j];
	    	tmp &= calc(n - 1);
	    	if (tmp.count() == 0) break;
	    }    	
    }
    else {
	    FOR(t, 1, n / 2) {
	    	int i = ID[t - 1];
	    	int cnt = 0;
	    	FOR(j, 1, n) if (i != j) b[++cnt] = a[j];
	    	tmp &= calc(n - 1);
	    	if (tmp.count() == 0) break;
	    }
	}

    vector <int> ans;
    FOR(i, 0, 2 * M) if (tmp[i]) ans.push_back(abs(i - M));
    sort (ALL(ans)); ans.erase(unique(ALL(ans)), ans.end());
    cout << ans.size() << '\n';
    for (auto x : ans) cout << x << ' ';
    cerr << "Time elapsed: " << TIME << " s.\n";
    return 0;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Compilation message

bootfall.cpp: In function 'void file()':
bootfall.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen(TASK".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	3 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	7 ms	596 KB	Output is correct
6	Correct	5 ms	596 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	34 ms	596 KB	Output is correct
11	Correct	54 ms	596 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	8 ms	596 KB	Output is correct
14	Correct	32 ms	596 KB	Output is correct
15	Correct	32 ms	688 KB	Output is correct
16	Correct	34 ms	596 KB	Output is correct
17	Correct	17 ms	684 KB	Output is correct
18	Correct	22 ms	596 KB	Output is correct
19	Correct	28 ms	596 KB	Output is correct
20	Correct	36 ms	596 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	3 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	7 ms	596 KB	Output is correct
6	Correct	5 ms	596 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	34 ms	596 KB	Output is correct
11	Correct	54 ms	596 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	8 ms	596 KB	Output is correct
14	Correct	32 ms	596 KB	Output is correct
15	Correct	32 ms	688 KB	Output is correct
16	Correct	34 ms	596 KB	Output is correct
17	Correct	17 ms	684 KB	Output is correct
18	Correct	22 ms	596 KB	Output is correct
19	Correct	28 ms	596 KB	Output is correct
20	Correct	36 ms	596 KB	Output is correct
21	Correct	157 ms	668 KB	Output is correct
22	Correct	196 ms	668 KB	Output is correct
23	Correct	89 ms	672 KB	Output is correct
24	Correct	309 ms	716 KB	Output is correct
25	Correct	311 ms	684 KB	Output is correct
26	Correct	353 ms	716 KB	Output is correct
27	Correct	352 ms	668 KB	Output is correct
28	Correct	366 ms	672 KB	Output is correct
29	Correct	351 ms	676 KB	Output is correct
30	Correct	22 ms	596 KB	Output is correct
31	Correct	458 ms	668 KB	Output is correct
32	Correct	363 ms	716 KB	Output is correct
33	Correct	355 ms	684 KB	Output is correct
34	Correct	354 ms	668 KB	Output is correct
35	Correct	350 ms	668 KB	Output is correct
36	Correct	440 ms	672 KB	Output is correct

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	3 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	7 ms	596 KB	Output is correct
6	Correct	5 ms	596 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	34 ms	596 KB	Output is correct
11	Correct	54 ms	596 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	8 ms	596 KB	Output is correct
14	Correct	32 ms	596 KB	Output is correct
15	Correct	32 ms	688 KB	Output is correct
16	Correct	34 ms	596 KB	Output is correct
17	Correct	17 ms	684 KB	Output is correct
18	Correct	22 ms	596 KB	Output is correct
19	Correct	28 ms	596 KB	Output is correct
20	Correct	36 ms	596 KB	Output is correct
21	Correct	157 ms	668 KB	Output is correct
22	Correct	196 ms	668 KB	Output is correct
23	Correct	89 ms	672 KB	Output is correct
24	Correct	309 ms	716 KB	Output is correct
25	Correct	311 ms	684 KB	Output is correct
26	Correct	353 ms	716 KB	Output is correct
27	Correct	352 ms	668 KB	Output is correct
28	Correct	366 ms	672 KB	Output is correct
29	Correct	351 ms	676 KB	Output is correct
30	Correct	22 ms	596 KB	Output is correct
31	Correct	458 ms	668 KB	Output is correct
32	Correct	363 ms	716 KB	Output is correct
33	Correct	355 ms	684 KB	Output is correct
34	Correct	354 ms	668 KB	Output is correct
35	Correct	350 ms	668 KB	Output is correct
36	Correct	440 ms	672 KB	Output is correct
37	Execution timed out	1095 ms	596 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	3 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	7 ms	596 KB	Output is correct
6	Correct	5 ms	596 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	34 ms	596 KB	Output is correct
11	Correct	54 ms	596 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	8 ms	596 KB	Output is correct
14	Correct	32 ms	596 KB	Output is correct
15	Correct	32 ms	688 KB	Output is correct
16	Correct	34 ms	596 KB	Output is correct
17	Correct	17 ms	684 KB	Output is correct
18	Correct	22 ms	596 KB	Output is correct
19	Correct	28 ms	596 KB	Output is correct
20	Correct	36 ms	596 KB	Output is correct
21	Correct	157 ms	668 KB	Output is correct
22	Correct	196 ms	668 KB	Output is correct
23	Correct	89 ms	672 KB	Output is correct
24	Correct	309 ms	716 KB	Output is correct
25	Correct	311 ms	684 KB	Output is correct
26	Correct	353 ms	716 KB	Output is correct
27	Correct	352 ms	668 KB	Output is correct
28	Correct	366 ms	672 KB	Output is correct
29	Correct	351 ms	676 KB	Output is correct
30	Correct	22 ms	596 KB	Output is correct
31	Correct	458 ms	668 KB	Output is correct
32	Correct	363 ms	716 KB	Output is correct
33	Correct	355 ms	684 KB	Output is correct
34	Correct	354 ms	668 KB	Output is correct
35	Correct	350 ms	668 KB	Output is correct
36	Correct	440 ms	672 KB	Output is correct
37	Execution timed out	1095 ms	596 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	3 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	7 ms	596 KB	Output is correct
6	Correct	5 ms	596 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	34 ms	596 KB	Output is correct
11	Correct	54 ms	596 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	8 ms	596 KB	Output is correct
14	Correct	32 ms	596 KB	Output is correct
15	Correct	32 ms	688 KB	Output is correct
16	Correct	34 ms	596 KB	Output is correct
17	Correct	17 ms	684 KB	Output is correct
18	Correct	22 ms	596 KB	Output is correct
19	Correct	28 ms	596 KB	Output is correct
20	Correct	36 ms	596 KB	Output is correct
21	Correct	157 ms	668 KB	Output is correct
22	Correct	196 ms	668 KB	Output is correct
23	Correct	89 ms	672 KB	Output is correct
24	Correct	309 ms	716 KB	Output is correct
25	Correct	311 ms	684 KB	Output is correct
26	Correct	353 ms	716 KB	Output is correct
27	Correct	352 ms	668 KB	Output is correct
28	Correct	366 ms	672 KB	Output is correct
29	Correct	351 ms	676 KB	Output is correct
30	Correct	22 ms	596 KB	Output is correct
31	Correct	458 ms	668 KB	Output is correct
32	Correct	363 ms	716 KB	Output is correct
33	Correct	355 ms	684 KB	Output is correct
34	Correct	354 ms	668 KB	Output is correct
35	Correct	350 ms	668 KB	Output is correct
36	Correct	440 ms	672 KB	Output is correct
37	Execution timed out	1095 ms	596 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #663553

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.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
15.0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0