# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
336466 | 2020-12-15T11:25:59 Z | beksultan04 | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 292 ms | 7644 KB |
#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<n;++i){ int x = (1<<i); for (j=v.size()-1;j>=0;--j){ v.pb(x+v[j]); } } cout <<v.size()<<"\n"; for (i=0;i<v.size();++i){ for (j=0;j<n;++j){ if (v[i]&(1<<j)){ cout << 1; } else cout<<0; }endi } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | First number in answer is not x 1 0 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Fail, not exactly k bits are different: line = 0 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Ok |
2 | Correct | 1 ms | 364 KB | Ok |
3 | Correct | 1 ms | 364 KB | Ok |
4 | Correct | 0 ms | 364 KB | Ok |
5 | Correct | 0 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 0 ms | 364 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 280 ms | 7644 KB | Ok |
2 | Correct | 136 ms | 3936 KB | Ok |
3 | Correct | 1 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Fail, not exactly k bits are different: line = 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 292 ms | 7444 KB | First number in answer is not x 44202 0 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 280 ms | 7644 KB | Ok |
2 | Correct | 136 ms | 3936 KB | Ok |
3 | Correct | 1 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Incorrect | 1 ms | 364 KB | Fail, not exactly k bits are different: line = 0 |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 132 ms | 3808 KB | First number in answer is not x 92826 0 |
2 | Halted | 0 ms | 0 KB | - |