oj.uz

Submission #173633

# Submission time Handle Problem Language Result Execution time Memory
173633 2020-01-04T18:16:29 Z RafaelSus "The Lyuboyn" code (IZhO19_lyuboyn) C++14
3 / 100
 1000 ms 13768 KB 
#include <bits/stdc++.h>
 
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;
const ll inf=1e15;
#define pb push_back
const int INF=(0x3f3f3f3f);

int tod(vector<int>a){
  int res=0;
  reverse(a.begin(),a.end());
  for(int i=0;i<a.size();i++){
    res+=a[i]*(1<<i);
  }
  return res;
}

int tod(string s){
  int res=0;
  reverse(s.begin(),s.end());
  for(int i=0;i<s.size();i++){
    res+=(s[i]-'0')*(1<<i);
  }
  return res;
}

string tobin(int x,int h){
  string res="";
  if(x==0){
    res="0";
    while(res.size()<h)res+="0";
    return res;
  }
  while(x){
    if(x%2)res+="1";
    else res+="0";
    x/=2;
  }
  while(res.size()<h)res+="0";
  reverse(res.begin(),res.end());
  return res;
}

void print(vector<int> a){
  for(int i=0;i<a.size();i++)cout<<a[i]<<' ';
  cout << '\n';
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);
 
  int n,k,t;
  cin>>n>>k>>t;
  string s;
  cin>>s;
  if(k%2==0){
    cout<<"-1\n";
    return 0;
  }
  vector<int> a(n,0);
  for(int i=0;i<k;i++)a[i]=1;
  int start=tod(s);
  vector<int>tv;
  tv.pb(start);
  int X=0;
  set<int>st;
  st.insert(tod(s));
  vector<int>b=a;
  int tmp=0;
  vector<int> g;
  if(t==1){
    g.pb(start^tod(a));
    st.insert(start^tod(a));
  }
  while(tv.size()+g.size()<(1<<n)){
    bool ok=false;
    do{
      if(st.find(start^tod(a))!=st.end())continue;
      tv.pb(start^tod(a));
      st.insert(start^tod(a));
      start^=tod(a);
      if(tv.size()+g.size()==(1<<n)){ok=true;break;}
      //cerr<<tv.size()<<'\n';
    }while(prev_permutation(a.begin(),a.end()));
    X++;
    if(ok)break;
    for(int i=0;i<n;i++)a[i]=0;
    for(int i=0;i<k;i++)a[i]=1;
    if(tmp==tv.size()){
      cout<<"-1\n";
      return 0;
    }
    tmp=tv.size();
    //cerr<<tv.size()<<'\n';
  }
  cout<<(1<<n)<<'\n';
  for(int i=0;i<(1<<n);i++){
    cout<<tobin(tv[i],n)<<'\n';
    //cout<<tv[i]<<'\n';
  }
  for(int i=0;i<g.size();i++){
    cout<<tobin(g[i],n)<<'\n';
  }
}

Compilation message

lyuboyn.cpp: In function 'int tod(std::vector<int>)':
lyuboyn.cpp:13:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<a.size();i++){
               ~^~~~~~~~~
lyuboyn.cpp: In function 'int tod(std::__cxx11::string)':
lyuboyn.cpp:22:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<s.size();i++){
               ~^~~~~~~~~
lyuboyn.cpp: In function 'std::__cxx11::string tobin(int, int)':
lyuboyn.cpp:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(res.size()<h)res+="0";
           ~~~~~~~~~~^~
lyuboyn.cpp:40:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(res.size()<h)res+="0";
         ~~~~~~~~~~^~
lyuboyn.cpp: In function 'void print(std::vector<int>)':
lyuboyn.cpp:46:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<a.size();i++)cout<<a[i]<<' ';
               ~^~~~~~~~~
lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:77:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(tv.size()+g.size()<(1<<n)){
         ~~~~~~~~~~~~~~~~~~^~~~~~~
lyuboyn.cpp:84:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(tv.size()+g.size()==(1<<n)){ok=true;break;}
          ~~~~~~~~~~~~~~~~~~^~~~~~~~
lyuboyn.cpp:91:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(tmp==tv.size()){
        ~~~^~~~~~~~~~~
lyuboyn.cpp:103:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<g.size();i++){
               ~^~~~~~~~~

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB More lines are printed!

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 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 376 KB Ok
4 Correct 2 ms 252 KB Ok
5 Correct 2 ms 380 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 380 KB Ok
8 Correct 2 ms 376 KB Ok

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 162 ms 8552 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 162 ms 8552 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 220 ms 6764 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -