oj.uz

Submission #145907

# Submission time Handle Problem Language Result Execution time Memory
145907 2019-08-21T10:53:54 Z davitmarg "The Lyuboyn" code (IZhO19_lyuboyn) C++17
3 / 100
 1000 ms 133088 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int cnt(int num)
{
    int res=0;
    while(num)
    {
        res+=num%2;
        num/=2;
    }
    return res;
}

vector<int> dirs,path;
int n,k,t,s,used[(1<<18)+10],is[(1<<18)+10]; 

void print(int num)
{
    string s;
    for(int i=0;i<n;i++)
    {
        s+=(char)(num%2+'0');
        num/=2;
    }
    reverse(all(s));
    for(int i=0;i<s.length();i++)
        printf("%c",s[i]);
    putchar(10);
}

void dfs(int v)
{
    vector<int> d=dirs;
    path.PB(v);
    used[v]=1;
    if(path.size()==(1<<n) && is[(path[0]^v)])
    {
        cout<<path.size()<<endl;
        for(int i=0;i<path.size();i++)
            print(path[i]);
        exit(0);
    }
    random_shuffle(all(d));
    for(int i=0;i<d.size();i++)
    {
        int to=v^d[i];
        if(used[to])
            continue;
        dfs(to);
    }
    used[v]=0;
}


int main()
{
    cin>>n>>k>>t;
    for(int i=0;i<n;i++)
    {
        char x;
        cin>>x;
        s=s*2+(x-'0');
    }
    if(k%2==0)
    {
        cout<<-1<<endl;
        return 0;
    }
    for(int i=1;i<(1<<n);i++)
        if(cnt(i)==k)
        {
            dirs.PB(i);
            is[i]=1;
        }
    dfs(s);
    cout<<-1<<endl;
	return 0;
}
 
/*

5 3 0
00000


*/

Compilation message

lyuboyn.cpp: In function 'void print(int)':
lyuboyn.cpp:49:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.length();i++)
                 ~^~~~~~~~~~~
lyuboyn.cpp: In function 'void dfs(int)':
lyuboyn.cpp:59:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(path.size()==(1<<n) && is[(path[0]^v)])
        ~~~~~~~~~~~^~~~~~~~
lyuboyn.cpp:62:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<path.size();i++)
                     ~^~~~~~~~~~~~
lyuboyn.cpp:67:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<d.size();i++)
                 ~^~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB The values in the output sequence are not pairwise distinct!

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 31.0

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

Subtask #8
0 / 17.0

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