結果

問題 No.2871 Universal Serial Bus
ユーザー Aging1986
提出日時 2024-09-06 21:38:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,867 bytes
コンパイル時間 2,407 ms
コンパイル使用メモリ 196,228 KB
最終ジャッジ日時 2025-02-24 04:05:57
ジャッジサーバーID
(参考情報)
judge1 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<pdd> vpdd;
typedef vector<vd> vvd;
#define yn(ans) printf("%s\n", (ans)?"Yes":"No");
#define YN(ans) printf("%s\n", (ans)?"YES":"NO");
template<class T> bool chmax(T &a, T b) {
if (a >= b) return false;
a = b; return true;
}
template<class T> bool chmin(T &a, T b) {
if (a <= b) return false;
a = b; return true;
}
#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t))
#define REP(i, e) for (int i = 0; i < (e); ++i)
#define REP1(i, s, e) for (int i = (s); i < (e); ++i)
#define RREP(i, e) for (int i = (e); i >= 0; --i)
#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define qb pop_back
#define pf push_front
#define qf pop_front
#define maxe max_element
#define mine min_element
ll inf = 1e18;
#define DEBUG printf("%d\n", __LINE__); fflush(stdout);
template<class T> void print(vector<T> &v, bool withSize = false) {
if (withSize) cout << v.size() << endl;
REP(i, v.size()) cout << v[i] << " ";
cout << endl;
}
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
int __FAST_IO__ = []() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
return 0;
}();
#define TESTS int t; cin >> t; while (t--)
#define TEST
int main() {
/*
double a = 0, b = 0, c = 0;
double base = 1, p = 1;
REP(i, 1000) {
a += p * (1 - base) * (i + 1);
p *= base;
base /= 2;
}
base = 1, p = 1;
REP(i, 1000) {
b += p * (1 - base) * (2 * i + 1);
p *= base;
base /= 4;
}
base = 0.5, p = 1;
REP(i, 1000) {
c += p * (1 - base) * (2 * (i + 1));
p *= base;
base /= 4;
}
printf("%.12lf %.12lf %.12lf\n", a, b, c);*/
TEST {
int N, M;
cin >> N >> M;
vs v(N), v2(N);
REP(i, N) cin >> v[i];
REP(i, N) cin >> v2[i];
bool ok = true, ok2 = true;
REP(i, N) {
REP(j, M) {
ok &= v[i][j] != v2[i][j];
ok2 &= v[i][j] != v2[N - 1 - i][M - 1 - j];
}
}
double ans = 0;
if (ok && ok2) {
ans = 2.641632560655;
} else if (ok) {
ans = 3.5317401904617327;
} else if (ok2) {
ans = 3.128936827212;
} else {
printf("-1\n");
return 0;
}
printf("%.12lf\n", ans);
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0