oj.uz

답안 #498827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498827 2021-12-26T12:16:23 Z nickmet2004 "The Lyuboyn" code (IZhO19_lyuboyn) C++11
23 / 100
 339 ms 22848 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n , k , T , M,ok;
string s;
int vis[N];
vector<int> ans,v;
void go(int x){
    if(M==0){ok=1;return;}
    --M;
    vis[x]=1;
    ans.emplace_back(x);
    for(int y : v){
        if(ok)break;
        if(!vis[x^y])go(x^y);
    }return;
}
 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));
    }
   // for(int x : v)cout <<x<<endl;
    M = (1<<n);
    go(X);
    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;
    }

}

Compilation message

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

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Ok

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 1 ms 204 KB Ok
3 Correct 1 ms 460 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 208 KB Ok
6 Correct 0 ms 332 KB Ok
7 Correct 1 ms 336 KB Ok
8 Correct 1 ms 336 KB Ok

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 15816 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 18 ms 836 KB Ok
3 Correct 339 ms 9948 KB Ok
4 Correct 208 ms 5064 KB Ok
5 Correct 1 ms 332 KB Ok
6 Correct 4 ms 460 KB Ok
7 Correct 75 ms 2668 KB Ok
8 Correct 1 ms 332 KB Ok

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 22848 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 15 ms 15816 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 320 ms 9924 KB Ok
2 Runtime error 2 ms 460 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -