oj.uz

Submission #386651

# Submission time Handle Problem Language Result Execution time Memory
386651 2021-04-07T07:08:03 Z kingline Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 492 KB 
/*#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")*/
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <vector>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <queue>
#define pb push_back
#define F first
#define mp make_pair
#define S second
#define pii pair <int, int >
#define pll pair <long long, long long >
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
#define bo cout << "OK" << endl;
#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
#define int long long

using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;

const ll N = 1e6 + 5;
const ll mod = 1e9 + 7;
const ll INF = 1e10;
const ll M = (1 << 17) + 5;
const ll LL = 1;
const ll p = 31;
bool ok;

ll q, n, m, k, a[N];
int dp[500 * 500], sum, mn = 501;
string s, s1, s2;

bool check2(vector < int > &v, int ign) {
    int sum1 = sum;
    sum += a[ign];
    if(sum1 % 2 == 0) {
        sum1 /= 2;
        for(int i = 0; i <= sum1; i++) {
            dp[i] = 0;
        }
        dp[0] = 1;
        for (int i = 0; i < v.size(); ++i) {
            if(i == ign) continue;
            for (int j = sum1; j >= 0; --j) {
                if (dp[j] == 1 && j + v[i] <= sum1) {
                    dp[j + v[i]] = 1;
                    if(j + v[i] == sum1) return 1;
                }
            }
        }/*
        cout << "Sum: " << sum1 * 2 << "\n";

        for (int i = 0; i < v.size(); ++i) {
            cout << v[i] << " ";
        }
        cout << " --> " << dp[sum1] << "\n";*/
    }
    return 0;
}

vector < int > v;

bool check() {
    //a[0] = v[0] = val;
    //cout << "Val: " << val << "\n";
    for(int i = 0; i <= n; i++) {
        /*for(int j = 0; j <= n; j++) {
            if(i != j) {
                v.pb(a[j]);
                //cout << a[j] << " ";
            }
        }*/
        //cout << endl;
        sum -= a[i];
        if(!check2(v, i)) return 0;
    }
    return 1;
}

main()
{
    //file("B");
    //ios;
    cin >> n;
    v.pb(0);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        mn = min(mn, a[i]);
        sum += a[i];
        v.pb(a[i]);
    }
    v.pb(0);
    //sort(a + 1, a + n + 1);
    vector < int > ans;
    int right = sum - mn;
    for(int tmp = 1; tmp <= right; tmp++) {
        sum -= a[0];
        v[0] = a[0] = tmp;
        sum += a[0];
        //cout << sum << endl;
        if(check()) {
            ans.pb(tmp);
        }
    }
    cout << ans.size() << endl;
    for(int i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
    }
}

Compilation message

bootfall.cpp: In function 'bool check2(std::vector<long long int>&, long long int)':
bootfall.cpp:59:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for (int i = 0; i < v.size(); ++i) {
      |                         ~~^~~~~~~~~~
bootfall.cpp: At global scope:
bootfall.cpp:97:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   97 | main()
      |      ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:123:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for(int i = 0; i < ans.size(); i++) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 12 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 13 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 7 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 12 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 13 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 7 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Execution timed out 1091 ms 492 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 12 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 13 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 7 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Execution timed out 1091 ms 492 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 12 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 13 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 7 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Execution timed out 1091 ms 492 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 27 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 6 ms 364 KB Output is correct
11 Correct 10 ms 492 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 12 ms 364 KB Output is correct
15 Correct 9 ms 364 KB Output is correct
16 Correct 13 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 7 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 7 ms 364 KB Output is correct
21 Execution timed out 1091 ms 492 KB Time limit exceeded
22 Halted 0 ms 0 KB -