oj.uz

Submission #861091

# Submission time Handle Problem Language Result Execution time Memory
861091 2023-10-15T09:21:51 Z Alfraganus "The Lyuboyn" code (IZhO19_lyuboyn) C++14
34 / 100
 1000 ms 27096 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define fs first
#define ss second
#define str string
#define all(a) a.begin(), a.end()
#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;
#define each(x, a) for (auto x : a)

vector<int> ans;
vector<bool> used;
int n, k, t, sx = 0;

bool good(int s1, int s2){
    int ans = 0;
    while(s1 > 0 or s2 > 0){
        ans += (s1 % 2 != s2 % 2);
        s1 /= 2;
        s2 /= 2;
    }
    return ans == k;
}

bool dfs(int node, int step){
    if(step == (1 << n) - 1){
        if(t == 0){
            ans.push_back(node);
            return true;
        }
        if(good(sx, node))
            ans.push_back(node);
        else
            return false;
        return true;
    }
    used[node] = 1;
    if(k == 1){
        for (int i = 0; i < n; i++)
        {
            if (!used[node ^ (1 << i)] and dfs(node ^ (1 << i), step + 1))
            {
                ans.push_back(node);
                return true;
            }
        }
    }
    else{
        for(int i = 0; i < n; i ++){
            for(int j = i + 1; j < n; j ++){
                for(int x = j + 1; x < n; x ++){
                    if (!used[((node ^ (1 << i)) ^ (1 << j)) ^ (1 << x)] and dfs(((node ^ (1 << i)) ^ (1 << j)) ^ (1 << x), step + 1))
                    {
                        ans.push_back(node);
                        return true;
                    }
                }
            }
        }
    }
    used[node] = 0;
    return false;
}

void solve(){
    cin >> n >> k >> t;
    str s;
    cin >> s;
    for(int i = s.size() - 1; i >= 0; i --){
        if(s[i] == '1'){
            sx += (1 << (s.size() - 1 - i));
        }
    }
    if(k % 2 == 0){
        cout << -1;
        return;
    }
    used.resize((1 << n));
    if(dfs(sx, 0)){
        cout << (1 << n) << endl;
        reverse(all(ans));
        for(int i = 0; i < ans.size(); i ++){
            str s = "";
            for(int j = 0; j < n; j ++){
                if(ans[i] % 2 == 0)
                    s += '0';
                else
                    s += '1';
                ans[i] >>= 1;
            }
            reverse(all(s));
            cout << s << endl;
        }
    }
    else{
        cout << -1;
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        cout << endl;
    }
}

Compilation message

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

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Ok

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Ok

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Ok
2 Correct 0 ms 348 KB Ok
3 Correct 0 ms 348 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 0 ms 348 KB Ok
8 Correct 0 ms 348 KB Ok

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 27096 KB Ok
2 Correct 31 ms 13524 KB Ok
3 Correct 1 ms 344 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Ok
2 Correct 2 ms 1116 KB Ok
3 Correct 32 ms 13532 KB Ok
4 Correct 16 ms 6880 KB Ok
5 Correct 1 ms 348 KB Ok
6 Correct 1 ms 600 KB Ok
7 Correct 7 ms 3676 KB Ok
8 Correct 1 ms 348 KB Ok

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 26964 KB Fail, not exactly k bits are different: line = 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 27096 KB Ok
2 Correct 31 ms 13524 KB Ok
3 Correct 1 ms 344 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 2 ms 1116 KB Ok
8 Correct 32 ms 13532 KB Ok
9 Correct 16 ms 6880 KB Ok
10 Correct 1 ms 348 KB Ok
11 Correct 1 ms 600 KB Ok
12 Correct 7 ms 3676 KB Ok
13 Correct 1 ms 348 KB Ok
14 Incorrect 75 ms 26964 KB Fail, not exactly k bits are different: line = 0
15 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 10588 KB Time limit exceeded
2 Halted 0 ms 0 KB -