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

提出ソース

結果

問題	No.1306 Exactly 2 Digits
ユーザー	FF256grhy
提出日時	2023-08-24 08:57:21
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	153 ms / 2,000 ms
コード長	7,619 bytes
コンパイル時間	2,856 ms
コンパイル使用メモリ	219,016 KB
実行使用メモリ	24,396 KB
平均クエリ数	1237.78
最終ジャッジ日時	2023-08-24 08:57:42
合計ジャッジ時間	19,174 ms
ジャッジサーバーID （参考情報）	judge12 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 23,976 KB
testcase_01	AC	25 ms 23,436 KB
testcase_02	AC	25 ms 24,384 KB
testcase_03	AC	25 ms 23,448 KB
testcase_04	AC	25 ms 24,336 KB
testcase_05	AC	26 ms 24,360 KB
testcase_06	AC	25 ms 24,024 KB
testcase_07	AC	26 ms 23,844 KB
testcase_08	AC	25 ms 23,352 KB
testcase_09	AC	25 ms 23,352 KB
testcase_10	AC	26 ms 24,048 KB
testcase_11	AC	25 ms 23,448 KB
testcase_12	AC	25 ms 23,508 KB
testcase_13	AC	26 ms 24,336 KB
testcase_14	AC	26 ms 23,400 KB
testcase_15	AC	25 ms 23,988 KB
testcase_16	AC	25 ms 23,388 KB
testcase_17	AC	26 ms 23,508 KB
testcase_18	AC	26 ms 23,544 KB
testcase_19	AC	25 ms 23,976 KB
testcase_20	AC	25 ms 23,664 KB
testcase_21	AC	26 ms 23,832 KB
testcase_22	AC	26 ms 23,520 KB
testcase_23	AC	26 ms 24,012 KB
testcase_24	AC	26 ms 24,276 KB
testcase_25	AC	26 ms 24,348 KB
testcase_26	AC	26 ms 23,832 KB
testcase_27	AC	25 ms 23,856 KB
testcase_28	AC	26 ms 23,664 KB
testcase_29	AC	26 ms 23,928 KB
testcase_30	AC	26 ms 23,412 KB
testcase_31	AC	26 ms 24,336 KB
testcase_32	AC	26 ms 23,976 KB
testcase_33	AC	26 ms 23,988 KB
testcase_34	AC	26 ms 23,988 KB
testcase_35	AC	27 ms 23,436 KB
testcase_36	AC	26 ms 24,036 KB
testcase_37	AC	26 ms 23,400 KB
testcase_38	AC	26 ms 23,844 KB
testcase_39	AC	26 ms 23,424 KB
testcase_40	AC	26 ms 23,856 KB
testcase_41	AC	27 ms 24,276 KB
testcase_42	AC	26 ms 23,652 KB
testcase_43	AC	26 ms 24,060 KB
testcase_44	AC	29 ms 24,036 KB
testcase_45	AC	28 ms 23,988 KB
testcase_46	AC	28 ms 24,012 KB
testcase_47	AC	29 ms 23,988 KB
testcase_48	AC	30 ms 24,252 KB
testcase_49	AC	30 ms 23,568 KB
testcase_50	AC	32 ms 23,820 KB
testcase_51	AC	33 ms 23,400 KB
testcase_52	AC	35 ms 23,952 KB
testcase_53	AC	38 ms 24,384 KB
testcase_54	AC	36 ms 23,520 KB
testcase_55	AC	39 ms 24,372 KB
testcase_56	AC	41 ms 23,424 KB
testcase_57	AC	42 ms 24,000 KB
testcase_58	AC	45 ms 23,520 KB
testcase_59	AC	44 ms 24,276 KB
testcase_60	AC	51 ms 24,372 KB
testcase_61	AC	55 ms 23,640 KB
testcase_62	AC	55 ms 23,364 KB
testcase_63	AC	59 ms 23,640 KB
testcase_64	AC	55 ms 23,412 KB
testcase_65	AC	59 ms 23,628 KB
testcase_66	AC	65 ms 24,036 KB
testcase_67	AC	66 ms 24,264 KB
testcase_68	AC	65 ms 24,060 KB
testcase_69	AC	70 ms 23,448 KB
testcase_70	AC	70 ms 23,412 KB
testcase_71	AC	75 ms 24,348 KB
testcase_72	AC	76 ms 23,640 KB
testcase_73	AC	74 ms 24,396 KB
testcase_74	AC	86 ms 23,640 KB
testcase_75	AC	80 ms 23,604 KB
testcase_76	AC	94 ms 24,360 KB
testcase_77	AC	99 ms 23,352 KB
testcase_78	AC	107 ms 24,036 KB
testcase_79	AC	116 ms 24,276 KB
testcase_80	AC	120 ms 23,640 KB
testcase_81	AC	97 ms 23,640 KB
testcase_82	AC	124 ms 23,412 KB
testcase_83	AC	127 ms 23,400 KB
testcase_84	AC	134 ms 23,652 KB
testcase_85	AC	143 ms 23,820 KB
testcase_86	AC	118 ms 23,976 KB
testcase_87	AC	124 ms 23,820 KB
testcase_88	AC	153 ms 23,556 KB
testcase_89	AC	127 ms 23,616 KB
testcase_90	AC	109 ms 23,844 KB
testcase_91	AC	126 ms 24,084 KB
testcase_92	AC	110 ms 24,024 KB
testcase_93	AC	133 ms 23,556 KB
testcase_94	AC	113 ms 24,036 KB
testcase_95	AC	120 ms 23,856 KB
testcase_96	AC	109 ms 23,628 KB
testcase_97	AC	110 ms 23,640 KB
testcase_98	AC	106 ms 24,048 KB
testcase_99	AC	123 ms 24,360 KB
testcase_100	AC	123 ms 24,336 KB
testcase_101	AC	133 ms 23,364 KB
testcase_102	AC	112 ms 24,312 KB
testcase_103	AC	118 ms 24,360 KB
testcase_104	AC	120 ms 23,364 KB
testcase_105	AC	119 ms 24,396 KB
testcase_106	AC	106 ms 24,336 KB
testcase_107	AC	120 ms 24,336 KB
testcase_108	AC	114 ms 23,832 KB
testcase_109	AC	140 ms 23,364 KB
testcase_110	AC	126 ms 23,640 KB
testcase_111	AC	115 ms 23,556 KB
testcase_112	AC	106 ms 24,036 KB
testcase_113	AC	143 ms 23,640 KB
testcase_114	AC	144 ms 23,628 KB
testcase_115	AC	121 ms 23,988 KB
testcase_116	AC	149 ms 23,568 KB
testcase_117	AC	125 ms 23,400 KB
testcase_118	AC	133 ms 23,388 KB
testcase_119	AC	115 ms 24,048 KB
testcase_120	AC	107 ms 23,592 KB
testcase_121	AC	129 ms 23,592 KB
testcase_122	AC	128 ms 23,628 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
template<typename A>             istream & operator>>(istream & is, vector<A>          & v);
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v);
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a);
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a);
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p);
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p);
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t);
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t);
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename A>             istream & operator>>(istream & is, vector<A>          & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p) { return os << p.first << " " << p.second; }
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;

// ---- ----

using P = array<int, 2>;
P operator+(P a, P b) { return { a[0] + b[0], a[1] + b[1] }; }
auto tp = [](P a) -> P { return { a[1], a[0] }; };

int main() {
	int IN(n);
	const int M = n*n - n;
	
	auto ask = [&](int i, int j) {
		out("?", i, j);
		P IN(p);
		return p;
	};
	
	map<P, int> mp;
	inc1(id, M) {
		P pos = ask(id, 1);
		if(mp.count(pos) == 0) { mp[pos] = id; } else { mp[tp(pos)] = id; }
	}
	
	int mi = 1e9, ma = -1e9;
	SF(mp, pos, id) {
		setmin(mi, pos[1]);
		setmax(ma, pos[1]);
	}
	if_not(ma - mi + 1 == n) {
		assert(ma - mi + 1 == n - 1);
		map<P, int> mp2;
		SF(mp, pos, id) { mp2[tp(pos)] = id; }
		mp = mp2;
	}
	
	vector<bool> ok(M + 1, false);
	int base_id = -1;
	P base_pos;
	SF(mp, pos, id) {
		ok[id] = (pos == tp(pos) || mp.count(tp(pos)) == 0);
		if(mp.count(tp(pos)) == 0) { base_id = id; base_pos = pos; }
	}
	assert(base_id != -1);
	
	SF(mp, pos, id) {
		if(ok[id]) { continue; }
		
		P pos2 = ask(base_id, id);
		P pa = pos, pb = tp(pos);
		bool fa = (pa + pos2 == base_pos || pa + tp(pos2) == base_pos);
		bool fb = (pb + pos2 == base_pos || pb + tp(pos2) == base_pos);
		assert(fa != fb);
		if(fb) { swap(mp[pa], mp[pb]); }
		ok[mp[pa]] = ok[mp[pb]] = true;
	}
	
	vector<int> ans(M);
	int c = n;
	SF(mp, pos, id) { ans[id - 1] = c++; }
	out("!", ans);
}

yukicoder

結果

テストケース

ソースコード