結果

問題 No.934 Explosive energy drink
ユーザー hitonanodehitonanode
提出日時 2019-11-29 22:18:50
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 322 ms / 2,000 ms
コード長 4,017 bytes
コンパイル時間 1,598 ms
コンパイル使用メモリ 169,244 KB
実行使用メモリ 25,460 KB
平均クエリ数 709.08
最終ジャッジ日時 2024-07-16 18:34:22
合計ジャッジ時間 5,335 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
24,940 KB
testcase_01 AC 189 ms
24,964 KB
testcase_02 AC 21 ms
25,220 KB
testcase_03 AC 102 ms
25,220 KB
testcase_04 AC 322 ms
25,220 KB
testcase_05 AC 23 ms
25,460 KB
testcase_06 AC 21 ms
24,964 KB
testcase_07 AC 21 ms
24,964 KB
testcase_08 AC 20 ms
24,580 KB
testcase_09 AC 20 ms
25,220 KB
testcase_10 AC 21 ms
25,220 KB
testcase_11 AC 21 ms
25,220 KB
testcase_12 AC 23 ms
25,220 KB
testcase_13 AC 24 ms
25,220 KB
testcase_14 AC 24 ms
24,580 KB
testcase_15 AC 103 ms
25,208 KB
testcase_16 AC 33 ms
24,964 KB
testcase_17 AC 48 ms
25,220 KB
testcase_18 AC 49 ms
24,580 KB
testcase_19 AC 81 ms
25,220 KB
testcase_20 AC 131 ms
24,964 KB
testcase_21 AC 134 ms
24,580 KB
testcase_22 AC 189 ms
25,220 KB
testcase_23 AC 195 ms
25,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/



int main()
{
    int N;
    cin >> N;
    vector<int> ans(N, 1);
    REP(d, N)
    {
        ans[d] = 0;
        int t = accumulate(ALL(ans), 0);
        if (t < 2)
        {
            ans[d] = 1;
            continue;
        }
        printf("? %d\n", t);
        REP(i, N) if (ans[i]) printf(" %d", i + 1);
        puts("");
        fflush(stdout);
        cin >> t;
        if (!t) ans[d] = 1;
    }
    printf("! %d\n", accumulate(ALL(ans), 0));
    REP(i, N) if (ans[i]) printf("%d ", i + 1);
    puts("");
}
0