Submission #507206

#TimeUsernameProblemLanguageResultExecution timeMemory
507206abc864197532Bootfall (IZhO17_bootfall)C++17
0 / 100
0 ms460 KiB
#include <bits/stdc++.h> using namespace std; #define lli long long int #define mp make_pair #define eb emplace_back #define pb push_back #define X first #define Y second #define pii pair<int, int> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() void abc() {cout << endl;} template <typename T, typename ...U> void abc(T i, U ...j) { cout << i << ' ', abc(j...); } template <typename T> void printv(T l, T r) { for (; l != r; ++l) cout << *l << " \n"[l + 1 == r]; } #define test(x...) abc("[" + string(#x) + "]", x); const int N = 500 * 500 + 5; bitset <N> pre[501], suf[501]; int main () { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector <int> a(n); int sum = 0; pre[0].flip(0); for (int i = 0; i < n; ++i) { cin >> a[i]; sum += a[i]; pre[i + 1] = pre[i] << a[i]; } if (sum & 1 || !pre[n][sum >> 1]) { cout << 0 << endl << endl; } else { vector <int> ans(N, 0); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...