oj.uz

Submission #910245

# Submission time Handle Problem Language Result Execution time Memory
910245 2024-01-18T02:55:04 Z vjudge1 Bootfall (IZhO17_bootfall) C++17
6 / 100
 127 ms 596 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include <bits/stdc++.h>
 
#define int long long 
#define pb push_back
#define ui unsigned int
#define ld long double
#define pl pair<long long int,  long long int>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first    
#define ss second
#define sz size()
#define all(x) x.begin(), x.end()
 
using namespace std;
 
const int maxn = 3e5 + 11;
const int inf = 1e18 + 1;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1 , 0, -1, 1, -1, 1};
const double eps = 1e-10;

void solve() {
    int n;

    cin >> n;

    int a[n + 1];

    for(int i = 0; i < n; i++) {
        cin >> a[ i ];
    }
    n++;
    vector<int> v;

    for(int x = 1; x <= 1000; x++) {
        a[n - 1] = x;
        bool bl = true;

        for(int j = 0; j < n; j++) {
            bool fl = false;
            for(int mask = 0; mask < (1 << n); mask++) {
                int cnt1 = 0, cnt2 = 0;
                for(int i = 0; i < n; i++) {
                    if(i == j) {
                        continue;
                    }
                    if(mask & (1 << i)) {
                        cnt1 += a[ i ];
                    }
                    else {
                        cnt2 += a[ i ];
                    }
                }
                if(cnt1 == cnt2) {
                    fl = true;
                    break;
                }
            }
            if(!fl) {
                bl = false;
                break;
            }
        }
        if(bl) {
            v.pb( x );
        }
    }
    cout << v.sz << '\n';

    for(auto it : v) {
        cout << it << ' ';
    }
}
    
signed main() {
    // freopen("sum.in", "r", stdin); 
    // freopen("sum.out", "w", stdout);
 
    boost;      

    int tt = 1;

    // cin >> tt;

    for(int i = 1; i <= tt; i++) {
        // cout << "Case " << i << ":\n";
        solve();    
    }           
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 125 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 127 ms 596 KB Output is correct
9 Correct 19 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -