結果
問題 | No.2502 Optimization in the Dark |
ユーザー | tokusakurai |
提出日時 | 2023-10-13 21:51:25 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 4,490 bytes |
コンパイル時間 | 1,980 ms |
コンパイル使用メモリ | 201,656 KB |
実行使用メモリ | 24,276 KB |
平均クエリ数 | 4.00 |
最終ジャッジ日時 | 2023-10-13 21:51:32 |
合計ジャッジ時間 | 5,908 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
23,244 KB |
testcase_01 | AC | 25 ms
23,364 KB |
testcase_02 | AC | 24 ms
23,520 KB |
testcase_03 | AC | 24 ms
23,688 KB |
testcase_04 | AC | 25 ms
23,280 KB |
testcase_05 | AC | 25 ms
23,484 KB |
testcase_06 | AC | 24 ms
23,340 KB |
testcase_07 | AC | 26 ms
23,988 KB |
testcase_08 | AC | 26 ms
23,388 KB |
testcase_09 | AC | 24 ms
23,496 KB |
testcase_10 | AC | 25 ms
23,580 KB |
testcase_11 | AC | 25 ms
23,604 KB |
testcase_12 | AC | 25 ms
23,232 KB |
testcase_13 | AC | 25 ms
23,964 KB |
testcase_14 | AC | 25 ms
23,700 KB |
testcase_15 | AC | 24 ms
23,496 KB |
testcase_16 | AC | 24 ms
23,412 KB |
testcase_17 | AC | 26 ms
23,976 KB |
testcase_18 | AC | 25 ms
23,484 KB |
testcase_19 | AC | 24 ms
23,904 KB |
testcase_20 | AC | 25 ms
23,520 KB |
testcase_21 | AC | 25 ms
23,580 KB |
testcase_22 | AC | 25 ms
23,400 KB |
testcase_23 | AC | 25 ms
24,132 KB |
testcase_24 | AC | 26 ms
23,400 KB |
testcase_25 | AC | 25 ms
23,328 KB |
testcase_26 | AC | 25 ms
23,292 KB |
testcase_27 | AC | 25 ms
23,700 KB |
testcase_28 | AC | 25 ms
23,784 KB |
testcase_29 | AC | 24 ms
23,292 KB |
testcase_30 | AC | 26 ms
23,244 KB |
testcase_31 | AC | 25 ms
23,520 KB |
testcase_32 | AC | 25 ms
24,276 KB |
testcase_33 | AC | 25 ms
23,892 KB |
testcase_34 | AC | 25 ms
23,940 KB |
testcase_35 | AC | 25 ms
23,580 KB |
testcase_36 | AC | 25 ms
23,244 KB |
testcase_37 | AC | 38 ms
23,916 KB |
testcase_38 | AC | 25 ms
23,244 KB |
testcase_39 | AC | 25 ms
23,292 KB |
testcase_40 | AC | 25 ms
23,976 KB |
testcase_41 | AC | 25 ms
23,484 KB |
testcase_42 | AC | 26 ms
23,784 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename T> void reorder(vector<T> &a, const vector<int> &ord) { int n = a.size(); vector<T> b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template <typename T> T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template <typename T> T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } // struct io_setup { // io_setup() { // ios_base::sync_with_stdio(false); // cin.tie(NULL); // cout << fixed << setprecision(15); // cerr << fixed << setprecision(15); // } // } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; // judge if a[i][x] >= a[j][y] int query(int i, int x, int j, int y) { cout << "? " << i MM x MM j MM y << endl; string S; cin >> S; return S == "No" ? i : j; } void solve() { int N; cin >> N; int x = query(1, 2 * N, 2, 2 * N); x = query(x, 2 * N, 3, 2 * N); vector<int> v; rep2(i, 1, 4) { if (i != x) v.eb(i); } int y = query(v[0], N, v[1], N); int z = 6 - x - y; vector<int> ans; rep(i, N) ans.eb(x), ans.eb(y); rep(i, N) ans.eb(z), ans.eb(x); rep(i, N) ans.eb(y), ans.eb(z); cout << "! "; print(ans); } int main() { int T = 1; // cin >> T; while (T--) solve(); }