oj.uz

답안 #1022408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022408 2024-07-13T13:10:30 Z phoenix Bootfall (IZhO17_bootfall) C++17
44 / 100
 896 ms 3544 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;
 
template<unsigned int MOD> 
struct mint {
    int v;
    mint() {}
    mint(long long val) : v(val % 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};
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];
    }   
}
 
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);
    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];
    }
}
 
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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 488 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 484 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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 488 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 484 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 6 ms 360 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 18 ms 604 KB Output is correct
26 Correct 20 ms 640 KB Output is correct
27 Correct 19 ms 652 KB Output is correct
28 Correct 20 ms 600 KB Output is correct
29 Correct 21 ms 600 KB Output is correct
30 Correct 12 ms 476 KB Output is correct
31 Correct 16 ms 624 KB Output is correct
32 Correct 11 ms 580 KB Output is correct
33 Correct 21 ms 672 KB Output is correct
34 Correct 22 ms 604 KB Output is correct
35 Correct 21 ms 604 KB Output is correct
36 Correct 10 ms 604 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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 488 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 484 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 6 ms 360 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 18 ms 604 KB Output is correct
26 Correct 20 ms 640 KB Output is correct
27 Correct 19 ms 652 KB Output is correct
28 Correct 20 ms 600 KB Output is correct
29 Correct 21 ms 600 KB Output is correct
30 Correct 12 ms 476 KB Output is correct
31 Correct 16 ms 624 KB Output is correct
32 Correct 11 ms 580 KB Output is correct
33 Correct 21 ms 672 KB Output is correct
34 Correct 22 ms 604 KB Output is correct
35 Correct 21 ms 604 KB Output is correct
36 Correct 10 ms 604 KB Output is correct
37 Correct 82 ms 852 KB Output is correct
38 Correct 86 ms 852 KB Output is correct
39 Correct 326 ms 1616 KB Output is correct
40 Correct 187 ms 1108 KB Output is correct
41 Correct 419 ms 1744 KB Output is correct
42 Correct 158 ms 1104 KB Output is correct
43 Correct 289 ms 1840 KB Output is correct
44 Correct 299 ms 1872 KB Output is correct
45 Correct 299 ms 1864 KB Output is correct
46 Correct 178 ms 856 KB Output is correct
47 Correct 184 ms 1236 KB Output is correct
48 Correct 324 ms 1876 KB Output is correct
49 Correct 330 ms 1680 KB Output is correct
50 Correct 173 ms 1240 KB Output is correct
51 Correct 50 ms 860 KB Output is correct
52 Correct 402 ms 2076 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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 488 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 484 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 6 ms 360 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 18 ms 604 KB Output is correct
26 Correct 20 ms 640 KB Output is correct
27 Correct 19 ms 652 KB Output is correct
28 Correct 20 ms 600 KB Output is correct
29 Correct 21 ms 600 KB Output is correct
30 Correct 12 ms 476 KB Output is correct
31 Correct 16 ms 624 KB Output is correct
32 Correct 11 ms 580 KB Output is correct
33 Correct 21 ms 672 KB Output is correct
34 Correct 22 ms 604 KB Output is correct
35 Correct 21 ms 604 KB Output is correct
36 Correct 10 ms 604 KB Output is correct
37 Correct 82 ms 852 KB Output is correct
38 Correct 86 ms 852 KB Output is correct
39 Correct 326 ms 1616 KB Output is correct
40 Correct 187 ms 1108 KB Output is correct
41 Correct 419 ms 1744 KB Output is correct
42 Correct 158 ms 1104 KB Output is correct
43 Correct 289 ms 1840 KB Output is correct
44 Correct 299 ms 1872 KB Output is correct
45 Correct 299 ms 1864 KB Output is correct
46 Correct 178 ms 856 KB Output is correct
47 Correct 184 ms 1236 KB Output is correct
48 Correct 324 ms 1876 KB Output is correct
49 Correct 330 ms 1680 KB Output is correct
50 Correct 173 ms 1240 KB Output is correct
51 Correct 50 ms 860 KB Output is correct
52 Correct 402 ms 2076 KB Output is correct
53 Correct 289 ms 1616 KB Output is correct
54 Correct 410 ms 1844 KB Output is correct
55 Correct 816 ms 3016 KB Output is correct
56 Correct 361 ms 1856 KB Output is correct
57 Correct 896 ms 3544 KB Output is correct
58 Incorrect 457 ms 1928 KB Output isn't correct
59 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 1 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 1 ms 600 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 488 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 484 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 6 ms 360 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 18 ms 604 KB Output is correct
26 Correct 20 ms 640 KB Output is correct
27 Correct 19 ms 652 KB Output is correct
28 Correct 20 ms 600 KB Output is correct
29 Correct 21 ms 600 KB Output is correct
30 Correct 12 ms 476 KB Output is correct
31 Correct 16 ms 624 KB Output is correct
32 Correct 11 ms 580 KB Output is correct
33 Correct 21 ms 672 KB Output is correct
34 Correct 22 ms 604 KB Output is correct
35 Correct 21 ms 604 KB Output is correct
36 Correct 10 ms 604 KB Output is correct
37 Correct 82 ms 852 KB Output is correct
38 Correct 86 ms 852 KB Output is correct
39 Correct 326 ms 1616 KB Output is correct
40 Correct 187 ms 1108 KB Output is correct
41 Correct 419 ms 1744 KB Output is correct
42 Correct 158 ms 1104 KB Output is correct
43 Correct 289 ms 1840 KB Output is correct
44 Correct 299 ms 1872 KB Output is correct
45 Correct 299 ms 1864 KB Output is correct
46 Correct 178 ms 856 KB Output is correct
47 Correct 184 ms 1236 KB Output is correct
48 Correct 324 ms 1876 KB Output is correct
49 Correct 330 ms 1680 KB Output is correct
50 Correct 173 ms 1240 KB Output is correct
51 Correct 50 ms 860 KB Output is correct
52 Correct 402 ms 2076 KB Output is correct
53 Correct 289 ms 1616 KB Output is correct
54 Correct 410 ms 1844 KB Output is correct
55 Correct 816 ms 3016 KB Output is correct
56 Correct 361 ms 1856 KB Output is correct
57 Correct 896 ms 3544 KB Output is correct
58 Incorrect 457 ms 1928 KB Output isn't correct
59 Halted 0 ms 0 KB -