oj.uz

Submission #199774

# Submission time Handle Problem Language Result Execution time Memory
199774 2020-02-03T09:35:19 Z SamAnd Popcount (COCI19_popcount) C++17
0 / 110
 19 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k;

vector<int> gum(vector<int> a, vector<int> b)
{
    vector<int> ans;
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    while (a.size() < b.size())
        a.push_back(0);
    while (b.size() < a.size())
        b.push_back(0);
    int m = 0;
    for (int i = 0; i < a.size(); ++i)
    {
        ans.push_back((a[i] + b[i] + m) % 10);
        m = (a[i] + b[i] + m) / 10;
    }
    ans.push_back(m);
    while (ans.back() == 0)
        ans.pop_back();
    reverse(ans.begin(), ans.end());
    return ans;
}

void tp(vector<int> v)
{
    if (v.empty())
        v.push_back(0);
    for (int i = 0; i < v.size(); ++i)
        cout << v[i];
}

void solv4()
{
    k = min(k, 10);
    cout << k << endl;
    for (int i = 0; i < k; ++i)
    {
        vector<int> v1, v2;
        vector<int> ast = {1};
        for (int j = 0; j < n; ++j)
        {
            if ((j & (1 << i)) == 0)
            {
                v1 = gum(v1, ast);
            }
            else
            {
                v2 = gum(v2, ast);
            }
            ast = gum(ast, ast);
        }
        cout << "A=((";
        tp(v1);
        cout << "&A)+((";
        tp(v2);
        cout << "&A)>>" << (i + 1) << "))\n";
    }
}

int main()
{
    cin >> n >> k;
    if (n == 1)
    {
        cout << "0\n";
        return 0;
    }
    solv4();
    return 0;
}

Compilation message

popcount.cpp: In function 'std::vector<int> gum(std::vector<int>, std::vector<int>)':
popcount.cpp:16:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
popcount.cpp: In function 'void tp(std::vector<int>)':
popcount.cpp:32:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); ++i)
                     ~~^~~~~~~~~~

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Accepted.
2 Correct 5 ms 256 KB Accepted.
3 Correct 5 ms 256 KB Accepted.
4 Incorrect 5 ms 256 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 256 KB Wrong answer.

Subtask #3
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Accepted.
2 Incorrect 5 ms 256 KB Wrong answer.
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 256 KB Wrong answer.
2 Halted 0 ms 0 KB -