제출 #1117930

#제출 시각아이디문제언어결과실행 시간메모리
1117930Mher777Bootfall (IZhO17_bootfall)C++17
65 / 100
383 ms4068 KiB
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <iomanip> #include <array> #include <string> #include <algorithm> #include <cmath> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <deque> #include <bitset> #include <list> #include <iterator> #include <numeric> #include <complex> #include <utility> #include <random> #include <cassert> #include <fstream> using namespace std; mt19937 rnd(time(nullptr)); /* -------------------- Typedefs -------------------- */ typedef int itn; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef float fl; typedef long double ld; /* -------------------- Usings -------------------- */ using vi = vector<int>; using vll = vector<ll>; using mii = map<int, int>; using mll = map<ll, ll>; using pii = pair<int, int>; using pll = pair<ll, ll>; /* -------------------- Defines -------------------- */ #define ff first #define ss second #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define mpr make_pair #define yes cout<<"YES\n" #define no cout<<"NO\n" #define all(x) (x).begin(), (x).end() #define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout); /* -------------------- Constants -------------------- */ const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 }; const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const int MAX = int(1e9 + 5); const ll MAXL = ll(1e18) + 5ll; const ll MOD = ll(1000000007); const ll MOD2 = ll(998244353); /* -------------------- Functions -------------------- */ void fastio() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } void precision(int x) { cout.setf(ios::fixed | ios::showpoint); cout.precision(x); } ll gcd(ll a, ll b) { if (a == 0 || b == 0) return(max(a, b)); while (b) { a %= b; swap(a, b); } return a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll range_sum(ll a, ll b) { if (a > b) return 0ll; ll dif = a - 1, cnt = b - a + 1; ll ans = ((b - a + 1) * (b - a + 2)) / 2; ans += ((b - a + 1) * dif); return ans; } string dec_to_bin(ll a) { string s = ""; for (ll i = a; i > 0; ) { ll k = i % 2; i /= 2; char c = k + 48; s += c; } if (a == 0) { s = "0"; } reverse(all(s)); return s; } ll bin_to_dec(string s) { ll num = 0; for (int i = 0; i < s.size(); i++) { num *= 2ll; num += (s[i] - '0'); } return num; } ll factorial_by_mod(ll n, ll mod) { ll ans = 1; ll num; for (ll i = 1; i <= n; ++i) { num = i % mod; ans *= num; ans %= mod; } return ans; } bool isPrime(ll a) { if (a == 1) return false; for (ll i = 2; i * i <= a; i++) { if (a % i == 0) return false; } return true; } ll binpow(ll a, ll b) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; } b >>= 1; a *= a; } return ans; } ll binpow_by_mod(ll a, ll b, ll mod) { if (!a) return 0; ll ans = 1; while (b) { if (b & 1) { ans *= a; ans %= mod; } b >>= 1; a *= a; a %= mod; } return ans; } /* -------------------- Solution -------------------- */ const int N = 250005, M = 505; int a[M], cnt[N]; pii mod = { 727196341, 271915031 }; pii dp[N]; int n, sum; bool check(int x) { return (dp[x].ff != 0 && dp[x].ss != 0); } void add(int x) { for (int i = sum; i >= x; --i) { dp[i].ff += dp[i - x].ff; dp[i].ss += dp[i - x].ss; if (dp[i].ff >= mod.ff) dp[i].ff -= mod.ff; if (dp[i].ss >= mod.ss) dp[i].ss -= mod.ss; } } void del(int x) { for (int i = x; i <= sum; ++i) { dp[i].ff -= dp[i - x].ff; dp[i].ss -= dp[i - x].ss; if (dp[i].ff < 0) dp[i].ff += mod.ff; if (dp[i].ss < 0) dp[i].ss += mod.ss; } } void slv() { dp[0].ff = dp[0].ss = 1; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; sum += a[i]; add(a[i]); } if (sum % 2 == 1 || !check(sum / 2)) { cout << 0 << '\n'; return; } for (int i = 1; i <= n; ++i) { del(a[i]); sum -= a[i]; for (int x = 0; x * 2 <= sum; ++x) { if (check(x)) { ++cnt[sum - x * 2]; } } sum += a[i]; add(a[i]); } vi ans; for (int i = 1; i <= sum; ++i) { if (cnt[i] == n) { ans.pub(i); } } cout << (int)ans.size() << '\n'; for (auto elem : ans) { cout << elem << " "; } } void cs() { int tstc = 1; //cin >> tstc; while (tstc--) { slv(); } } void precalc() { return; } int main() { fastio(); precalc(); //precision(0); cs(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

bootfall.cpp: In function 'll range_sum(ll, ll)':
bootfall.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
bootfall.cpp: In function 'll bin_to_dec(std::string)':
bootfall.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
#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...