oj.uz

Submission #1003846

# Submission time Handle Problem Language Result Execution time Memory
1003846 2024-06-20T18:55:24 Z Hanksburger Lamps (JOI19_lamps) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
int dp[1000005], min1[1000005], min2[1000005], num1[1000005], num2[1000005], ind[1000005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    string s, t;
    cin >> n >> s >> t;
    s.insert(s.begin(), 0);
    t.insert(t.begin(), 0);
    s.insert(s.end(), 0);
    t.insert(t.end(), 0);
    for (int i=1; i<=n; i++)
    {
        num1[i]=(t[i]==t[i+1]?num1[i-1]:num1[i-1]+1);
        num2[i]=(t[i]==t[i-1]?num2[i-1]:num2[i-1]+1);
        ind[i]=(s[i]==t[i]?i:ind[i-1]);
        if (num2[i]&1)
            dp[i]=min1[i-1]+num2[i]/2+1;
        else
            dp[i]=min2[i-1]+num2[i]/2+1;
        min1[i]=min(min1[i-1], dp[i]-num1[i]/2);
        min2[i]=min(min2[i-1], dp[i]-(num1[i]+1)/2);
    }
    cout << dp[n];

}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

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

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -