# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102125 | tpoppo | Lamps (JOI19_lamps) | C++14 | 72 ms | 26084 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;
const int MAXN = 1e6 + 100;
int n;
string a,b;
int dp[MAXN][2][3];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cin >> n;
cin >> a >> b;
memset(dp,0x66,sizeof(dp));
for(int inv=0;inv<2;inv++) {
for(int z=0;z<3;z++) {
dp[0][inv][z] = (inv == 1) + (z != 2);
}
}
for(int i=0;i<=n;i++) {
for(int inv=0;inv<2;inv++) {
for(int z=0;z<3;z++) {
//cout<<setw(10)<<dp[i][inv][z]<<" ";
if(b[i] == '0') dp[i+1][inv][0] = min(dp[i+1][inv][0],dp[i][inv][z] + (z != 0) );
if(b[i] == '0') dp[i+1][!inv][0] = min(dp[i+1][!inv][0],dp[i][!inv][z] + 1 + (z != 0) );
# | 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... |