oj.uz

Submission #990897

# Submission time Handle Problem Language Result Execution time Memory
990897 2024-05-31T17:55:44 Z ToniB "The Lyuboyn" code (IZhO19_lyuboyn) C++17
97 / 100
 45 ms 6592 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k, t;
string s;

int toInt(string s) {
	int ret = 0;
	for (int i = 0; i < s.length(); ++i) {
		ret <<= 1;
		ret += (s[i] == '1');
	}
	return ret;
}
string toStr(int x) {
	string ret = "";
	for (int i = n - 1; i >= 0; --i) {
		if (x & 1 << i) ret += '1';
		else ret += '0';
	}
	return ret;
}

vector<int> prufer(int lvl) {
	if (lvl == 1) return {0, 1};
	vector<int> ret = prufer(lvl - 1);
	int sz = (int)ret.size();
	for (int i = sz - 1; i >= 0; --i) ret.push_back(ret[i] | (1 << (lvl - 1)));
	return ret;
}

vector<int> gen(int lvl) {
	if (lvl == k + 1) {
		vector<int> ret = prufer(lvl);
		int cur = (1 << lvl) - 1;
		for (int i = 1; i < (int)ret.size(); i += 2) {
			ret[i] ^= cur;
		}
		return ret;
	}
	vector<int> sub = gen(lvl - 1);
	vector<int> ret = sub;
	int cur = 0;
	for (int i = lvl - 1; i >= lvl - k; --i) cur |= 1 << i;
	int nxt = ret.back() ^ cur;
	int dif = sub[0] ^ nxt;
	for (int x : sub) {
		ret.push_back(x ^ dif);
	}
	return ret;
}

int main(){
	cin >> n >> k >> t >> s;

	if (!(k & 1) && t) {
		cout << "-1\n"; return 0;
	}

	vector<int> ans = gen(n);

	cout << (1 << n) << "\n";
	
	int xr = toInt(s);
	for (int x : ans) {
		string cur = toStr(x ^ xr ^ ans[0]);
		cout << cur << "\n";
	}
	
	return 0;
}

Compilation message

lyuboyn.cpp: In function 'int toInt(std::string)':
lyuboyn.cpp:9:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for (int i = 0; i < s.length(); ++i) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Ok

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Ok

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Ok
2 Correct 0 ms 348 KB Ok
3 Incorrect 20 ms 3276 KB Found solution while it does not exist
4 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6592 KB Ok
2 Correct 18 ms 3280 KB Ok
3 Correct 1 ms 344 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Ok
2 Correct 1 ms 604 KB Ok
3 Correct 19 ms 3276 KB Ok
4 Correct 10 ms 1748 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 4 ms 980 KB Ok
8 Correct 0 ms 348 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 6420 KB Ok
2 Correct 37 ms 6580 KB Ok
3 Correct 36 ms 6328 KB Ok
4 Correct 19 ms 3276 KB Ok
5 Correct 19 ms 3280 KB Ok
6 Correct 10 ms 1752 KB Ok
7 Correct 11 ms 1748 KB Ok
8 Correct 4 ms 1116 KB Ok
9 Correct 6 ms 1116 KB Ok
10 Correct 2 ms 604 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 0 ms 348 KB Ok
13 Correct 0 ms 344 KB Ok

Subtask #7
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6592 KB Ok
2 Correct 18 ms 3280 KB Ok
3 Correct 1 ms 344 KB Ok
4 Correct 0 ms 348 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 0 ms 348 KB Ok
7 Correct 1 ms 604 KB Ok
8 Correct 19 ms 3276 KB Ok
9 Correct 10 ms 1748 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 0 ms 348 KB Ok
12 Correct 4 ms 980 KB Ok
13 Correct 0 ms 348 KB Ok
14 Correct 38 ms 6420 KB Ok
15 Correct 37 ms 6580 KB Ok
16 Correct 36 ms 6328 KB Ok
17 Correct 19 ms 3276 KB Ok
18 Correct 19 ms 3280 KB Ok
19 Correct 10 ms 1752 KB Ok
20 Correct 11 ms 1748 KB Ok
21 Correct 4 ms 1116 KB Ok
22 Correct 6 ms 1116 KB Ok
23 Correct 2 ms 604 KB Ok
24 Correct 0 ms 348 KB Ok
25 Correct 0 ms 348 KB Ok
26 Correct 0 ms 344 KB Ok
27 Correct 38 ms 6352 KB Ok
28 Correct 19 ms 3220 KB Ok
29 Correct 45 ms 6568 KB Ok
30 Correct 2 ms 600 KB Ok
31 Correct 0 ms 348 KB Ok
32 Correct 2 ms 604 KB Ok
33 Correct 4 ms 1056 KB Ok
34 Correct 0 ms 348 KB Ok
35 Correct 0 ms 348 KB Ok
36 Correct 0 ms 348 KB Ok
37 Correct 0 ms 348 KB Ok
38 Correct 19 ms 3360 KB Ok

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3280 KB Ok
2 Correct 41 ms 6340 KB Ok
3 Correct 40 ms 6576 KB Ok
4 Correct 2 ms 604 KB Ok
5 Correct 0 ms 348 KB Ok
6 Correct 4 ms 1096 KB Ok
7 Correct 37 ms 6332 KB Ok
8 Correct 0 ms 348 KB Ok
9 Correct 0 ms 348 KB Ok
10 Correct 0 ms 348 KB Ok
11 Correct 9 ms 1808 KB Ok
12 Correct 20 ms 3216 KB Ok