結果

問題 No.934 Explosive energy drink
ユーザー ningenMeningenMe
提出日時 2019-11-30 03:21:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 334 ms / 2,000 ms
コード長 3,269 bytes
コンパイル時間 1,915 ms
コンパイル使用メモリ 168,232 KB
実行使用メモリ 24,408 KB
平均クエリ数 709.58
最終ジャッジ日時 2023-09-23 19:07:24
合計ジャッジ時間 6,307 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
24,036 KB
testcase_01 AC 332 ms
24,288 KB
testcase_02 AC 26 ms
24,264 KB
testcase_03 AC 168 ms
24,408 KB
testcase_04 AC 333 ms
23,364 KB
testcase_05 AC 26 ms
23,508 KB
testcase_06 AC 25 ms
24,012 KB
testcase_07 AC 26 ms
24,012 KB
testcase_08 AC 26 ms
24,276 KB
testcase_09 AC 25 ms
23,616 KB
testcase_10 AC 28 ms
23,376 KB
testcase_11 AC 27 ms
24,012 KB
testcase_12 AC 28 ms
23,976 KB
testcase_13 AC 31 ms
23,412 KB
testcase_14 AC 32 ms
23,784 KB
testcase_15 AC 111 ms
24,000 KB
testcase_16 AC 45 ms
24,216 KB
testcase_17 AC 67 ms
23,364 KB
testcase_18 AC 68 ms
24,168 KB
testcase_19 AC 129 ms
23,376 KB
testcase_20 AC 215 ms
23,616 KB
testcase_21 AC 230 ms
23,340 KB
testcase_22 AC 334 ms
24,228 KB
testcase_23 AC 330 ms
23,412 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	vector<int> A(N+1,-1);
	for(int i = 1; i <= N; ++i){
		cout << "? " << N-1 << endl;
		for(int j = 1; j <= N; ++j){
			if(j==i) continue;
			cout << j;
			if(i == N && j != N-1) cout << " ";
			if(i != N && j != N)   cout << " ";
		}
		cout << endl;
		int a; cin >> a;
		A[i] = !a;
	}
	int ans = 0;
	for(int i = 1; i <= N; ++i) if(A[i]) ans++;
	int cnt = 0;
	cout << "! " << ans << endl;
	for(int i = 1; i <= N; ++i) {
		if(A[i]){
			cnt++;
			cout << i;
			if(cnt!=ans) cout << " ";
		}
	}
	cout << endl;
}
0