oj.uz

Submission #793593

# Submission time Handle Problem Language Result Execution time Memory
793593 2023-07-26T04:27:47 Z 이성호(#10059) Flip it and Stick it (CCO23_day2problem1) C++17
4 / 25
 4 ms 664 KB 
#include <iostream>
#include <string>
using namespace std;
string s, t;
void flip(string &s)
{
    for (int i = 0; i < (int)s.size(); i++) {
        s[i] = s[i] == '0' ? '1' : '0';
    }
}
int main()
{
    cin >> s >> t;
    int n = s.size();
    int k = t.size();
    if (k == 1) {
        bool ouc[2];
        for (int i = 0; i < n; i++) ouc[s[i]-'0'] = true;
        if (ouc[t[0]-'0']) cout << -1;
        else cout << 0;
    }
    else if (k == 2) {
        if (t[0] != t[1]) {
            if (t[0] == '1') flip(s);
            int ans = 0;
            for (int i = n - 1; i >= 0; i--) {
                if (s[i] == '1') continue;
                while (i > 0 && s[i-1] == '0') --i;
                ans++;
            }
            if (s[n-1] == '0') --ans;
            cout << ans;
        }
        else {
            if (t[0] == '1') flip(s);
            int ans = 0;
            int cnt = 0;
            for (int i = 0; i < n; i++) cnt += s[i] == '0';
            if (cnt > (n+1)/2) cout << -1;
            else {
                for (int i = 0; i < n; i++) {
                    if (t[i] == '1') continue;
                    int l = i;
                    while (i + 1 < n && s[i] == s[i+1]) i++;
                    int r = i;
                    ans += r - l;
                }
                cout << ans;
            }
        }
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 612 KB Output is correct
4 Correct 3 ms 664 KB Output is correct
5 Correct 3 ms 612 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 4 ms 612 KB Output is correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 4 ms 612 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 3 ms 664 KB Output is correct
21 Correct 3 ms 612 KB Output is correct
22 Correct 3 ms 612 KB Output is correct
23 Correct 4 ms 612 KB Output is correct
24 Correct 4 ms 612 KB Output is correct
25 Incorrect 0 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -