oj.uz

Submission #933900

# Submission time Handle Problem Language Result Execution time Memory
933900 2024-02-26T14:36:36 Z dilanyan Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 600 KB 
//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------Kargpefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
 
void KarginSet(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    if (name.size()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1000000007;
const ll inf = 1e9;
 
//-------------------KarginCode-----------------------\\ 
 
const int N = 200005;
int a[N], dp[N];

void KarginSolve() {
    int n; cin >> n;
    int sum = 0;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        sum += a[i];
    }
    vector<int> ans;
    for (int s = 1;s <= sum;s++) {
        bool flag = true;
        for (int k = 0;k <= n;k++) {
            for (int i = 0;i <= sum + s - a[k];i++) dp[i] = false;
            dp[0] = true;
            a[0] = s;
            for (int i = 0;i <= n;i++) {
                if(i == k) continue;
                for (int j = sum + s - a[k];j >= 0;j--) {
                    if (j + a[i] <= sum + s - a[k] && dp[j]) dp[j + a[i]] = true;
                }
            }
            if (!((sum + s - a[k]) % 2 == 0 && dp[(sum + s - a[k]) / 2])) {
                flag = false;
                break;
            }
        }
        if (flag) ans.pb(s);
    }
    cout << ans.size() << '\n';
    for (int i : ans) cout << i << ' ';
}

int main() {
    KarginSet();
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message

bootfall.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
bootfall.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
bootfall.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
bootfall.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
bootfall.cpp: In function 'void KarginSet(std::string)':
bootfall.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 35 ms 468 KB Output is correct
11 Correct 46 ms 464 KB Output is correct
12 Correct 12 ms 600 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 52 ms 348 KB Output is correct
15 Correct 27 ms 348 KB Output is correct
16 Correct 42 ms 440 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 28 ms 348 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 41 ms 464 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 35 ms 468 KB Output is correct
11 Correct 46 ms 464 KB Output is correct
12 Correct 12 ms 600 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 52 ms 348 KB Output is correct
15 Correct 27 ms 348 KB Output is correct
16 Correct 42 ms 440 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 28 ms 348 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 41 ms 464 KB Output is correct
21 Execution timed out 1072 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 35 ms 468 KB Output is correct
11 Correct 46 ms 464 KB Output is correct
12 Correct 12 ms 600 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 52 ms 348 KB Output is correct
15 Correct 27 ms 348 KB Output is correct
16 Correct 42 ms 440 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 28 ms 348 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 41 ms 464 KB Output is correct
21 Execution timed out 1072 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 35 ms 468 KB Output is correct
11 Correct 46 ms 464 KB Output is correct
12 Correct 12 ms 600 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 52 ms 348 KB Output is correct
15 Correct 27 ms 348 KB Output is correct
16 Correct 42 ms 440 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 28 ms 348 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 41 ms 464 KB Output is correct
21 Execution timed out 1072 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 71 ms 444 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 141 ms 464 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 35 ms 468 KB Output is correct
11 Correct 46 ms 464 KB Output is correct
12 Correct 12 ms 600 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 52 ms 348 KB Output is correct
15 Correct 27 ms 348 KB Output is correct
16 Correct 42 ms 440 KB Output is correct
17 Correct 15 ms 348 KB Output is correct
18 Correct 28 ms 348 KB Output is correct
19 Correct 22 ms 344 KB Output is correct
20 Correct 41 ms 464 KB Output is correct
21 Execution timed out 1072 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -