This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
static struct FastInput
{
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t chars_read = 0;
size_t buf_pos = 0;
FILE *in = stdin;
char cur = 0;
inline char get_char()
{
if (buf_pos >= chars_read)
{
chars_read = fread(buf, 1, BUF_SIZE, in);
buf_pos = 0;
buf[0] = (chars_read == 0 ? -1 : buf[0]);
}
return cur = buf[buf_pos++];
}
inline void tie(int) {}
inline explicit operator bool()
{
return cur != -1;
}
inline static bool is_blank(char c)
{
return c <= ' ';
}
inline bool skip_blanks()
{
while (is_blank(cur) && cur != -1)
{
get_char();
}
return cur != -1;
}
inline FastInput &operator>>(char &c)
{
skip_blanks();
c = cur;
return *this;
}
inline FastInput &operator>>(string &s)
{
if (skip_blanks())
{
s.clear();
do
{
s += cur;
} while (!is_blank(get_char()));
}
return *this;
}
template <typename T>
inline FastInput &read_integer(T &n)
{
// unsafe, doesn't check that characters are actually digits
n = 0;
if (skip_blanks())
{
int sign = +1;
if (cur == '-')
{
sign = -1;
get_char();
}
do
{
n += n + (n << 3) + cur - '0';
} while (!is_blank(get_char()));
n *= sign;
}
return *this;
}
template <typename T>
inline typename enable_if<is_integral<T>::value, FastInput &>::type operator>>(T &n)
{
return read_integer(n);
}
#if !defined(_WIN32) || defined(_WIN64)
inline FastInput &operator>>(__int128 &n)
{
return read_integer(n);
}
#endif
template <typename T>
inline typename enable_if<is_floating_point<T>::value, FastInput &>::type operator>>(T &n)
{
// not sure if really fast, for compatibility only
n = 0;
if (skip_blanks())
{
string s;
(*this) >> s;
sscanf(s.c_str(), "%lf", &n);
}
return *this;
}
} fast_input;
#define cin fast_input
static struct FastOutput
{
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t buf_pos = 0;
static constexpr int TMP_SIZE = 1 << 20;
char tmp[TMP_SIZE];
FILE *out = stdout;
inline void put_char(char c)
{
buf[buf_pos++] = c;
if (buf_pos == BUF_SIZE)
{
fwrite(buf, 1, buf_pos, out);
buf_pos = 0;
}
}
~FastOutput()
{
fwrite(buf, 1, buf_pos, out);
}
inline FastOutput &operator<<(char c)
{
put_char(c);
return *this;
}
inline FastOutput &operator<<(const char *s)
{
while (*s)
{
put_char(*s++);
}
return *this;
}
inline FastOutput &operator<<(const string &s)
{
for (int i = 0; i < (int)s.size(); i++)
{
put_char(s[i]);
}
return *this;
}
template <typename T>
inline char *integer_to_string(T n)
{
// beware of TMP_SIZE
char *p = tmp + TMP_SIZE - 1;
if (n == 0)
{
*--p = '0';
}
else
{
bool is_negative = false;
if (n < 0)
{
is_negative = true;
n = -n;
}
while (n > 0)
{
*--p = (char)('0' + n % 10);
n /= 10;
}
if (is_negative)
{
*--p = '-';
}
}
return p;
}
template <typename T>
inline typename enable_if<is_integral<T>::value, char *>::type stringify(T n)
{
return integer_to_string(n);
}
#if !defined(_WIN32) || defined(_WIN64)
inline char *stringify(__int128 n)
{
return integer_to_string(n);
}
#endif
template <typename T>
inline typename enable_if<is_floating_point<T>::value, char *>::type stringify(T n)
{
sprintf(tmp, "%.17f", n);
return tmp;
}
template <typename T>
inline FastOutput &operator<<(const T &n)
{
auto p = stringify(n);
for (; *p != 0; p++)
{
put_char(*p);
}
return *this;
}
} fast_output;
#define cout fast_output
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if(x < 0) x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if(x < 0) x += mod;
}
const int nn = 250001;
int n,a[maxn];
bitset<nn> f,ans[502];
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
fo(i,1,n) cin >> a[i];
int tot = 0;
f[0] = 1;
fo(i,1,n)
{
f |= f << a[i];
tot += a[i];
}
if(tot % 2 == 1 or f[tot / 2] == 0) return cout << 0,0;
fo(j,1,tot) ans[n + 1][j] = 1;
fo(i,1,n)
{
fo(j,1,tot)
{
f = 0;
f[0] = 1;
a[n + 1] = j;
fo(k,1,n + 1) if(k != i)
{
f |= f << a[k];
}
int tot1 = tot - a[i] + a[n + 1];
if(tot1 % 2 == 0 and f[tot1 / 2] == 1) ans[i][j] = 1;
}
ans[n + 1] &= ans[i];
}
cout << ans[n + 1].count();en;
fo(j,1,tot) if(ans[n + 1][j]) cout << j << ' ';
}
Compilation message (stderr)
bootfall.cpp:282:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
282 | main()
| ^~~~
bootfall.cpp: In function 'int main()':
bootfall.cpp:291:13: warning: passing NULL to non-pointer argument 1 of 'void FastInput::tie(int)' [-Wconversion-null]
291 | cin.tie(NULL);
| ^~~~
bootfall.cpp:61:21: note: declared here
61 | inline void tie(int) {}
| ^~~
bootfall.cpp:287:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
287 | freopen(name ".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:288:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
288 | freopen(name ".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |