oj.uz

답안 #474194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474194 2021-09-17T09:32:38 Z kingline Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 340 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;
        dp[0] = 1;
        for(int i = 1; i <= sum1; i++) {
            dp[i] = 0;
        }
        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;
                }
            }
        }
    }
    return 0;
}

vector < int > v;

bool check() {
    for(int i = 0; i <= n; i++) {
        sum -= a[i];
        if(!check2(v, i)) return 0;
    }
    return 1;
}

main()
{
    //file("B");
    ios;
    scanf("%d", &n);
    if(n % 2) {
        cout << 0;
        return 0;
    }
    v.pb(0);
    for(int i = 1; i <= n; i++) {
        //cin >> a[i];
        scanf("%d", &a[i]);
        mn = min(mn, a[i]);
        sum += a[i];
        v.pb(a[i]);
    }
    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];
        if(check()) {
            ans.pb(tmp);
        }
    }
    printf("%d\n", ans.size());
    for(int i = 0; i < ans.size(); i++) {
        printf("%d ", 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:82:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   82 | main()
      | ^~~~
bootfall.cpp: In function 'int main()':
bootfall.cpp:86:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
   86 |     scanf("%d", &n);
      |            ~^   ~~
      |             |   |
      |             |   ll* {aka long long int*}
      |             int*
      |            %lld
bootfall.cpp:94:17: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
   94 |         scanf("%d", &a[i]);
      |                ~^   ~~~~~
      |                 |   |
      |                 |   ll* {aka long long int*}
      |                 int*
      |                %lld
bootfall.cpp:109:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wformat=]
  109 |     printf("%d\n", ans.size());
      |             ~^     ~~~~~~~~~~
      |              |             |
      |              int           std::vector<long long int>::size_type {aka long unsigned int}
      |             %ld
bootfall.cpp:110: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]
  110 |     for(int i = 0; i < ans.size(); i++) {
      |                    ~~^~~~~~~~~~~~
bootfall.cpp:111:18: warning: format '%d' expects argument of type 'int', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} [-Wformat=]
  111 |         printf("%d ", ans[i]);
      |                 ~^
      |                  |
      |                  int
      |                 %lld
bootfall.cpp:86:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
bootfall.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 9 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 12 ms 324 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 13 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 9 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 12 ms 324 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 13 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Execution timed out 1082 ms 332 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 9 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 12 ms 324 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 13 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Execution timed out 1082 ms 332 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 9 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 12 ms 324 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 13 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Execution timed out 1082 ms 332 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 17 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 26 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 5 ms 332 KB Output is correct
11 Correct 9 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 12 ms 324 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 13 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Execution timed out 1082 ms 332 KB Time limit exceeded
22 Halted 0 ms 0 KB -