oj.uz

Submission #86866

# Submission time Handle Problem Language Result Execution time Memory
86866 2018-11-28T05:46:34 Z Scayre Bootfall (IZhO17_bootfall) C++14
0 / 100
 30 ms 24740 KB 
///////////////////////////
//         INFO          //
//                       //
//    Handle -> Scayre   //
//                       //
//   Template vers. 1.1  //
//                       //
//   It'll be accepted   //
//                       //
///////////////////////////
 
//████╗████████╗██╗███████╗══███╗═══███╗████████╗════//
//═██╔╝═══██╔══╝╚█║██╔════╝══████╗═████║██╔═════╝═══//
//═██║════██║════╚╝███████╗══██╔████╔██║█████╗══════//
//═██║════██║══════╚════██║══██║╚██╔╝██║██╔══╝══════//
//████╗═══██║══════███████║══██║═╚═╝═██║███████╗═════//
 
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <complex>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
 
#define ll long long
#define ld long double
#define ull unsigned ll
#define ioi exit(0);
 
#define f first
#define s second
 
#define inf (int)1e9 + 7
 
#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define mp(x,y) make_pair(x,y)
 
#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)
 
#define pb push_back
#define ppb pop_back
 
#define bitcoin __builtin_popcount
 
#define endl "\n"
 
#define in(x) insert(x)
 
#define sz(x) (int)x.size()
 
#define all(x) x.begin(),x.end()
 
#define pw2(x) (1<<x) //2^x
 
#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
 
#define sqr(x) ((x) * 1ll * (x))
 
#define UpdateRandom srand (time(NULL));
 
using namespace std;
 
const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;
 
int n,sum;
 
int cnt[N];
 
bool u[N];
 
int a[N];
 
int dp[N];

int p[N];
 
set<int> s[N];
 
vector<int> v;

int main(){
 
	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif
 
	NFS
 
	cin >> n;
 
	for(int i=1;i<=n;i++){
		cin >> a[i];
		sum+=a[i];
	}

	sort(a+1,a+n+1);
 
	if(sum%2==1){
		cout << 0 << endl;
		ioi
	}
 
	dp[0]=1;
 
	for(int i=1;i<=n;i++){
		for(int j=sum;j>=a[i];j--){
			if(dp[j-a[i]]!=0){
				//cout << j << endl;
				//cout << p[j] << endl;
				if(p[j]==0){
					p[j]=i;
					//cout << p[j] << endl; 
					s[j]=s[j-a[i]];
					s[j].insert(i);
				}
				else{
					p[j]=-1;
					s[j]=s[j-a[i]];
				//	cout << j << ' ' << j-a[i] << ' ' << "GO" << endl;
				//	for(auto it : s[j]){
				//		cout << it << ' ';
				//	}
				//	cout << endl;
				//	for(auto it : s[j-a[i]]){
				//		cout << it << ' ';
				//	}
				//	cout << endl;
				}
				if(j==a[i]){
					dp[j]++;
					break;
				}
				dp[j]+=dp[j-a[i]];
			}
		}
	}

	//ioi	
 
	if(dp[sum/2]==0){
		cout << 0 << endl;
		ioi
	}
 
	for(int k=1;k<=n;k++){
		int x=a[k];
		memset(u,0,sizeof(u));
		sum-=x;
		for(int i=sum;i>=0;i--){
			if(dp[i]!=0 && s[i].count(k)==0){
				if(u[abs(i-(sum-i))]!=1){
					cnt[abs(i-(sum-i))]++;
					//cout << i << ' ' << k << ' ' << endl;
					//for(auto it : s[i]){
					//	cout << it << ' ';
					//}
					//cout << endl;
				}
				u[abs(i-(sum-i))]=1;
			}
		}
		sum+=x;
	}
 
	for(int i=1;i<=sum;i++){
		if(cnt[i]==n){
			v.pb(i);
		}
	}
 
	cout << sz(v) << endl;
 
	for(int i=0;i<sz(v);i++){
		cout << v[i] << ' ';
	}
 
	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif
 
	ioi
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 24312 KB Output is correct
2 Correct 25 ms 24440 KB Output is correct
3 Correct 25 ms 24440 KB Output is correct
4 Correct 24 ms 24576 KB Output is correct
5 Incorrect 30 ms 24740 KB Output isn't correct
6 Halted 0 ms 0 KB -