Submission #473983

#	Time	Username	Problem	Language	Result	Execution time	Memory
473983		NhatMinh0208	Lamps (JOI19_lamps)	C++14	100 / 100	127 ms	35752 KiB

lamp

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int s1,s2,s3,s4;
string sa,sb;
int ar[1000001];
int br[1000001];
int dp[1000001][3][2];
int main()
{
	fio;
    cin>>n;
    cin>>sa>>sb;
    for (i=0;i<n;i++) {
        ar[i]=sa[i]-48;
        br[i]=sb[i]-48;
    }
    for (i=0;i<=n;i++) {
        dp[i][0][0]=1e9;
        dp[i][0][1]=1e9;
        dp[i][1][0]=1e9;
        dp[i][1][1]=1e9;
        dp[i][2][0]=1e9;
        dp[i][2][1]=1e9;
    }
    dp[0][2][0]=0;
    for (i=0;i<n;i++) for (s1=0;s1<3;s1++) for (s2=0;s2<2;s2++) for (s3=0;s3<2;s3++) {
        if (dp[i][s1][s2]>=1e9) continue;
        if (s2 && i) br[i-1]^=1;
        if (s3) br[i]^=1; 

        u=dp[i][s1][s2];
        if (s2==0 && s3==1) u++;


        if (ar[i]==br[i]) {
            dp[i+1][2][s3]=min(dp[i+1][2][s3],u);
        }

        if (s1==2) {
            dp[i+1][0][s3]=min(dp[i+1][0][s3],u+1);
        } else {
            v=br[i]^br[i-1];
            s1^=v;
            if (s1==1 && v==1) {
                dp[i+1][s1][s3]=min(dp[i+1][s1][s3],u+1);
            } else {
                dp[i+1][s1][s3]=min(dp[i+1][s1][s3],u);
            }
            s1^=v;
        }

        if (s2 && i) br[i-1]^=1;
        if (s3) br[i]^=1; 
    }
    a=1e9;
    for (i=0;i<3;i++) for (j=0;j<2;j++) a=min(a,dp[n][i][j]);
    cout<<a;
}
// N;

Compilation message (stderr)

lamp.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 4 / 4
• Subtask 4: 49 / 49