#589285 (C++17) No.1306 Exactly 2 Digits

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	kcvlex
提出日時	2020-12-04 22:13:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,728 bytes
コンパイル時間	1,974 ms
コンパイル使用メモリ	162,864 KB
実行使用メモリ	25,460 KB
平均クエリ数	1236.78
最終ジャッジ日時	2024-07-17 09:41:07
合計ジャッジ時間	15,841 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 25,184 KB
testcase_01	AC	24 ms 25,452 KB
testcase_02	AC	23 ms 25,220 KB
testcase_03	AC	23 ms 24,836 KB
testcase_04	AC	23 ms 25,220 KB
testcase_05	AC	23 ms 24,836 KB
testcase_06	AC	24 ms 24,580 KB
testcase_07	AC	22 ms 24,964 KB
testcase_08	AC	23 ms 24,836 KB
testcase_09	AC	23 ms 25,220 KB
testcase_10	AC	23 ms 25,460 KB
testcase_11	WA	-
testcase_12	AC	24 ms 24,580 KB
testcase_13	AC	23 ms 25,196 KB
testcase_14	WA	-
testcase_15	AC	23 ms 24,812 KB
testcase_16	AC	23 ms 24,812 KB
testcase_17	AC	23 ms 24,940 KB
testcase_18	AC	23 ms 25,196 KB
testcase_19	AC	23 ms 24,940 KB
testcase_20	AC	24 ms 25,196 KB
testcase_21	AC	23 ms 25,196 KB
testcase_22	AC	24 ms 25,196 KB
testcase_23	AC	24 ms 24,556 KB
testcase_24	AC	24 ms 24,556 KB
testcase_25	AC	24 ms 24,812 KB
testcase_26	AC	23 ms 25,196 KB
testcase_27	AC	23 ms 24,812 KB
testcase_28	AC	24 ms 24,556 KB
testcase_29	AC	23 ms 24,940 KB
testcase_30	AC	24 ms 24,940 KB
testcase_31	AC	22 ms 24,812 KB
testcase_32	AC	24 ms 24,940 KB
testcase_33	AC	24 ms 25,196 KB
testcase_34	AC	23 ms 24,812 KB
testcase_35	AC	23 ms 25,196 KB
testcase_36	AC	24 ms 25,196 KB
testcase_37	AC	25 ms 25,180 KB
testcase_38	AC	24 ms 24,940 KB
testcase_39	AC	25 ms 24,812 KB
testcase_40	AC	24 ms 25,452 KB
testcase_41	AC	25 ms 24,812 KB
testcase_42	AC	24 ms 25,196 KB
testcase_43	AC	25 ms 24,812 KB
testcase_44	AC	25 ms 24,940 KB
testcase_45	AC	26 ms 25,196 KB
testcase_46	AC	26 ms 24,544 KB
testcase_47	AC	28 ms 25,196 KB
testcase_48	AC	28 ms 25,196 KB
testcase_49	AC	28 ms 24,940 KB
testcase_50	AC	30 ms 24,812 KB
testcase_51	AC	31 ms 24,556 KB
testcase_52	AC	32 ms 25,452 KB
testcase_53	AC	36 ms 25,196 KB
testcase_54	AC	35 ms 25,196 KB
testcase_55	AC	37 ms 25,196 KB
testcase_56	AC	37 ms 24,812 KB
testcase_57	AC	39 ms 25,452 KB
testcase_58	AC	41 ms 24,556 KB
testcase_59	AC	40 ms 24,556 KB
testcase_60	AC	48 ms 24,556 KB
testcase_61	AC	50 ms 25,196 KB
testcase_62	AC	50 ms 25,196 KB
testcase_63	AC	54 ms 24,812 KB
testcase_64	AC	53 ms 25,196 KB
testcase_65	AC	56 ms 24,812 KB
testcase_66	AC	61 ms 24,812 KB
testcase_67	AC	62 ms 24,812 KB
testcase_68	AC	62 ms 24,812 KB
testcase_69	AC	66 ms 25,196 KB
testcase_70	AC	65 ms 24,556 KB
testcase_71	AC	68 ms 24,940 KB
testcase_72	AC	69 ms 25,196 KB
testcase_73	AC	69 ms 24,812 KB
testcase_74	AC	79 ms 25,196 KB
testcase_75	AC	76 ms 25,196 KB
testcase_76	AC	85 ms 24,556 KB
testcase_77	AC	92 ms 24,556 KB
testcase_78	AC	98 ms 25,196 KB
testcase_79	AC	104 ms 25,196 KB
testcase_80	AC	111 ms 24,812 KB
testcase_81	AC	89 ms 24,928 KB
testcase_82	AC	111 ms 24,556 KB
testcase_83	AC	114 ms 25,196 KB
testcase_84	AC	122 ms 24,556 KB
testcase_85	AC	127 ms 25,196 KB
testcase_86	AC	107 ms 25,196 KB
testcase_87	AC	113 ms 25,196 KB
testcase_88	AC	136 ms 25,196 KB
testcase_89	AC	115 ms 24,940 KB
testcase_90	AC	101 ms 24,812 KB
testcase_91	AC	111 ms 24,812 KB
testcase_92	AC	102 ms 25,196 KB
testcase_93	AC	118 ms 25,196 KB
testcase_94	AC	102 ms 24,812 KB
testcase_95	AC	108 ms 24,556 KB
testcase_96	AC	99 ms 24,940 KB
testcase_97	AC	98 ms 24,556 KB
testcase_98	AC	94 ms 25,196 KB
testcase_99	AC	112 ms 24,812 KB
testcase_100	AC	113 ms 24,812 KB
testcase_101	AC	121 ms 25,196 KB
testcase_102	AC	102 ms 25,196 KB
testcase_103	AC	107 ms 24,940 KB
testcase_104	AC	108 ms 24,556 KB
testcase_105	AC	109 ms 24,556 KB
testcase_106	AC	98 ms 24,556 KB
testcase_107	AC	110 ms 24,812 KB
testcase_108	AC	104 ms 24,812 KB
testcase_109	AC	123 ms 25,196 KB
testcase_110	AC	101 ms 24,556 KB
testcase_111	AC	105 ms 25,196 KB
testcase_112	AC	94 ms 24,556 KB
testcase_113	AC	131 ms 25,172 KB
testcase_114	AC	132 ms 24,812 KB
testcase_115	AC	109 ms 24,556 KB
testcase_116	AC	138 ms 24,812 KB
testcase_117	AC	113 ms 24,556 KB
testcase_118	AC	121 ms 24,812 KB
testcase_119	AC	105 ms 25,196 KB
testcase_120	AC	97 ms 24,556 KB
testcase_121	AC	120 ms 25,196 KB
testcase_122	AC	114 ms 25,196 KB

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

ソースコード

raw source code

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }


constexpr size_type SIZE = 104;
constexpr size_type offset = SIZE / 2;
mdarray<vec<int>, SIZE, SIZE> qres;

pii query(int i, int j) {
    std::cout << "? " << i + 1 << " " << j + 1 << "\n" << std::flush;
    int p, q;
    std::cin >> p >> q;
    return pii(p, q);
}

const vec<int>& get_res(int p, int q) {
    return qres[p + offset][q + offset];
}

void set_res(int p, int q, int i) {
    qres[p + offset][q + offset].push_back(i);
}

int main() {
    int n;
    std::cin >> n;
    vec<tii> res;
    res.reserve(n * n - n - 1);
    for (int i = 1; i < n * n - n; i++) {
        auto [ p, q ] = query(0, i);
        res.emplace_back(p, q, i);
        set_res(p, q, i);
    }
    std::sort(ALL(res));

    auto exec = [&](int u, int v) {
        int v1 = u / n - v / n;
        int v2 = u % n - v % n;
        if (v1 > v2) std::swap(v1, v2);
        return pii(v1, v2);
    };

    vec<int> ans(n * n - n, -1);
    int v00 = -1, v01 = -1;
    int idx10, idx99;
    {
        auto [ p, q, i ] = res.front();
        if (p < 0 || q < 0) {
            ans[i] = n * n - 1;
            idx99 = i;
        } else {
            ans[0] = n * n - 1;
            idx99 = 0;
            v00 = v01 = n - 1;
        }
        if (p == q) v00 = v01 = p + (n - 1);
    }

    
    {
        auto [ p, q, i ] = res.back();
        if (0 <= p && 0 <= q) {
            ans[i] = n;
            idx10 = i;
            if (v00 == -1) {
                int tmp = (p + 1) * n + q;
                auto rres = pii(std::get<0>(res.front()), std::get<1>(res.front()));
                if (exec(tmp, n * n - 1) == rres) {
                    v01 = p + 1;
                    v00 = q;
                } else {
                    v01 = q + 1;
                    v00 = p;
                }
            }
        } else {
            ans[0] = n;
            idx10 = 0;
            v00 = 0;
            v01 = 1;
        }
    }
    ans[0] = v01 * n + v00;

    auto check = [&](int v0, int v1) {
        auto cnts = make_v<int>(SIZE, SIZE);
        for (int v = n; v < n * n; v++) {
            int p = v1 - v / n;
            int q = v0 - v % n;
            if (p == 0 && q == 0) continue;
            if (p > q) std::swap(p, q);
            cnts[p + offset][q + offset]++;
        }
        for (int i = -n; i <= n; i++) for (int j = -n; j <= n; j++) {
            if (get_res(i, j).size() != cnts[i + offset][j + offset]) return false;
        }
        return true;
    };

    if (!check(v00, v01)) std::swap(v00, v01);

    auto valid = [&](int v0, int v1) {
        return 0 <= v0 && v0 < n &&
               1 <= v1 && v1 < n;
    };

    auto get_valid_v = [&](int d1, int d0, int ov1, int ov0) {
        int v0 = ov0 - d0, v1 = ov1 - d1;
        if (valid(v0, v1)) return v1 * n + v0;
        return (ov1 - d0) * n + (ov0 - d1);
    };

    for (int i = -n; i <= n; i++) for (int j = -n; j <= n; j++) {
        vec<int> rij;
        for (int e : get_res(i, j)) if (ans[e] == -1) rij.push_back(e);
        if (rij.empty()) continue;
        if (rij.size() == 1) {
            int tv0 = v00 - i, tv1 = v01 - j;
            if (valid(tv0, tv1)) ans[rij[0]] = tv1 * n + tv0;
            else ans[rij[0]] = (v01 - i) * n + (v00 - j);
        } else {
            int idx = (idx10 == 0 ? idx99 : idx10);
            int val = (idx10 == 0 ? n * n - 1 : n);
            auto [ p, q ] = query(idx, rij[0]);
            int vc0 = v00 - i, vc1 = v01 - j, vc = vc1 * n + vc0;
            int rvc0 = v00 - j, rvc1 = v01 - i, rvc = rvc1 * n + rvc0;
            if (exec(val, vc) != pii(p, q)) std::swap(rij[0], rij[1]);
            ans[rij[0]] = vc;
            ans[rij[1]] = rvc;
        }
    }

    std::cout << "!";
    for (int e : ans) std::cout << ' ' << e;
    std::cout << "\n" << std::flush;
    return 0;
}

yukicoder

結果

テストケース

ソースコード