oj.uz

답안 #1117939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1117939 2024-11-24T10:40:07 Z Mher777 Bootfall (IZhO17_bootfall) C++17
100 / 100
 786 ms 4524 KB 
#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 M = 505;
int a[M], cnt[M * M];
pii mod = { MOD, MOD2 };
pii dp[M * M];
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].ff - dp[i - x].ff + mod.ff) % mod.ff;
        dp[i].ss = (dp[i].ss - dp[i - x].ss + mod.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 < M * M; ++i) {
        if (cnt[i] == n) {
            ans.pub(i);
        }
    }
    cout << (int)ans.size() << '\n';
    for (auto elem : ans) {
        cout << elem << " ";
    }
    cout << '\n';
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

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++) {
      |                     ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2552 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2552 KB Output is correct
21 Correct 3 ms 2384 KB Output is correct
22 Correct 3 ms 2384 KB Output is correct
23 Correct 2 ms 2384 KB Output is correct
24 Correct 5 ms 2384 KB Output is correct
25 Correct 7 ms 2640 KB Output is correct
26 Correct 8 ms 2640 KB Output is correct
27 Correct 7 ms 2384 KB Output is correct
28 Correct 7 ms 2384 KB Output is correct
29 Correct 9 ms 2384 KB Output is correct
30 Correct 5 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 4 ms 2384 KB Output is correct
33 Correct 7 ms 2600 KB Output is correct
34 Correct 7 ms 2384 KB Output is correct
35 Correct 7 ms 2384 KB Output is correct
36 Correct 4 ms 2384 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2552 KB Output is correct
21 Correct 3 ms 2384 KB Output is correct
22 Correct 3 ms 2384 KB Output is correct
23 Correct 2 ms 2384 KB Output is correct
24 Correct 5 ms 2384 KB Output is correct
25 Correct 7 ms 2640 KB Output is correct
26 Correct 8 ms 2640 KB Output is correct
27 Correct 7 ms 2384 KB Output is correct
28 Correct 7 ms 2384 KB Output is correct
29 Correct 9 ms 2384 KB Output is correct
30 Correct 5 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 4 ms 2384 KB Output is correct
33 Correct 7 ms 2600 KB Output is correct
34 Correct 7 ms 2384 KB Output is correct
35 Correct 7 ms 2384 KB Output is correct
36 Correct 4 ms 2384 KB Output is correct
37 Correct 28 ms 2640 KB Output is correct
38 Correct 27 ms 2640 KB Output is correct
39 Correct 99 ms 1184 KB Output is correct
40 Correct 57 ms 852 KB Output is correct
41 Correct 126 ms 1104 KB Output is correct
42 Correct 54 ms 828 KB Output is correct
43 Correct 87 ms 1368 KB Output is correct
44 Correct 90 ms 1352 KB Output is correct
45 Correct 91 ms 1404 KB Output is correct
46 Correct 54 ms 604 KB Output is correct
47 Correct 55 ms 848 KB Output is correct
48 Correct 101 ms 1364 KB Output is correct
49 Correct 98 ms 1104 KB Output is correct
50 Correct 55 ms 848 KB Output is correct
51 Correct 7 ms 592 KB Output is correct
52 Correct 125 ms 1608 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2552 KB Output is correct
21 Correct 3 ms 2384 KB Output is correct
22 Correct 3 ms 2384 KB Output is correct
23 Correct 2 ms 2384 KB Output is correct
24 Correct 5 ms 2384 KB Output is correct
25 Correct 7 ms 2640 KB Output is correct
26 Correct 8 ms 2640 KB Output is correct
27 Correct 7 ms 2384 KB Output is correct
28 Correct 7 ms 2384 KB Output is correct
29 Correct 9 ms 2384 KB Output is correct
30 Correct 5 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 4 ms 2384 KB Output is correct
33 Correct 7 ms 2600 KB Output is correct
34 Correct 7 ms 2384 KB Output is correct
35 Correct 7 ms 2384 KB Output is correct
36 Correct 4 ms 2384 KB Output is correct
37 Correct 28 ms 2640 KB Output is correct
38 Correct 27 ms 2640 KB Output is correct
39 Correct 99 ms 1184 KB Output is correct
40 Correct 57 ms 852 KB Output is correct
41 Correct 126 ms 1104 KB Output is correct
42 Correct 54 ms 828 KB Output is correct
43 Correct 87 ms 1368 KB Output is correct
44 Correct 90 ms 1352 KB Output is correct
45 Correct 91 ms 1404 KB Output is correct
46 Correct 54 ms 604 KB Output is correct
47 Correct 55 ms 848 KB Output is correct
48 Correct 101 ms 1364 KB Output is correct
49 Correct 98 ms 1104 KB Output is correct
50 Correct 55 ms 848 KB Output is correct
51 Correct 7 ms 592 KB Output is correct
52 Correct 125 ms 1608 KB Output is correct
53 Correct 93 ms 1256 KB Output is correct
54 Correct 125 ms 1352 KB Output is correct
55 Correct 255 ms 2252 KB Output is correct
56 Correct 111 ms 1384 KB Output is correct
57 Correct 269 ms 2252 KB Output is correct
58 Correct 138 ms 1608 KB Output is correct
59 Correct 174 ms 1744 KB Output is correct
60 Correct 14 ms 848 KB Output is correct
61 Correct 191 ms 1860 KB Output is correct
62 Correct 200 ms 2100 KB Output is correct
63 Correct 220 ms 2140 KB Output is correct
64 Correct 206 ms 2252 KB Output is correct
65 Correct 98 ms 848 KB Output is correct
66 Correct 110 ms 1096 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2384 KB Output is correct
2 Correct 1 ms 2524 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 2552 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 2 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2552 KB Output is correct
21 Correct 3 ms 2384 KB Output is correct
22 Correct 3 ms 2384 KB Output is correct
23 Correct 2 ms 2384 KB Output is correct
24 Correct 5 ms 2384 KB Output is correct
25 Correct 7 ms 2640 KB Output is correct
26 Correct 8 ms 2640 KB Output is correct
27 Correct 7 ms 2384 KB Output is correct
28 Correct 7 ms 2384 KB Output is correct
29 Correct 9 ms 2384 KB Output is correct
30 Correct 5 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 4 ms 2384 KB Output is correct
33 Correct 7 ms 2600 KB Output is correct
34 Correct 7 ms 2384 KB Output is correct
35 Correct 7 ms 2384 KB Output is correct
36 Correct 4 ms 2384 KB Output is correct
37 Correct 28 ms 2640 KB Output is correct
38 Correct 27 ms 2640 KB Output is correct
39 Correct 99 ms 1184 KB Output is correct
40 Correct 57 ms 852 KB Output is correct
41 Correct 126 ms 1104 KB Output is correct
42 Correct 54 ms 828 KB Output is correct
43 Correct 87 ms 1368 KB Output is correct
44 Correct 90 ms 1352 KB Output is correct
45 Correct 91 ms 1404 KB Output is correct
46 Correct 54 ms 604 KB Output is correct
47 Correct 55 ms 848 KB Output is correct
48 Correct 101 ms 1364 KB Output is correct
49 Correct 98 ms 1104 KB Output is correct
50 Correct 55 ms 848 KB Output is correct
51 Correct 7 ms 592 KB Output is correct
52 Correct 125 ms 1608 KB Output is correct
53 Correct 93 ms 1256 KB Output is correct
54 Correct 125 ms 1352 KB Output is correct
55 Correct 255 ms 2252 KB Output is correct
56 Correct 111 ms 1384 KB Output is correct
57 Correct 269 ms 2252 KB Output is correct
58 Correct 138 ms 1608 KB Output is correct
59 Correct 174 ms 1744 KB Output is correct
60 Correct 14 ms 848 KB Output is correct
61 Correct 191 ms 1860 KB Output is correct
62 Correct 200 ms 2100 KB Output is correct
63 Correct 220 ms 2140 KB Output is correct
64 Correct 206 ms 2252 KB Output is correct
65 Correct 98 ms 848 KB Output is correct
66 Correct 110 ms 1096 KB Output is correct
67 Correct 198 ms 1740 KB Output is correct
68 Correct 43 ms 1360 KB Output is correct
69 Correct 697 ms 4304 KB Output is correct
70 Correct 414 ms 2508 KB Output is correct
71 Correct 416 ms 2516 KB Output is correct
72 Correct 414 ms 1932 KB Output is correct
73 Correct 395 ms 1928 KB Output is correct
74 Correct 712 ms 4296 KB Output is correct
75 Correct 551 ms 3400 KB Output is correct
76 Correct 786 ms 4480 KB Output is correct
77 Correct 755 ms 4524 KB Output is correct