oj.uz

Submission #498842

# Submission time Handle Problem Language Result Execution time Memory
498842 2021-12-26T12:49:56 Z nickmet2004 "The Lyuboyn" code (IZhO19_lyuboyn) C++11
97 / 100
 1000 ms 28156 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5;
int n , k , T , M,ok;
string s;
int vis[N];
vector<int> ans,v;
void go(int x){
    ans.emplace_back(x);
    if(ans.size()==(1<<n) &&__builtin_popcount(ans[0] ^ ans.back())==k){
        cout<<(1<<n)<<endl;
        for(int i = 0; i < ans.size();++i){
            for(int j = n-1; ~j; --j)cout << (ans[i]>>j&1);cout<<endl;
        }
        exit(0);
    }
    vis[x]=1;
    for(int y : v){
        if(!vis[x^y])go(x^y);
    }
}
 main (){
ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n>>k>>T>>s;
    for(int i= 0; i < (1<<n); ++i){
        if(__builtin_popcount(i)==k){
            v.emplace_back(i);
        }
    }
    //if(k%2==0){cout<<-1;return 0;}
    int X= 0;
    for(int i = 0; i< s.size(); ++i){
        if(s[i]=='1')X+=(1<<(s.size()-i-1));
    }
   go(X);
   cout<<-1<<endl;

}

Compilation message

lyuboyn.cpp: In function 'void go(int)':
lyuboyn.cpp:10:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   10 |     if(ans.size()==(1<<n) &&__builtin_popcount(ans[0] ^ ans.back())==k){
      |        ~~~~~~~~~~^~~~~~~~
lyuboyn.cpp:12:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int i = 0; i < ans.size();++i){
      |                        ~~^~~~~~~~~~~~
lyuboyn.cpp:13:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   13 |             for(int j = n-1; ~j; --j)cout << (ans[i]>>j&1);cout<<endl;
      |             ^~~
lyuboyn.cpp:13:60: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   13 |             for(int j = n-1; ~j; --j)cout << (ans[i]>>j&1);cout<<endl;
      |                                                            ^~~~
lyuboyn.cpp: At global scope:
lyuboyn.cpp:22:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 |  main (){
      |  ^~~~
lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:32:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0; i< s.size(); ++i){
      |                    ~^~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Ok
2 Correct 44 ms 12216 KB Ok
3 Execution timed out 1088 ms 6384 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 28068 KB Ok
2 Correct 242 ms 14020 KB Ok
3 Correct 2 ms 332 KB Ok
4 Correct 0 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 14 ms 1092 KB Ok
3 Correct 241 ms 14004 KB Ok
4 Correct 121 ms 7116 KB Ok
5 Correct 1 ms 332 KB Ok
6 Correct 3 ms 460 KB Ok
7 Correct 57 ms 3652 KB Ok
8 Correct 1 ms 332 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 505 ms 28084 KB Ok
2 Correct 506 ms 27984 KB Ok
3 Correct 509 ms 28100 KB Ok
4 Correct 248 ms 14136 KB Ok
5 Correct 252 ms 14148 KB Ok
6 Correct 126 ms 7460 KB Ok
7 Correct 122 ms 7164 KB Ok
8 Correct 60 ms 3752 KB Ok
9 Correct 60 ms 3780 KB Ok
10 Correct 31 ms 1952 KB Ok
11 Correct 2 ms 332 KB Ok
12 Correct 2 ms 332 KB Ok
13 Correct 1 ms 332 KB Ok

Subtask #7
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 28068 KB Ok
2 Correct 242 ms 14020 KB Ok
3 Correct 2 ms 332 KB Ok
4 Correct 0 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 14 ms 1092 KB Ok
8 Correct 241 ms 14004 KB Ok
9 Correct 121 ms 7116 KB Ok
10 Correct 1 ms 332 KB Ok
11 Correct 3 ms 460 KB Ok
12 Correct 57 ms 3652 KB Ok
13 Correct 1 ms 332 KB Ok
14 Correct 505 ms 28084 KB Ok
15 Correct 506 ms 27984 KB Ok
16 Correct 509 ms 28100 KB Ok
17 Correct 248 ms 14136 KB Ok
18 Correct 252 ms 14148 KB Ok
19 Correct 126 ms 7460 KB Ok
20 Correct 122 ms 7164 KB Ok
21 Correct 60 ms 3752 KB Ok
22 Correct 60 ms 3780 KB Ok
23 Correct 31 ms 1952 KB Ok
24 Correct 2 ms 332 KB Ok
25 Correct 2 ms 332 KB Ok
26 Correct 1 ms 332 KB Ok
27 Correct 518 ms 28028 KB Ok
28 Correct 245 ms 14032 KB Ok
29 Correct 498 ms 28068 KB Ok
30 Correct 31 ms 2080 KB Ok
31 Correct 2 ms 332 KB Ok
32 Correct 14 ms 1100 KB Ok
33 Correct 59 ms 3760 KB Ok
34 Correct 1 ms 332 KB Ok
35 Correct 0 ms 204 KB Ok
36 Correct 1 ms 332 KB Ok
37 Correct 1 ms 204 KB Ok
38 Correct 249 ms 14060 KB Ok

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 14136 KB Ok
2 Correct 498 ms 27968 KB Ok
3 Correct 499 ms 28128 KB Ok
4 Correct 30 ms 1996 KB Ok
5 Correct 1 ms 332 KB Ok
6 Correct 59 ms 3668 KB Ok
7 Correct 507 ms 28156 KB Ok
8 Correct 2 ms 332 KB Ok
9 Correct 0 ms 204 KB Ok
10 Correct 2 ms 332 KB Ok
11 Correct 121 ms 7144 KB Ok
12 Correct 253 ms 14016 KB Ok