oj.uz

답안 #873170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873170 2023-11-14T15:03:11 Z Mher777 Bootfall (IZhO17_bootfall) C++17
28 / 100
 1000 ms 25988 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 <fstream>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
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()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
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) {
    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) {
    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;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

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 = 505;
int a[N], dp[N][N * N];

void slv() {
    int n, sum = 0;
    cin >> n;
    bool f = false;
    mii mp;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i], sum += a[i];
        if (i > 1 && (a[i] % 2) != (a[i - 1] % 2)) f = true;
    }
    if (f || sum % 2) {
        cout << 0;
        return;
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = sum; j >= 1; --j) {
            if (dp[0][j]) dp[0][j + a[i]] = 1;
        }
        dp[0][a[i]] = 1;
    }
    if (!dp[0][sum / 2]) {
        cout << 0;
        return;
    }
    for (int sk = 1; sk <= n; ++sk) {
        sum -= a[sk];
        for (int i = 1; i <= n; ++i) {
            if (i == sk) continue;
            for (int j = sum; j >= 1; --j) {
                if (dp[sk][j]) dp[sk][j + a[i]] = 1;
            }
            dp[sk][a[i]] = 1;
        }
        sum += a[sk];
    }
    for (int i = 1; i <= n; ++i) {
        sum -= a[i];
        for (int j = 1; j <= sum / 2; ++j) {
            if (dp[i][j]) mp[sum - 2 * j]++;
        }
        mp[sum]++;
        sum += a[i];
    }
    vi ans;
    for (auto elem : mp) {
        if (elem.ff == 0) continue;
        if (elem.ss == n) ans.pub(elem.ff);
    }
    cout << 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;
}

Compilation message

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 13 ms 1628 KB Output is correct
22 Correct 19 ms 1884 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 37 ms 2644 KB Output is correct
25 Correct 76 ms 4480 KB Output is correct
26 Correct 83 ms 4940 KB Output is correct
27 Correct 69 ms 4564 KB Output is correct
28 Correct 75 ms 4804 KB Output is correct
29 Correct 79 ms 4948 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 65 ms 4180 KB Output is correct
32 Correct 44 ms 2968 KB Output is correct
33 Correct 79 ms 4924 KB Output is correct
34 Correct 70 ms 4852 KB Output is correct
35 Correct 83 ms 5204 KB Output is correct
36 Correct 41 ms 2908 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 13 ms 1628 KB Output is correct
22 Correct 19 ms 1884 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 37 ms 2644 KB Output is correct
25 Correct 76 ms 4480 KB Output is correct
26 Correct 83 ms 4940 KB Output is correct
27 Correct 69 ms 4564 KB Output is correct
28 Correct 75 ms 4804 KB Output is correct
29 Correct 79 ms 4948 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 65 ms 4180 KB Output is correct
32 Correct 44 ms 2968 KB Output is correct
33 Correct 79 ms 4924 KB Output is correct
34 Correct 70 ms 4852 KB Output is correct
35 Correct 83 ms 5204 KB Output is correct
36 Correct 41 ms 2908 KB Output is correct
37 Correct 603 ms 17304 KB Output is correct
38 Correct 607 ms 17728 KB Output is correct
39 Execution timed out 1053 ms 25988 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 13 ms 1628 KB Output is correct
22 Correct 19 ms 1884 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 37 ms 2644 KB Output is correct
25 Correct 76 ms 4480 KB Output is correct
26 Correct 83 ms 4940 KB Output is correct
27 Correct 69 ms 4564 KB Output is correct
28 Correct 75 ms 4804 KB Output is correct
29 Correct 79 ms 4948 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 65 ms 4180 KB Output is correct
32 Correct 44 ms 2968 KB Output is correct
33 Correct 79 ms 4924 KB Output is correct
34 Correct 70 ms 4852 KB Output is correct
35 Correct 83 ms 5204 KB Output is correct
36 Correct 41 ms 2908 KB Output is correct
37 Correct 603 ms 17304 KB Output is correct
38 Correct 607 ms 17728 KB Output is correct
39 Execution timed out 1053 ms 25988 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 13 ms 1628 KB Output is correct
22 Correct 19 ms 1884 KB Output is correct
23 Correct 7 ms 1116 KB Output is correct
24 Correct 37 ms 2644 KB Output is correct
25 Correct 76 ms 4480 KB Output is correct
26 Correct 83 ms 4940 KB Output is correct
27 Correct 69 ms 4564 KB Output is correct
28 Correct 75 ms 4804 KB Output is correct
29 Correct 79 ms 4948 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 65 ms 4180 KB Output is correct
32 Correct 44 ms 2968 KB Output is correct
33 Correct 79 ms 4924 KB Output is correct
34 Correct 70 ms 4852 KB Output is correct
35 Correct 83 ms 5204 KB Output is correct
36 Correct 41 ms 2908 KB Output is correct
37 Correct 603 ms 17304 KB Output is correct
38 Correct 607 ms 17728 KB Output is correct
39 Execution timed out 1053 ms 25988 KB Time limit exceeded
40 Halted 0 ms 0 KB -