# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
287943 | 2020-09-01T07:07:08 Z | tqbfjotld | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 256 ms | 7040 KB |
#include <bits/stdc++.h> using namespace std; vector<int> seq; vector<int> fl; int main(){ int n,k,t; scanf("%d%d%d",&n,&k,&t); if (k%2==0){ printf("-1"); return 0; } for (int x = 1; x<=(1<<n)/2; x++){ fl.push_back(x&-x); } int cur = 0; for (int x = 0; x<(1<<n); x++){ seq.push_back(cur); //printf("pushed %d\n",cur); if (x>=fl.size()){ cur^=fl[x-fl.size()]; } else cur ^= fl[x]; } int num = 0; for (int x = 0; x<n; x++){ char c; num<<=1; scanf(" %c",&c); num += c-'0'; } int stpos = -1; for (int x = 0; x<seq.size(); x++){ if (seq[x]==num){ stpos = x; } } assert(stpos!=-1); printf("%d\n",1<<n); for (int x = 0; x<(1<<n); x++){ for (int y = n-1; y>=0; y--){ if (seq[(x+stpos)%seq.size()]&(1<<y)){ printf("1"); } else printf("0"); } printf("\n"); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 288 KB | Ok |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Fail, not exactly k bits are different: line = 0 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Ok |
2 | Correct | 1 ms | 256 KB | Ok |
3 | Correct | 1 ms | 256 KB | Ok |
4 | Correct | 0 ms | 256 KB | Ok |
5 | Correct | 1 ms | 256 KB | Ok |
6 | Correct | 0 ms | 256 KB | Ok |
7 | Correct | 0 ms | 256 KB | Ok |
8 | Correct | 1 ms | 256 KB | Ok |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 256 ms | 7016 KB | Ok |
2 | Correct | 121 ms | 3568 KB | Ok |
3 | Correct | 1 ms | 384 KB | Ok |
4 | Correct | 0 ms | 384 KB | Ok |
5 | Correct | 1 ms | 256 KB | Ok |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Fail, not exactly k bits are different: line = 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 255 ms | 7040 KB | Fail, not exactly k bits are different: line = 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 256 ms | 7016 KB | Ok |
2 | Correct | 121 ms | 3568 KB | Ok |
3 | Correct | 1 ms | 384 KB | Ok |
4 | Correct | 0 ms | 384 KB | Ok |
5 | Correct | 1 ms | 256 KB | Ok |
6 | Incorrect | 1 ms | 256 KB | Fail, not exactly k bits are different: line = 0 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 123 ms | 3696 KB | Fail, not exactly k bits are different: line = 0 |
2 | Halted | 0 ms | 0 KB | - |