oj.uz

Submission #287909

# Submission time Handle Problem Language Result Execution time Memory
287909 2020-09-01T06:24:23 Z dvdg6566 "The Lyuboyn" code (IZhO19_lyuboyn) C++14
11 / 100
 72 ms 7992 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=1001000;
const ll MOD=998244353;

vi V;
int N,K,T,S;

void tobin(int y){
	string x;
	while(y){
		x+=('0' + y%2);
		y/=2;
	}
	while(SZ(x) <N)x+='0';
	reverse(ALL(x));
	cout<<x<<'\n';
}


int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>N>>K>>T>>S;
	if(S!=0&&K!=1){
		cout<<-1;
		return 0;
	}
	V.pb(0);
	for(int i=0;i<N;++i){
		stack<int> tm;
		for(auto i:V)tm.push(i);
		while(SZ(tm)){
			V.pb(tm.top() | (1<<i));
			tm.pop();
		}
	}
	cout<<(1<<N)<<'\n';
	for(auto i:V){
		tobin(i);
	}
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB First number in answer is not x 1 0

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Fail, not exactly k bits are different: line = 0

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 640 KB Found solution while it does not exist
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 7992 KB Ok
2 Correct 35 ms 4080 KB Ok
3 Correct 1 ms 384 KB Ok
4 Correct 1 ms 384 KB Ok
5 Correct 1 ms 384 KB Ok

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Fail, not exactly k bits are different: line = 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 7992 KB Ok
2 Correct 35 ms 4080 KB Ok
3 Correct 1 ms 384 KB Ok
4 Correct 1 ms 384 KB Ok
5 Correct 1 ms 384 KB Ok
6 Incorrect 0 ms 384 KB Fail, not exactly k bits are different: line = 0
7 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -