結果

問題 No.934 Explosive energy drink
ユーザー kissshot7kissshot7
提出日時 2020-07-21 14:33:56
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 312 ms / 2,000 ms
コード長 3,415 bytes
コンパイル時間 1,688 ms
コンパイル使用メモリ 170,796 KB
実行使用メモリ 24,372 KB
平均クエリ数 709.58
最終ジャッジ日時 2023-09-24 03:56:01
合計ジャッジ時間 6,531 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
23,880 KB
testcase_01 AC 308 ms
23,376 KB
testcase_02 AC 27 ms
24,180 KB
testcase_03 AC 157 ms
23,556 KB
testcase_04 AC 310 ms
23,652 KB
testcase_05 AC 28 ms
23,412 KB
testcase_06 AC 25 ms
24,312 KB
testcase_07 AC 26 ms
23,820 KB
testcase_08 AC 26 ms
23,616 KB
testcase_09 AC 27 ms
23,652 KB
testcase_10 AC 27 ms
24,372 KB
testcase_11 AC 27 ms
24,372 KB
testcase_12 AC 29 ms
24,036 KB
testcase_13 AC 32 ms
23,652 KB
testcase_14 AC 34 ms
23,640 KB
testcase_15 AC 107 ms
23,580 KB
testcase_16 AC 46 ms
23,424 KB
testcase_17 AC 66 ms
24,300 KB
testcase_18 AC 66 ms
24,024 KB
testcase_19 AC 120 ms
24,372 KB
testcase_20 AC 200 ms
24,000 KB
testcase_21 AC 215 ms
24,360 KB
testcase_22 AC 307 ms
24,012 KB
testcase_23 AC 312 ms
23,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };




void solve() {
    int N; cin >> N;
    vec res(N+1, 0);
    rep1(i, N){
        cout << "? " << N-1 << endl;
        if(i == 1){
            Rep1(j, 2, N){
                if(j != 2) cout << " ";
                cout << j;
            }
            cout << endl;
            cout.flush();
        }else{
            rep1(j, N){
                if(j != i){
                    if(j != 1) cout << " ";
                    cout << j;
                }
            }
            cout << endl;
            cout.flush();
        }
        int ans; cin >> ans;
        res[i] = ans;
    }
    vec ans;
    rep1(i, N) if(res[i] == 0) ans.push_back(i);
    int n = ans.size();
    cout << "! " << n << endl;
    rep(i, n){
        if(i) cout << " ";
        cout << ans[i];
    }
    cout << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}
0