#573488 (C++17) No.1274 楽しい格子点

提出ソース

結果

問題	No.1274 楽しい格子点
ユーザー	iiljj
提出日時	2020-10-30 23:37:08
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,547 bytes
コンパイル時間	2,525 ms
コンパイル使用メモリ	217,592 KB
実行使用メモリ	15,236 KB
最終ジャッジ日時	2024-07-22 03:16:36
合計ジャッジ時間	14,324 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	192 ms 12,836 KB
testcase_01	AC	4 ms 6,944 KB
testcase_02	WA	-
testcase_03	AC	216 ms 15,120 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	202 ms 14,076 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	162 ms 11,072 KB
testcase_23	AC	217 ms 14,992 KB
testcase_24	AC	145 ms 10,112 KB
testcase_25	AC	178 ms 11,916 KB
testcase_26	AC	204 ms 13,964 KB
testcase_27	AC	173 ms 11,644 KB
testcase_28	AC	213 ms 14,884 KB
testcase_29	AC	201 ms 14,312 KB
testcase_30	AC	206 ms 14,004 KB
testcase_31	AC	203 ms 13,512 KB
testcase_32	AC	148 ms 10,112 KB
testcase_33	AC	163 ms 11,136 KB
testcase_34	AC	147 ms 10,496 KB
testcase_35	AC	149 ms 10,240 KB
testcase_36	AC	189 ms 12,556 KB
testcase_37	AC	161 ms 11,024 KB
testcase_38	AC	200 ms 13,840 KB
testcase_39	AC	174 ms 11,676 KB
testcase_40	AC	214 ms 14,828 KB
testcase_41	AC	188 ms 12,996 KB
testcase_42	AC	200 ms 13,808 KB
testcase_43	AC	210 ms 14,764 KB
testcase_44	AC	197 ms 12,888 KB
testcase_45	AC	217 ms 15,236 KB
testcase_46	AC	166 ms 11,276 KB
testcase_47	AC	211 ms 14,860 KB
testcase_48	AC	214 ms 15,056 KB
testcase_49	WA	-
testcase_50	AC	156 ms 10,728 KB
testcase_51	AC	161 ms 10,988 KB
testcase_52	AC	2 ms 6,940 KB
testcase_53	AC	3 ms 6,940 KB
testcase_54	AC	2 ms 6,940 KB
testcase_55	AC	15 ms 6,940 KB
testcase_56	AC	8 ms 6,940 KB
testcase_57	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region Head */

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

// Problem
void solve() {
    VAR(ll, a, b); //
    // a = abs(a), b = abs(b);
    const vll dx = {a, a, -a, -a, b, b, -b, -b};
    const vll dy = {b, -b, b, -b, a, -a, a, -a};

    ld ans = 0;
    int cnt = 0;
    set<pll> memo;
    pqa<pair<ll, pll>> que;
    pll start = {1, 1};
    que.emplace(1, start);
    memo.insert(start);

    // ll boundary = 100'000ll;
    ll boundary = max({100ll, abs(a) * 2, abs(b) * 2});

    while (cnt < 100'000 && !que.empty()) {
        auto [x, y] = que.top().second;
        que.pop();
        ld sum = x + y;
        ans += 1.0l / powl(sum, sum);
        // dump(x, y, sum, ans, que.size(), cnt);
        assert(que.size() < 100'000 * 8 * 2);
        cnt++;
        REP(i, 0, 8) {
            pll key = {x + dx[i], y + dy[i]};
            // dump(key);
            if (key.first > boundary || key.second > boundary) continue;
            if (key.first <= 0 || key.second <= 0) continue;
            if (memo.count(key)) continue; // もう見た
            // dump(key);
            memo.insert(key);
            que.emplace(x + dx[i] + y + dy[i], key);
        }
    }
    cout << ans << endl;
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード