oj.uz

답안 #1022412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022412 2024-07-13T13:13:45 Z phoenix Bootfall (IZhO17_bootfall) C++17
44 / 100
 1000 ms 2884 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int MOD1 = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int MOD3 = 998244353;
const int MOD4 = 999990011;
const int MOD5 = 999994081;
 
template<unsigned int MOD> 
struct mint {
    int v;
    mint() {}
    mint(long long val) : v(val - (val >= MOD) * MOD + (val < 0) * MOD) {}
    mint<MOD>& operator += (mint<MOD> other) {
        *this = mint(v + other.v);
        return *this;
    }
    mint<MOD>& operator -= (mint<MOD> other) {
        *this = mint(v - other.v);
        return *this;
    }
};
const int N = 370;
const int A = 123000;
 
int lim = 0;
mint<MOD1> dp1[A]{1};
mint<MOD2> dp2[A]{1};
mint<MOD3> dp3[A]{1};
mint<MOD4> dp4[A]{1};
mint<MOD5> dp5[A]{1};
int sum = 0;
 
void add(int val) {
    sum += val;
    for (int i = lim; i >= val; i--) {
        dp1[i] += dp1[i - val];
        dp2[i] += dp2[i - val];
        dp3[i] += dp3[i - val];
        dp4[i] += dp4[i - val];
        dp5[i] += dp5[i - val];
    }   
}
 
bool check(int sum) {
    if (sum < 0 && sum > lim) return 0;
    bool flag = true;
    flag &= (dp1[sum].v > 0);
    flag &= (dp2[sum].v > 0);
    flag &= (dp3[sum].v > 0);
    flag &= (dp4[sum].v > 0);
    flag &= (dp5[sum].v > 0);
    return flag;
}
 
void del(int val) {
    sum -= val;
    for (int i = val; i <= lim; i++) {
        dp1[i] -= dp1[i - val];
        dp2[i] -= dp2[i - val];
        dp3[i] -= dp3[i - val];
        dp4[i] -= dp4[i - val];
        dp5[i] -= dp5[i - val];
    }
}
 
int n;
int a[N];
 
int cnt[A];
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        lim += a[i];
    }
    for (int i = 0; i < n; i++) {
        add(a[i]);
    }
    if (sum & 1 || !check(sum / 2)) {
        cout << 0;
        return 0;
    }
 
    for (int i = 0; i < n; i++) {
        if (i) add(a[i - 1]);
        del(a[i]);
        for (int s = 0; s <= lim; s++) {
            if (check(s)) {
                cnt[abs(2 * s - sum)]++;
            }
        }
    }
    vector<int> res;
    for (int i = 1; i <= lim; i++) {
        if (cnt[i] == 2 * n) 
            res.push_back(i);
    }
    cout << (int)res.size() << '\n';
    for (int c : res) cout << c << ' ';
}

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 348 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 348 KB Output is correct
9 Correct 1 ms 604 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 348 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 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 348 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 8 ms 484 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 14 ms 584 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 32 ms 600 KB Output is correct
27 Correct 19 ms 604 KB Output is correct
28 Correct 23 ms 600 KB Output is correct
29 Correct 19 ms 604 KB Output is correct
30 Correct 17 ms 604 KB Output is correct
31 Correct 24 ms 604 KB Output is correct
32 Correct 16 ms 604 KB Output is correct
33 Correct 13 ms 604 KB Output is correct
34 Correct 13 ms 676 KB Output is correct
35 Correct 20 ms 604 KB Output is correct
36 Correct 16 ms 600 KB Output is correct

Subtask #4
16.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 348 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 8 ms 484 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 14 ms 584 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 32 ms 600 KB Output is correct
27 Correct 19 ms 604 KB Output is correct
28 Correct 23 ms 600 KB Output is correct
29 Correct 19 ms 604 KB Output is correct
30 Correct 17 ms 604 KB Output is correct
31 Correct 24 ms 604 KB Output is correct
32 Correct 16 ms 604 KB Output is correct
33 Correct 13 ms 604 KB Output is correct
34 Correct 13 ms 676 KB Output is correct
35 Correct 20 ms 604 KB Output is correct
36 Correct 16 ms 600 KB Output is correct
37 Correct 144 ms 924 KB Output is correct
38 Correct 146 ms 872 KB Output is correct
39 Correct 221 ms 1676 KB Output is correct
40 Correct 338 ms 1352 KB Output is correct
41 Correct 266 ms 2416 KB Output is correct
42 Correct 289 ms 1360 KB Output is correct
43 Correct 499 ms 2128 KB Output is correct
44 Correct 512 ms 2088 KB Output is correct
45 Correct 524 ms 2084 KB Output is correct
46 Correct 222 ms 1088 KB Output is correct
47 Correct 319 ms 1360 KB Output is correct
48 Correct 473 ms 2128 KB Output is correct
49 Correct 361 ms 1916 KB Output is correct
50 Correct 339 ms 1376 KB Output is correct
51 Correct 88 ms 860 KB Output is correct
52 Correct 663 ms 2340 KB Output is correct

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 348 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 8 ms 484 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 14 ms 584 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 32 ms 600 KB Output is correct
27 Correct 19 ms 604 KB Output is correct
28 Correct 23 ms 600 KB Output is correct
29 Correct 19 ms 604 KB Output is correct
30 Correct 17 ms 604 KB Output is correct
31 Correct 24 ms 604 KB Output is correct
32 Correct 16 ms 604 KB Output is correct
33 Correct 13 ms 604 KB Output is correct
34 Correct 13 ms 676 KB Output is correct
35 Correct 20 ms 604 KB Output is correct
36 Correct 16 ms 600 KB Output is correct
37 Correct 144 ms 924 KB Output is correct
38 Correct 146 ms 872 KB Output is correct
39 Correct 221 ms 1676 KB Output is correct
40 Correct 338 ms 1352 KB Output is correct
41 Correct 266 ms 2416 KB Output is correct
42 Correct 289 ms 1360 KB Output is correct
43 Correct 499 ms 2128 KB Output is correct
44 Correct 512 ms 2088 KB Output is correct
45 Correct 524 ms 2084 KB Output is correct
46 Correct 222 ms 1088 KB Output is correct
47 Correct 319 ms 1360 KB Output is correct
48 Correct 473 ms 2128 KB Output is correct
49 Correct 361 ms 1916 KB Output is correct
50 Correct 339 ms 1376 KB Output is correct
51 Correct 88 ms 860 KB Output is correct
52 Correct 663 ms 2340 KB Output is correct
53 Correct 554 ms 1788 KB Output is correct
54 Correct 753 ms 2132 KB Output is correct
55 Execution timed out 1028 ms 2884 KB Time limit exceeded
56 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 348 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 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 8 ms 484 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 14 ms 584 KB Output is correct
25 Correct 22 ms 604 KB Output is correct
26 Correct 32 ms 600 KB Output is correct
27 Correct 19 ms 604 KB Output is correct
28 Correct 23 ms 600 KB Output is correct
29 Correct 19 ms 604 KB Output is correct
30 Correct 17 ms 604 KB Output is correct
31 Correct 24 ms 604 KB Output is correct
32 Correct 16 ms 604 KB Output is correct
33 Correct 13 ms 604 KB Output is correct
34 Correct 13 ms 676 KB Output is correct
35 Correct 20 ms 604 KB Output is correct
36 Correct 16 ms 600 KB Output is correct
37 Correct 144 ms 924 KB Output is correct
38 Correct 146 ms 872 KB Output is correct
39 Correct 221 ms 1676 KB Output is correct
40 Correct 338 ms 1352 KB Output is correct
41 Correct 266 ms 2416 KB Output is correct
42 Correct 289 ms 1360 KB Output is correct
43 Correct 499 ms 2128 KB Output is correct
44 Correct 512 ms 2088 KB Output is correct
45 Correct 524 ms 2084 KB Output is correct
46 Correct 222 ms 1088 KB Output is correct
47 Correct 319 ms 1360 KB Output is correct
48 Correct 473 ms 2128 KB Output is correct
49 Correct 361 ms 1916 KB Output is correct
50 Correct 339 ms 1376 KB Output is correct
51 Correct 88 ms 860 KB Output is correct
52 Correct 663 ms 2340 KB Output is correct
53 Correct 554 ms 1788 KB Output is correct
54 Correct 753 ms 2132 KB Output is correct
55 Execution timed out 1028 ms 2884 KB Time limit exceeded
56 Halted 0 ms 0 KB -