# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093596 | IBory | Flip it and Stick it (CCO23_day2problem1) | C++17 | 34 ms | 10432 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
int N = S.size();
if (T == "011" || T == "100") {
reverse(S.begin(), S.end());
reverse(T.begin(), T.end());
}
if (T[0] == '1') {
for (char& c : S) c ^= 1;
for (char& c : T) c ^= 1;
}
int zero = 0;
for (char c : S) zero += (c == '0');
if (T == "01") return Count(S, T);
if (T == "00") {
int lim = (N + 1) / 2;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |