제출 #379561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379561		farhan132	Lamps (JOI19_lamps)	C++17	0 / 100	1091 ms	27452 KiB

lamp

/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < ll , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

ll dp[6][maxn];

void solve(){

  ll n;
  cin >> n;
  ll a[n+5] , b[n+5];
  string s , t;
  cin >> s >> t;
  ll cur = 1;
  for(ll i = 0; i < n; i++){
    if(cur == 1 || s[i] != s[i-1] || t[i] != t[i-1]){
      a[cur] = s[i] - '0';
      b[cur] = t[i] - '0';
      cur++;
    }
  }
  n = cur-1;
  mem(dp, 0);

  a[0] = b[1] ^ 1 , b[0] = b[1] ^ 1;
  dp[1][0] = dp[2][0] = 1e9;

  for(ll i = 1; i <= n; i++){
    ll mn = n;
    f00(3) dp[j][i] = n , mn = min(mn , dp[j][i-1]);
    dp[1][i] = mn + 1;
    ll cnt = 0;
    for(ll j = i-1; j >= 1; j--){
      cnt += (b[j] != b[j+1]);
      if(b[i] == b[j]){
        dp[1][i] = min(dp[1][i] , dp[1][j] + (cnt/2) );
      }
    }
    if(a[i] == b[i]){
      dp[0][i] = mn;
      dp[2][i] = 2 + mn;
      continue;
    }
    ll cost = 0;
    dp[2][i] = 1 + mn;
    ll go = 0;
    ll group[3];
    group[0] = group[1] = 0;
    for(ll j = i-1; j >= 1; j--){
      if(a[j] != b[j]){
        dp[2][i] = min(dp[2][i] , dp[2][j] + min( cost , min(group[0] , group[1]) + (max(group[0] , group[1]) != 0)) );
      }
      if(j == i-1){
        if(a[j] == b[j]){
          cost++;
          go = 1;
        }
        group[b[j]]++;
        continue;
      }
      if(b[j] == b[j+1]){
        if(go) continue;
        cost++;
        go = 1;
      }else{
        group[b[j]]++;
        if(a[j] == b[j]){
          cost++;
          go = 1;
        }else go = 0;
      }
    }
  }
  ll ans = n;
  for(ll i = 0; i < 3; i++) ans = min(ans , dp[i][n]);

  cout << ans << '\n';

  return;
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
      ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //mem(cnt , 0);
    //mem(dp, 0);
    ll T = 1;
   // cin >> T; 
   // ll CT = 0;
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        solve();
    }
 
    return 0;
}

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