oj.uz

Submission #566243

# Submission time Handle Problem Language Result Execution time Memory
566243 2022-05-22T07:42:01 Z Rifal Bootfall (IZhO17_bootfall) C++14
6 / 100
 1000 ms 340 KB 
#include <bits/stdc++.h>
#include <fstream>
#define endl '\n'
#define mod 32768
#define INF 100000000000000
//#define ll long long
//#define cin fin
//#define cout fout
using namespace std;
//ofstream fout("convention.out");
//ifstream fin("convention.in");

int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int n;
    cin >> n;
    int arr[n];
    int cnt[5000] = {};
    set<int> sul;
    bool check = false;
    for(int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
     for(int j = 1; j < (1<<(n)); j++)
    {
        long long sum1 = 0, sum2 = 0;
        for(int q = 0; q < n; q++)
        {
            if((j&(1<<q)) > 0)
            {
                sum1 += arr[q];
            }
            else
            {
                sum2 += arr[q];
            }
        }
        if(sum1 == sum2)
        {
            check = true;
        }
    }
    if(!check)
    {
        cout << 0 << endl;
        return 0;
    }
    for(int i = 0; i < n; i++)
    {
        vector<int> v, ans;
        bool ccc[5000] = {};
        for(int j = 0; j < n; j++)
        {
            if(j == i)
            {
                continue;
            }
            v.push_back(arr[j]);
        }
        for(int j = 1; j < (1<<(n-1)); j++)
        {
            long long sum1 = 0, sum2 = 0;
           for(int q = 0; q < n-1; q++)
           {
               if((j&(1<<q)) > 0)
               {
                   sum1 += v[q];
               }
               else
               {
                   sum2 += v[q];
               }
           }
           if(ccc[abs(sum1-sum2)] == 0 && abs(sum1-sum2) != 0)
           {
               ccc[abs(sum1-sum2)] = 1;
               ans.push_back(abs(sum1-sum2));
           }

        }
        for(int j = 0; j < ans.size(); j++)
        {
            cnt[ans[j]]++;
            if(cnt[ans[j]] >= n)
                sul.insert(ans[j]);
        }
    }
    cout << sul.size() << endl;
    for(auto i : sul)
    {
        cout << i << ' ';
    }
    return 0;
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:83:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(int j = 0; j < ans.size(); j++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 1090 ms 212 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 1090 ms 212 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 1090 ms 212 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 1090 ms 212 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 1090 ms 212 KB Time limit exceeded
11 Halted 0 ms 0 KB -