oj.uz

답안 #181105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
181105 2020-01-09T07:00:24 Z BThero "The Lyuboyn" code (IZhO19_lyuboyn) C++17
5 / 100
 1000 ms 17336 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define S second
#define F first
#define all(x) (x).begin(), (x).end()


using namespace std;

const bool dbg_flg = 1;
#define debug(x) if (dbg_flg) cerr << #x << ' ' << x << '\n'
#define debug_pair(x) if (dbg_flg) cerr << #x << ' ' << x.F << ' ' << x.S << '\n'
 
const int inf = 1e9 + 7;
const int MAXN = (1 << 18) + 5;

int n, k, t;

string st;

string arr[MAXN];

bool used[MAXN];

int f(string a, string b) {
	assert(a.size() == n && b.size() == n);
	int ret = 0;

	for (int i = 0; i < n; ++i) {
		if (a[i] != b[i]) {
			++ret;
		}
	}

	return ret;
}

void printAns() {
	cout << (1 << n) << endl;

	for (int i = 0; i < (1 << n); ++i) {
		cout << arr[i] << endl;
	}

	exit(0);
}

string str(int x) {
	string ret;

	while (x > 0) {
		ret.pb(x % 2 + '0');
		x /= 2;
	}

	while (ret.size() < n) {
		ret.pb('0');
	}

	reverse(ret.begin(), ret.end());
	return ret;
}

void rec(int v) {
	if (v == (1 << n) - 1) {
		if (t == 1) {
			if (f(arr[v], arr[0]) == k) {
				printAns();				
			}			
		}
		else {
			printAns();
		}

        return;             
	}

	for (int x = 0; x < (1 << n); ++x) {
		if (!used[x] && f(arr[v], str(x)) == k) {
			used[x] = 1;
			arr[v + 1] = str(x);
			rec(v + 1);
			used[x] = 0;
		}
	}
}

int bin(string s) {
	reverse(all(s));
	int ret = 0;

	for (int i = 0; i < s.size(); ++i) {
		if (s[i] == '1') {
			ret += (1 << i);
		}
	}

	return ret;
}

int main() {
	
	//~ freopen(".in", "r", stdin);
	//~ freopen(".out", "w", stdout);
	
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> k >> t;
	cin >> st;

	arr[0] = st;
	used[bin(st)] = 1;    
	rec(0);
	return 0;
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from lyuboyn.cpp:1:
lyuboyn.cpp: In function 'int f(std::__cxx11::string, std::__cxx11::string)':
lyuboyn.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(a.size() == n && b.size() == n);
         ~~~~~~~~~^~~~
lyuboyn.cpp:29:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(a.size() == n && b.size() == n);
                          ~~~~~~~~~^~~~
lyuboyn.cpp: In function 'std::__cxx11::string str(int)':
lyuboyn.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (ret.size() < n) {
         ~~~~~~~~~~~^~~
lyuboyn.cpp: In function 'int bin(std::__cxx11::string)':
lyuboyn.cpp:95:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.size(); ++i) {
                  ~~^~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 8540 KB Ok

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8568 KB Ok

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1052 ms 9364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 11020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8572 KB Ok
2 Correct 84 ms 10024 KB Ok
3 Execution timed out 1096 ms 17336 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 16428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 11020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1039 ms 8784 KB Time limit exceeded
2 Halted 0 ms 0 KB -