Submission #402707

#	Time	Username	Problem	Language	Result	Execution time	Memory
402707		erray	Bitaro, who Leaps through Time (JOI19_timeleap)	C++11	0 / 100	1 ms	460 KiB

timeleap

// author: erray
#include <bits/stdc++.h>
 
using namespace std;
 template<typename A, typename B> string to_string(pair<A, B> p);
template<typename A, typename B, typename C> string to_string(tuple<A, B, C> t);
template<typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> t);

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(char c) {
  return string("'") + c + "'";
}

string to_string(const char* c) {
  return to_string(string(c));
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template<size_t T> string to_string(bitset<T> bs) {
  return bs.to_string();
}

string to_string(vector<bool> v) {
  string res = "{";
  for (int i = 0; i < int(v.size()); ++i) {
    if (i > 0) {
      res += ", ";
    }
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template<typename T> string to_string(T v) {
  string res = "{";
  for (auto& e : v) {
    if (int(res.size()) > 1) {
      res += ", ";
    }
    res += to_string(e);
  }
  res += "}";
  return res;
}

template<typename A, typename B> string to_string(pair<A, B> p) {
  return '(' + to_string(p.first) + ", " + to_string(p.second) + ')';
}
template<typename A, typename B, typename C> string to_string(tuple<A, B, C> t) {
  return '(' + to_string(get<0>(t)) + ", " + to_string(get<1>(t)) + ", " + to_string(get<2>(t)) + '}';
}
template<typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> t) {
  return '(' + to_string(get<0>(t)) + ", " + to_string(get<1>(t)) + ", " + to_string(get<2>(t)) + ", " + to_string(get<3>(t)) + '}';
}

void debug_out() {
  cerr << endl;
}

template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << "  " << to_string(H);
  debug_out(T...);
}

#ifdef DEBUG
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) void(37)
#endif
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  string a;
  string b;
  cin >> n >> a >> b;
  vector<bool> diff(n);
  for (int i = 0; i < n; ++i) {
    diff[i] = (a[i] != b[i]);
  }
  debug(diff);
  vector<int> dp(n + 1);
  for (int i = 0; i < n; ++i) {
    int res = INT_MAX;
    int set_c = 0;
    int rev_c = 0;
    debug(i);
    for (int j = i; j >= 0; --j) {
      if (diff[j] && (j == i || !diff[j + 1])) {
        ++rev_c;
      } 
      if (j == i || (b[j] != b[j + 1])) {
        ++set_c;
      }
      debug(rev_c, set_c, j);
      res = min(res, dp[j] + min((set_c % 2 ? (set_c + 1) / 2 : set_c / 2 + 1), rev_c));
    }
    dp[i + 1] = res;
  }
  debug(dp);
  cout << dp[n] << '\n';
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 30
• Subtask 3: 0 / 66