結果

問題 No.2018 X-Y-X
ユーザー ecottea
提出日時 2022-07-22 23:08:40
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 15,312 bytes
コンパイル時間 4,506 ms
コンパイル使用メモリ 249,272 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-07-04 07:49:08
合計ジャッジ時間 7,114 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 27 WA * 4
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-16;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
#endif //
//--------------AtCoder --------------
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
//----------------------------------------
int WA(int n, string s, string t) {
vi a(n), b(n);
rep(i, n) {
a[i] = s[i] - 'A';
b[i] = t[i] - 'A';
if (i % 4 >= 2) {
a[i] = 1 - a[i];
b[i] = 1 - b[i];
}
}
// x[i] += x[i-1] + x[i+1]
if (a[0] != b[0] || a[n - 1] != b[n - 1]) return(-1);
int res = 0;
int i = 1;
while (i < n - 1) {
if (a[i] == b[i]) {
i++;
continue;
}
int j = i + 1;
while (j < n) {
if (j % 2 == (i - 1) % 2) {
if (a[i - 1] != a[j]) break;
}
else {
if (a[i] != a[j]) break;
}
if (a[j] == b[j]) return(-1);
a[j] = b[j];
res++;
j++;
}
if (j == n) return(-1);
a[i] = b[i];
res++;
i = j;
}
return res;
}
void zikken() {
int n = 10;
repb(set_s, n) {
string s;
rep(i, n) s += 'A' + ((set_s >> i) & 1);
string s_rev(s);
reverse(all(s_rev));
repb(set_t, n) {
string t;
rep(i, n) t += 'A' + ((set_t >> i) & 1);
string t_rev(t);
reverse(all(t_rev));
int res = WA(n, s, t);
int res_rev = WA(n, s_rev, t_rev);
if (res != res_rev) {
dump("--------");
dump(s, t, res);
dump(s_rev, t_rev, res_rev);
}
}
}
}
//
void zikken2() {
int n = 10;
repb(set_s, n) {
string s;
rep(i, n) s += 'A' + ((set_s >> i) & 1);
repb(set_t, n) {
string t;
rep(i, n) t += 'A' + ((set_t >> i) & 1);
int res = WA(n, s, t);
int res2 = WA(n, t, s);
if (res != res2) {
dump("--------");
dump(s, t, res);
dump(t, s, res2);
}
}
}
}
//
void zikken3() {
int n = 4;
repb(set_s, n) {
string s;
rep(i, n) s += 'A' + ((set_s >> i) & 1);
repb(set_t, n) {
string t;
rep(i, n) t += 'A' + ((set_t >> i) & 1);
int res = WA(n, s, t);
if (res == -1 && s[0] == t[0] && s[n - 1] == t[n - 1]) {
dump(s, t, res);
}
}
}
}
void zikken4() {
int n = 6;
dsu d(1 << n);
repb(set, n) {
rep(i, n - 2) {
if (((set >> i) & 1) == ((set >> (i + 2)) & 1)) {
d.merge(set, set ^ (1 << (i + 1)));
}
}
}
repe(g, d.groups()) {
repe(v, g) cout << bitset<6>(v) << " ";
cout << endl;
}
}
/*
0000 0010 0100
0001 0101 0111
0011
0110
1000 1010 1110
1001
1011 1101 1111
1100
00000 00010 00100 01000 01010 01110
00001 00101 00111 01001
00011 01011 01101 01111
00110
01100
10000 10010 10100 11100
10001 10101 10111 11011 11101 11111
10011
10110 11000 11010 11110
11001
000000 000010 000100 001000 001010 001110 010000 010010 010100 011100
000001 000101 000111 001001 010001 010101 010111 011011 011101 011111
000011 001011 001101 001111 010011
000110 010110 011000 011010 011110
001100
011001
100000 100010 100100 101000 101010 101110 110110 111000 111010 111110
100001 100101 100111 101001 111001
100011 101011 101101 101111 110001 110101 110111 111011 111101 111111
100110
101100 110000 110010 110100 111100
110011
*/
//O(|V|^3)
/*
* g
* i j dist[i][j]
* g false
*/
bool warshall_floyd(const Graph& g, vvi& dist) {
// verify : https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_1_C
//
// min-plus
int n = sz(g);
// dist[i][j] : i j
dist = vvi(n, vi(n, INF));
rep(s, n) dist[s][s] = 0;
rep(s, n) {
repe(e, g[s]) {
// chmin
chmin(dist[s][e], 1);
}
}
rep(k, n) {
// 0 k
rep(i, n) {
rep(j, n) {
//
if (dist[i][k] == INF || dist[k][j] == INF) continue;
// k
// 退
//
chmin(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
// false
rep(i, n) {
if (dist[i][i] < 0) return false;
}
return true;
}
void zikken5() {
int n = 5;
Graph g(1LL << n);
repb(set, n) {
rep(i, n - 2) {
if (((set >> i) & 1) == ((set >> (i + 2)) & 1)) {
g[set].push_back(set ^ (1 << (i + 1)));
}
}
}
vvi dist;
warshall_floyd(g, dist);
rep(i, 1 << n) rep(j, 1 << n) {
if (dist[i][j] == INF) dist[i][j] = -1;
}
repb(set_s, n) {
string s;
rep(i, n) s += 'A' + ((set_s >> i) & 1);
repb(set_t, n) {
string t;
rep(i, n) t += 'A' + ((set_t >> i) & 1);
int res = WA(n, s, t);
if (res != dist[set_s][set_t]) {
dump(s, t, res, dist[set_s][set_t]);
}
}
}
}
/*
AABAA ABBBA -1 4
ABBBA AABAA -1 4
BAAAB BBABB -1 4
BBABB BAAAB -1 4
*/
//Z-
/*
* Lazy_fenwick_tree<S, op, o, inv, mul>(int n) : O(n)
* n o
* Z (S, op, o, inv, mul)
*
* Lazy_fenwick_tree<S, op, e, inv, mul>(vS a) : O(n)
* a
*
* set(int i, S x) : O(log n)
* v[i] = x
*
* S get(int i) : O(log n)
* v[i]
*
* S prod(int l, int r) : O(log n)
* op( v[l..r) ) o()
*
* apply(int i, S x) : O(log n)
* v[i] = op(v[i], x)
*
* apply(int l, int r, S x) : O(log n)
* v[l..r) = op(v[l..r), x)
*/
template <class S, S(*op)(S, S), S(*o)(), S(*inv)(S), S(*mul)(ll, S)>
struct Lazy_fenwick_tree {
// https://algo-logic.info/binary-indexed-tree/
// verify : https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_G
// + 1
int n;
// op( [1..i] ) acc0[i] + i acc1[i]
// acc?[i] = Σraw?[1..i] raw?
// v[?][i] : Σraw?[*..i] i 1-indexedv[?][0] 使
vector<vector<S>> v;
//
Lazy_fenwick_tree() : n(0) {}
// n o
Lazy_fenwick_tree(int n_) : n(n_ + 1), v(2, vector<S>(n, o())) {}
// a
Lazy_fenwick_tree(const vector<S>& v_) : n(sz(v_) + 1), v(2, vector<S>(n, o())) {
//
rep(i, n - 1) v[0][i + 1] = v_[i];
// op()
for (int pow2 = 1; 2 * pow2 < n; pow2 *= 2) {
for (int i = 2 * pow2; i < n; i += 2 * pow2) {
v[0][i] = op(v[0][i], v[0][i - pow2]);
}
}
}
// v[i] = x i : 0-indexed
void set(int i, S x) {
//
S d = op(x, inv(get(i)));
apply(i, d);
}
// v[i] i : 0-indexed
S get(int i) const {
return prod(i, i + 1);
}
// op( v[l..r) ) o l, r : 0-indexed
S prod(int l, int r) const {
// 0-indexed [l, r)
// 1-indexed [l + 1, r]
// [1, r] [1, l]
return op(prod_sub(r), inv(prod_sub(l)));
}
// op( v[1..r] ) o r : 1-indexed
S prod_sub(int r) const {
return op(prod_sub(r, 0), mul(r, prod_sub(r, 1)));
}
// op( v[d][1..r] ) o r : 1-indexed
S prod_sub(int r, int d) const {
S res = o();
// op()
while (r > 0) {
res = op(res, v[d][r]);
// r 1
r -= r & -r;
}
return res;
}
// v[i] = op(v[i], x) i : 0-indexed
void apply(int i, S x) {
// i 1-indexed
i++;
apply_sub(i, x, 0);
}
// v[l..r) = op(v[l..r), x) l, r : 0-indexed
void apply(int l, int r, S x) {
// 0-indexed [l, r)
// 1-indexed [l + 1, r]
l++;
// 調
apply_sub(l, mul(l - 1, inv(x)), 0);
apply_sub(r + 1, mul(r, x), 0);
apply_sub(l, x, 1);
apply_sub(r + 1, inv(x), 1);
}
// v[d][i] = op(v[d][i], x) i : 1-indexed
void apply_sub(int i, S x, int d) {
// op()
while (i < n) {
v[d][i] = op(v[d][i], x);
// i 1
i += i & -i;
}
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Lazy_fenwick_tree& ft) {
rep(i, ft.n - 1) os << ft.get(i) << " ";
return os;
}
#endif
};
// Z-
/* verify : https://atcoder.jp/contests/abc253/tasks/abc253_f */
using S301 = mint;
S301 op301(S301 x, S301 y) { return x + y; }
S301 o301() { return 0; }
S301 inv301(S301 x) { return -x; }
S301 mul301(ll a, S301 x) { return a * x; }
#define Add_Zmodule S301, op301, o301, inv301, mul301
int solve(int n, string s, string t) {
mint::set_mod(2);
vm a(n), b(n);
rep(i, n) {
a[i] = s[i] - 'A';
b[i] = t[i] - 'A';
if (i % 4 >= 2) {
a[i]++; b[i]++;
}
}
// x[i] += x[i-1] + x[i+1]
if (a[0] != b[0] || a[n - 1] != b[n - 1]) return(-1);
Lazy_fenwick_tree<Add_Zmodule> A(a);
int res = 0;
int i = 1; int j = 0;
while (i < n - 1) {
// dump(i,j,res); dump(A); dump(b);
if (A.get(i) == b[i]) {
i++;
continue;
}
chmax(j, i + 1);
while (j < n) {
if (j % 2 == (i - 1) % 2) {
if (A.get(i - 1) != A.get(j)) break;
}
else {
if (A.get(i) != A.get(j)) break;
}
j++;
}
if (j == n) return(-1);
A.apply(i, j, 1);
res += j - i;
i++;
}
return res;
}
void zikken6() {
int n = 6;
Graph g(1LL << n);
repb(set, n) {
rep(i, n - 2) {
if (((set >> i) & 1) == ((set >> (i + 2)) & 1)) {
g[set].push_back(set ^ (1 << (i + 1)));
}
}
}
vvi dist;
warshall_floyd(g, dist);
rep(i, 1 << n) rep(j, 1 << n) {
if (dist[i][j] == INF) dist[i][j] = -1;
}
repb(set_s, n) {
string s;
rep(i, n) s += 'A' + ((set_s >> i) & 1);
repb(set_t, n) {
string t;
rep(i, n) t += 'A' + ((set_t >> i) & 1);
int res = solve(n, s, t);
if (res != dist[set_s][set_t]) {
dump("ERR:", s, t, res, dist[set_s][set_t]);
}
}
}
}
int main() {
input_from_file("input.txt");
// output_to_file("output.txt");
// zikken6(); return 0;
int n; string s, t;
cin >> n >> s >> t;
cout << solve(n, s, t) << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0