제출 #1093526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093526		IBory	Flip it and Stick it (CCO23_day2problem1)	C++17	8 / 25	3 ms	1344 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int Count(string S, string T) {
	int ret = 0;
	for (int i = 0; i + T.size() <= S.size(); ++i) {
		ret += (S.substr(i, T.size()) == T);
	}
	return ret;
}

int Solve(string S, string T) {
	if (T.size() == 1) return (S.find(T) == string::npos ? 0 : -1);

	if (T[0] == '1') {
		for (char& c : S) c ^= 1;
		for (char& c : T) c ^= 1;
	}

	if (T == "01") return Count(S, T);
	if (T == "00") {
		int lim = (S.size() + 1) / 2, zero = 0;
		for (char c : S) zero += (c == '0');
		if (lim < zero) return -1;
		return Count(S, T);
	}
	

	return 0;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	string S, T;
	cin >> S >> T;
	cout << Solve(S, T);
	return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 7