結果

問題 No.1257 変わった平均値
ユーザー hitonanodehitonanode
提出日時 2020-10-16 22:49:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,928 bytes
コンパイル時間 2,090 ms
コンパイル使用メモリ 210,892 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-20 23:09:43
合計ジャッジ時間 8,100 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 236 ms
5,248 KB
testcase_01 AC 236 ms
5,376 KB
testcase_02 AC 237 ms
5,376 KB
testcase_03 AC 232 ms
5,376 KB
testcase_04 AC 237 ms
5,376 KB
testcase_05 AC 231 ms
5,376 KB
testcase_06 AC 242 ms
5,376 KB
testcase_07 AC 234 ms
5,376 KB
testcase_08 AC 244 ms
5,376 KB
testcase_09 AC 252 ms
5,376 KB
testcase_10 AC 241 ms
5,376 KB
testcase_11 AC 245 ms
5,376 KB
testcase_12 AC 233 ms
5,376 KB
testcase_13 AC 233 ms
5,376 KB
testcase_14 AC 234 ms
5,376 KB
testcase_15 AC 234 ms
5,376 KB
testcase_16 AC 234 ms
5,376 KB
testcase_17 AC 232 ms
5,376 KB
testcase_18 AC 230 ms
5,376 KB
testcase_19 AC 237 ms
5,376 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 211 ms
5,376 KB
testcase_23 WA -
testcase_24 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x) {}
#endif

vector<double> A(3), D(3);
vector<pint> ret, tmp;
const double s2 = 1.0 / sqrt(2.0);

void rot(double &x, double &y) {
    double t = (x + y) * s2;
    y = (x - y) * s2;
    x = t;
}

void dfs(vector<double> V, int prv = -1) {
    if (tmp.size() > 8) return;
    if (ret.size() and ret.size() > tmp.size()) return;

    double ma = 0.0;
    REP(d, 3) chmax(ma, abs(V[d] - D[d]));
    if (ma < 1e-5 and (ret.empty() or ret.size() > tmp.size())) {
        ret = tmp;
        return;
    }

    tmp.emplace_back(2, 0);

    if (prv != 5) {
        swap(V[0], V[1]);
        dfs(V, 5);
        swap(V[1], V[2]);
        dfs(V, 5);
        swap(V[0], V[1]);
        dfs(V, 5);
        swap(V[1], V[2]);
        dfs(V, 5);
        swap(V[0], V[1]);
        dfs(V, 5);
        swap(V[1], V[2]);
    }

    REP(d, 3) {
        rot(V[(d + 1) % 3], V[(d + 2) % 3]);
        tmp.back() = pint(1, d);
        dfs(V, d);
        rot(V[(d + 1) % 3], V[(d + 2) % 3]);
    }
    tmp.pop_back();
}
int main()
{
    cin >> A >> D;
    dfs(A);
    if (ret.empty()) {
        puts("No");
        return 0;
    }
    cout << "Yes\n";
    for (auto [a, b] : ret) {
        if (a == 1) {
            cout << a << ' ' << (char)('A' + b) << '\n';
        }
        else cout << 2 << '\n';
    }
}
0