이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//stupid solution 1
#include <bits/stdc++.h>
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define forn(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using ld = long double;
const int N = 500 + 7;
const int NN = N * N;
const ll mod = 1e9 + 7;
const ll inf = 2e18;
auto ra = [] {char *p = new char ; delete p ; return ll(p) ; };
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count() * (ra() | 1));
int n;
bitset<NN> eval(vi v)
{
bitset<NN> ret;
ret[0] = 1;
for (auto u : v)
ret = (ret | (ret << u));
return ret;
}
int ret[NN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("in.in", "r", stdin);
cin >> n;
vi a(n), ans;
int sum = 0;
for (auto &u : a)
cin >> u;
sum = accumulate(a.begin(), a.end(), 0);
bitset<NN> bs = eval(a);
if (sum & 1 || !bs[sum / 2])
return cout << 0, 0;
set<int> st;
for (int i = 0; i < n; ++i)
{
int x = a[i];
a[i] = 0;
bitset<NN> bts = eval(a);
int sm = sum - x;
for (int j = 0; j <= sm; ++j)
{
if (bts[j])
{
if (2 * j != sm)
ret[abs(j - (sm - j))]++;
}
}
a[i] = x;
}
int sz = 0;
for (int u = 1; u < NN; ++u)
{
if (ret[u] == 2 * n)
ans.push_back(u);
}
cout << (int)ans.size() << "\n";
for (auto u : ans)
cout << u << " ";
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
bootfall.cpp: In function 'int main()':
bootfall.cpp:78:13: warning: unused variable 'sz' [-Wunused-variable]
78 | int sz = 0;
| ^~
# | 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... |