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 <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include <time.h>
#endif
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;
void solve() {
string a, b;
cin >> a >> b;
auto shorten = [&](string curr) {
string ans = "";
int depth = 0;
for (int i = 0; i < curr.size(); i++) {
if (curr[i] == '1')
ans.push_back('1'), depth++;
else if (curr[i] == '2')
ans.push_back('2'), depth++;
else if (curr[i] == 'U')
ans.pop_back(), depth--;
else if (curr[i] == 'L') {
int curr_depth = depth;
while (ans.back() == '1')
ans.pop_back(), curr_depth--;
ans.pop_back();
ans.push_back('1');
while (curr_depth < depth)
ans.push_back('2'), curr_depth++;
} else if (curr[i] == 'R') {
int curr_depth = depth;
while (ans.back() == '2')
ans.pop_back(), curr_depth--;
ans.pop_back();
ans.push_back('2');
while (curr_depth < depth)
ans.push_back('1'), curr_depth++;
}
}
return ans;
};
a = shorten(a), b = shorten(b);
if (a == b) {
cout << "0\n";
return;
}
if (a > b)
swap(a, b);
int depth_a = a.size(), depth_b = b.size();
int best = INF;
int hor_dist = 0;
for (int depth = 0; depth <= min(depth_a, depth_b); depth++) {
int curr = depth_a - depth + depth_b - depth + hor_dist;
best = min(best, curr);
hor_dist *= 2;
if (a[depth] != b[depth])
hor_dist += a[depth] == '1' ? 1 : -1;
if (hor_dist > 1e6 + 10)
break;
}
cout << best << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
clock_t start = clock();
int test_cases = 1;
// cin >> test_cases;
while (test_cases--)
solve();
#ifdef DEBUG
cerr << fixed << setprecision(10)
<< "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
<< "s\n";
#endif
return 0;
}
Compilation message (stderr)
board.cpp: In lambda function:
board.cpp:100:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
100 | for (int i = 0; i < curr.size(); i++) {
| ~~^~~~~~~~~~~~~
board.cpp: In function 'int main()':
board.cpp:160:11: warning: unused variable 'start' [-Wunused-variable]
160 | clock_t start = clock();
| ^~~~~
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |