oj.uz

답안 #681604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
681604 2023-01-13T12:39:44 Z Karuk "The Lyuboyn" code (IZhO19_lyuboyn) C++14
14 / 100
 504 ms 6368 KB 
#include<bits/stdc++.h>
using namespace std;
int main() {
    int n,k,t;cin>>n>>k>>t;
    int s;cin>>s;if(t!=1 || k%2==0){cout<<-1;return 0;}
    vector<int>a;
    a.push_back(0);
    cout<<(1<<n)<<endl;
    for(int i=0;i<n;i++) {
        vector<int>b=a;
        reverse(b.begin(),b.end());
        for(int j=0;j<b.size();j++)b[j]|=(1<<i);
        for(int j:b)a.push_back(j);
    }
    if(n==0)cout<<0;
    for(int i:a) {
        int k=i;
        for(int j=0;j<n;j++) {
            cout<<k%2;
            k/=2;
        }
        cout<<endl;
    }
    return 0;
}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int j=0;j<b.size();j++)b[j]|=(1<<i);
      |                     ~^~~~~~~~~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB First number in answer is not x 1 0

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Fail, not exactly k bits are different: line = 0
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Ok
2 Correct 1 ms 300 KB Ok
3 Correct 0 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Correct 1 ms 212 KB Ok
7 Correct 0 ms 212 KB Ok
8 Correct 0 ms 212 KB Ok

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 504 ms 6368 KB Ok
2 Correct 242 ms 3288 KB Ok
3 Correct 3 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 504 ms 6368 KB Ok
2 Correct 242 ms 3288 KB Ok
3 Correct 3 ms 212 KB Ok
4 Correct 0 ms 212 KB Ok
5 Correct 1 ms 212 KB Ok
6 Incorrect 1 ms 212 KB Output -1 while solution exists
7 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 243 ms 3252 KB First number in answer is not x 92826 0
2 Halted 0 ms 0 KB -