oj.uz

답안 #556150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556150 2022-05-02T13:48:06 Z kym Bootfall (IZhO17_bootfall) C++14
28 / 100
 1000 ms 636 KB 
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = -1;
bitset<500005> D1[505];
bitset<500005> D2[505];
const int BUFFER=250001;
int n;
int A[505];
bitset<500005> res;

int32_t main() 
{
	IAMSPEED
	cin >> n;
	FOR(i,1,n) cin >> A[i];
	res.reset();
	res.flip();
	FOR(i,1,n+1) {
		bitset<500005> bs;
		bs[BUFFER]=1;
		FOR(j,1,n) {
			if(i==j)continue;
			bs=(bs>>A[j]) | (bs<<A[j]);
		}
		if(i==n+1) {
			if(bs[BUFFER]==0){
				return cout << 0, 0;
			} else {
				break;
			}
		} 
		res &= bs;
	}
	
	int cnt = 0;

	FOR(i,BUFFER+1,500004)if(res[i]){
		++cnt;
		//cout<<i-BUFFER<<' ';
	}
	cout << cnt << '\n';
	FOR(i,BUFFER+1,500004)if(res[i]){
		cout<<i-BUFFER<<' ';
	}
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 3 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 6 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 25 ms 572 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 20 ms 596 KB Output is correct
14 Correct 24 ms 596 KB Output is correct
15 Correct 32 ms 596 KB Output is correct
16 Correct 27 ms 620 KB Output is correct
17 Correct 10 ms 636 KB Output is correct
18 Correct 16 ms 572 KB Output is correct
19 Correct 19 ms 572 KB Output is correct
20 Correct 25 ms 624 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 3 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 6 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 25 ms 572 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 20 ms 596 KB Output is correct
14 Correct 24 ms 596 KB Output is correct
15 Correct 32 ms 596 KB Output is correct
16 Correct 27 ms 620 KB Output is correct
17 Correct 10 ms 636 KB Output is correct
18 Correct 16 ms 572 KB Output is correct
19 Correct 19 ms 572 KB Output is correct
20 Correct 25 ms 624 KB Output is correct
21 Correct 118 ms 616 KB Output is correct
22 Correct 161 ms 616 KB Output is correct
23 Correct 81 ms 620 KB Output is correct
24 Correct 237 ms 616 KB Output is correct
25 Correct 239 ms 628 KB Output is correct
26 Correct 284 ms 616 KB Output is correct
27 Correct 283 ms 620 KB Output is correct
28 Correct 265 ms 620 KB Output is correct
29 Correct 270 ms 620 KB Output is correct
30 Correct 262 ms 620 KB Output is correct
31 Correct 274 ms 620 KB Output is correct
32 Correct 313 ms 620 KB Output is correct
33 Correct 262 ms 596 KB Output is correct
34 Correct 296 ms 620 KB Output is correct
35 Correct 271 ms 624 KB Output is correct
36 Correct 267 ms 620 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 3 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 6 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 25 ms 572 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 20 ms 596 KB Output is correct
14 Correct 24 ms 596 KB Output is correct
15 Correct 32 ms 596 KB Output is correct
16 Correct 27 ms 620 KB Output is correct
17 Correct 10 ms 636 KB Output is correct
18 Correct 16 ms 572 KB Output is correct
19 Correct 19 ms 572 KB Output is correct
20 Correct 25 ms 624 KB Output is correct
21 Correct 118 ms 616 KB Output is correct
22 Correct 161 ms 616 KB Output is correct
23 Correct 81 ms 620 KB Output is correct
24 Correct 237 ms 616 KB Output is correct
25 Correct 239 ms 628 KB Output is correct
26 Correct 284 ms 616 KB Output is correct
27 Correct 283 ms 620 KB Output is correct
28 Correct 265 ms 620 KB Output is correct
29 Correct 270 ms 620 KB Output is correct
30 Correct 262 ms 620 KB Output is correct
31 Correct 274 ms 620 KB Output is correct
32 Correct 313 ms 620 KB Output is correct
33 Correct 262 ms 596 KB Output is correct
34 Correct 296 ms 620 KB Output is correct
35 Correct 271 ms 624 KB Output is correct
36 Correct 267 ms 620 KB Output is correct
37 Execution timed out 1049 ms 616 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 3 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 6 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 25 ms 572 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 20 ms 596 KB Output is correct
14 Correct 24 ms 596 KB Output is correct
15 Correct 32 ms 596 KB Output is correct
16 Correct 27 ms 620 KB Output is correct
17 Correct 10 ms 636 KB Output is correct
18 Correct 16 ms 572 KB Output is correct
19 Correct 19 ms 572 KB Output is correct
20 Correct 25 ms 624 KB Output is correct
21 Correct 118 ms 616 KB Output is correct
22 Correct 161 ms 616 KB Output is correct
23 Correct 81 ms 620 KB Output is correct
24 Correct 237 ms 616 KB Output is correct
25 Correct 239 ms 628 KB Output is correct
26 Correct 284 ms 616 KB Output is correct
27 Correct 283 ms 620 KB Output is correct
28 Correct 265 ms 620 KB Output is correct
29 Correct 270 ms 620 KB Output is correct
30 Correct 262 ms 620 KB Output is correct
31 Correct 274 ms 620 KB Output is correct
32 Correct 313 ms 620 KB Output is correct
33 Correct 262 ms 596 KB Output is correct
34 Correct 296 ms 620 KB Output is correct
35 Correct 271 ms 624 KB Output is correct
36 Correct 267 ms 620 KB Output is correct
37 Execution timed out 1049 ms 616 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 3 ms 584 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 6 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 25 ms 596 KB Output is correct
11 Correct 25 ms 572 KB Output is correct
12 Correct 25 ms 596 KB Output is correct
13 Correct 20 ms 596 KB Output is correct
14 Correct 24 ms 596 KB Output is correct
15 Correct 32 ms 596 KB Output is correct
16 Correct 27 ms 620 KB Output is correct
17 Correct 10 ms 636 KB Output is correct
18 Correct 16 ms 572 KB Output is correct
19 Correct 19 ms 572 KB Output is correct
20 Correct 25 ms 624 KB Output is correct
21 Correct 118 ms 616 KB Output is correct
22 Correct 161 ms 616 KB Output is correct
23 Correct 81 ms 620 KB Output is correct
24 Correct 237 ms 616 KB Output is correct
25 Correct 239 ms 628 KB Output is correct
26 Correct 284 ms 616 KB Output is correct
27 Correct 283 ms 620 KB Output is correct
28 Correct 265 ms 620 KB Output is correct
29 Correct 270 ms 620 KB Output is correct
30 Correct 262 ms 620 KB Output is correct
31 Correct 274 ms 620 KB Output is correct
32 Correct 313 ms 620 KB Output is correct
33 Correct 262 ms 596 KB Output is correct
34 Correct 296 ms 620 KB Output is correct
35 Correct 271 ms 624 KB Output is correct
36 Correct 267 ms 620 KB Output is correct
37 Execution timed out 1049 ms 616 KB Time limit exceeded
38 Halted 0 ms 0 KB -