제출 #378727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378727		VROOM_VARUN	Lamps (JOI19_lamps)	C++14	100 / 100	384 ms	207976 KiB

lamp

/*
ID: varunra2
LANG: C++
TASK: lamps
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

VI conv(string a) {
  VI ret;
  ret.PB(0);
  trav(x, a) {
    if (x == '0')
      ret.PB(0);
    else
      ret.PB(1);
  }
  return ret;
}

int calc(int j, int k, int val) {
  if (j == 1) val = 0;
  if (j == 2) val = 1;
  if (k) val ^= 1;
  return val;
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("lamps.in", "r", stdin);
  // freopen("lamps.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n;
  string a, b;
  cin >> n;
  cin >> a >> b;

  n++;

  auto va = conv(a);
  auto vb = conv(b);

  vector<VVI> dp(n, VVI(3, VI(2, INF)));

  dp[0][0][0] = 0;

  for (int i = 1; i < n; i++) {
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 2; k++) {
        if (calc(j, k, va[i]) == vb[i]) {
          for (int l = 0; l < 3; l++) {
            for (int m = 0; m < 2; m++) {
              int cost1 = 0;
              if (j != 0 and l != j) cost1 = 1;
              int cost2 = 0;
              if (k == 1 and m == 0) cost2 = 1;
              dp[i][j][k] = min(dp[i][j][k], dp[i - 1][l][m] + cost1 + cost2);
            }
          }
        }
      }
    }
  }

  int ret = INF;

  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 2; j++) {
      ret = min(ret, dp[n - 1][i][j]);
    }
  }

  cout << ret << '\n';

  return 0;
}

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