oj.uz

Submission #1094960

# Submission time Handle Problem Language Result Execution time Memory
1094960 2024-10-01T03:41:30 Z cpptowin Bootfall (IZhO17_bootfall) C++17
0 / 100
 1000 ms 604 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if(x < 0) x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if(x < 0) x += mod;
}
const int nn = 250010;
int n,a[maxn];
bitset<nn> f,ans[505];
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    fo(i,1,n) cin >> a[i];
    int tot = 0;
    f[0] = 1;
    fo(i,1,n)
    {
        f |= f << a[i];
        tot += a[i];
    }
    if(tot % 2 == 1 or f[tot / 2] == 0) return cout << 0,0;
    fo(j,1,tot) ans[n + 1][j] = 1;
    fo(i,1,n)
    {
        fo(j,1,tot) 
        {
            f = 0;
            f[0] = 1;
            a[n + 1] = j;
            fo(k,1,n + 1) if(k != i)
            {
                f |= f << a[k];
            }
            int tot1 = tot - a[i] + a[n + 1];
            if(tot1 % 2 == 0 and f[tot1 / 2] == 1) ans[i][j] = 1;
        }
        ans[n + 1] &= ans[i];
    }
    cout << ans[n + 1].count();en;
    fo(j,1,tot) if(ans[n + 1][j]) cout << j << ' ';
}

Compilation message

bootfall.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   58 | main()
      | ^~~~
bootfall.cpp: In function 'int main()':
bootfall.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bootfall.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 10 ms 520 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 75 ms 592 KB Output is correct
5 Correct 730 ms 548 KB Output is correct
6 Correct 70 ms 604 KB Output is correct
7 Correct 64 ms 600 KB Output is correct
8 Execution timed out 1073 ms 552 KB Time limit exceeded
9 Halted 0 ms 0 KB -