結果

問題 No.2502 Optimization in the Dark
ユーザー dyktr_06dyktr_06
提出日時 2023-10-13 23:26:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,712 bytes
コンパイル時間 4,340 ms
コンパイル使用メモリ 263,352 KB
実行使用メモリ 25,836 KB
平均クエリ数 4.00
最終ジャッジ日時 2024-09-15 19:18:54
合計ジャッジ時間 7,835 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
24,812 KB
testcase_01 AC 23 ms
24,812 KB
testcase_02 AC 23 ms
24,812 KB
testcase_03 AC 23 ms
24,812 KB
testcase_04 AC 23 ms
24,812 KB
testcase_05 AC 23 ms
24,556 KB
testcase_06 AC 24 ms
24,812 KB
testcase_07 AC 23 ms
24,940 KB
testcase_08 AC 23 ms
25,452 KB
testcase_09 AC 23 ms
25,196 KB
testcase_10 AC 23 ms
25,196 KB
testcase_11 AC 23 ms
24,812 KB
testcase_12 AC 23 ms
24,812 KB
testcase_13 AC 23 ms
24,812 KB
testcase_14 AC 23 ms
24,556 KB
testcase_15 AC 23 ms
24,812 KB
testcase_16 AC 22 ms
24,556 KB
testcase_17 AC 23 ms
25,196 KB
testcase_18 AC 23 ms
25,196 KB
testcase_19 AC 23 ms
25,196 KB
testcase_20 AC 23 ms
24,812 KB
testcase_21 AC 23 ms
25,196 KB
testcase_22 AC 24 ms
25,196 KB
testcase_23 AC 24 ms
24,940 KB
testcase_24 AC 23 ms
25,196 KB
testcase_25 AC 23 ms
24,428 KB
testcase_26 AC 23 ms
25,196 KB
testcase_27 AC 23 ms
24,812 KB
testcase_28 AC 23 ms
25,196 KB
testcase_29 AC 24 ms
24,812 KB
testcase_30 AC 24 ms
24,812 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n;

void input(){
    in(n);
}

void solve(){
    auto q = [](ll i, ll x, ll j, ll y){
        cout << "? " << i << " " << x << " " << j << " " << y << endl;
        string res; in(res);
        return (res == "Yes");
    };

    auto output = [](vll &ans){
        ll s = ans.size();
        cout << "! ";
        rep(i, s){
            if(i) cout << " ";
            cout << ans[i];
        }
        cout << endl;
    };

    ll mn1 = 0, mx2n = 0, el;
    if(q(1, 2 * n, 2, 2 * n)){
        if(q(2, 2 * n, 3, 2 * n)){
            mx2n = 3;
        }else{
            mx2n = 2;
        }
    }else{
        if(q(1, 2 * n, 3, 2 * n)){
            mx2n = 3;
        }else{
            mx2n = 1;
        }
    }

    vll res;
    if(mx2n == 1){
        if(q(2, 1, 3, 1)){
            mn1 = 2;
            el = 3;
        }else{
            mn1 = 3;
            el = 2;
        }
    }else if(mx2n == 2){
        if(q(1, 1, 3, 1)){
            mn1 = 1;
            el = 3;
        }else{
            mn1 = 3;
            el = 1;
        }
    }else if(mx2n == 3){
        if(q(1, 1, 2, 1)){
            mn1 = 1;
            el = 2;
        }else{
            mn1 = 2;
            el = 1;
        }
    }

    vll ans;
    rep(i, 2 * n - 1){
        if(i % 2){
            ans.push_back(mn1);
            ans.push_back(mx2n);
        }else{
            ans.push_back(el);
            ans.push_back(mx2n);
        }
    }
    ans.push_back(mn1);
    ans.push_back(mx2n);

    while((int) ans.size() < 6 * n){
        ans.push_back(mn1);
        ans.push_back(el);
    }
    
    output(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0