제출 #336723

#제출 시각아이디문제언어결과실행 시간메모리
336723beksultan04"The Lyuboyn" code (IZhO19_lyuboyn)C++14
100 / 100
131 ms9736 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 5e5+12,INF=1e9+7;
int q[N],p[N],dp[N];
main(){
    int n,k,t,i,j;
    scan3(n,k,t)
    string s;
    cin>>s;
    if (k%2==0){
        cout <<-1;
        ret 0;
    }
    vector <int> v;
    v.pb(0);
    v.pb(1);
    for (i=1;i<=k;++i){
        int x = (1<<i);
        for (j=v.size()-1;j>=0;--j){
            v.pb(x+v[j]);
        }
    }
    int x = (1<<i)-1;
    for (i=0;i<v.size();++i){
        if (i%2)v[i]^=x;
    }

    for (i=k+1;i<n;++i){
        int x = (1<<i),xr = (1<<(k-1))-1;
        for (j=v.size()-1;j>=0;--j){
            v.pb(x+v[j]^xr);
        }
    }





























///Answer

    cout <<v.size()<<"\n";
    int cnt = v.size();
    for (i=0;i<cnt;++i){
        v.pb(v[i]);
    }
    bool f=0;
    for (i=0;i<v.size();++i){
        if (cnt ==0)break;
        string t="";
        for (j=0;j<n;++j){
            if (v[i]&(1<<j)){
                t+='1';
            }
            else t+='0';
        }
        if (s == t)f=1;
        if (f){
            cout <<t<<"\n";cnt--;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp:18:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main(){
      |      ^
lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:37:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (i=0;i<v.size();++i){
      |              ~^~~~~~~~~
lyuboyn.cpp:44:19: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   44 |             v.pb(x+v[j]^xr);
lyuboyn.cpp:84:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (i=0;i<v.size();++i){
      |              ~^~~~~~~~~
lyuboyn.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:20:5: note: in expansion of macro 'scan3'
   20 |     scan3(n,k,t)
      |     ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...