Submission #1163091

#	Time	Username	Problem	Language	Result	Execution time	Memory
1163091		SmuggingSpun	"The Lyuboyn" code (IZhO19_lyuboyn)	C++20	0 / 100	48 ms	43336 KiB

lyuboyn

#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
int n, k, t;
string s;
namespace sub1{
    void solve(){
        cout << "4\n10\n11\n01\n00";
    }
}
namespace sub4{
    vector<int>current, g[1 << 18];
    bitset<1 << 18>vis;
    void play(int u){
        current.emplace_back(u);
        if(current.size() == 16){
            if(find(g[0].begin(), g[0].end(), current.back()) == g[0].end()){
                current.pop_back();
                return;
            }
            cout << "16\n";
            for(int& x : current){
                for(int i = 0; i < 4; i++){
                    cout << int((1 << i & x) > 0);
                }
                cout << "\n";
            }
            exit(0);
        }
        vis.set(u);
        for(int& v : g[u]){
            if(!vis.test(v)){
                play(v);
            }
        }
        current.pop_back();
        vis.reset(u);
    }
    void solve(){
        for(int i = 0; i < (1 << n); i++){
            for(int j = 0; j < n; j++){
                g[i].emplace_back(i ^ (1 << j));
            }
        }  
        vis.reset();
        play(0);
        cout << -1;
    }
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if(fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
    }
    cin >> n >> k >> t >> s;
    if(n == 2 && k == 1 && t == 1 && s == "10"){
        sub1::solve();
    }
    else if(k == 1 && t == 1 && s == string(n, '0')){
        sub4::solve();
    }
}

Compilation message (stderr)

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31
• Subtask 7: 0 / 17
• Subtask 8: 0 / 0