oj.uz

Submission #538478

# Submission time Handle Problem Language Result Execution time Memory
538478 2022-03-17T02:45:08 Z kym Kpart (eJOI21_kpart) C++14
0 / 100
 2000 ms 3660 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;
int Q;
bitset<100005> dp[1005];
const int OFFSET = 50000;
void solve(){ 
	int n; cin >> n;
	int A[n+5];
	FOR(i,1,n) cin >>A[i];
	int cnt[n+5]; memset(cnt,0,sizeof cnt);
	FOR(i,1,n) { // start of range
		if(OFFSET+A[i]<=100000)dp[i][OFFSET+A[i]] = 1;
		if(OFFSET-A[i]>=0)dp[i][OFFSET-A[i]] = 1;
		cnt[1]=1;
		FOR(j,i+1,n) { // end of range 
			dp[j] = ((dp[j-1] << A[j]) | (dp[j-1] >> A[j]));
			if(!dp[j][OFFSET]){
				cnt[j-i+1] = 1;
			}
		}
		
	}
	
	int cc = 0;
	FOR(i,1,n) {
		if(cnt[i] == 0)++cc;
	}
	cout << cc << ' ';
	FOR(i,1,n) {
		if(cnt[i] == 0) cout << i << ' ';
	}
	cout << '\n';
}

int32_t main() 
{
	IAMSPEED
	cin >> Q;
	while(Q--)solve();
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 186 ms 1156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2089 ms 3660 KB Time limit exceeded
2 Halted 0 ms 0 KB -