結果

問題 No.1959 Prefix MinMax
ユーザー xyz2606xyz2606
提出日時 2022-05-27 22:16:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 5,347 bytes
コンパイル時間 2,727 ms
コンパイル使用メモリ 145,736 KB
実行使用メモリ 25,580 KB
平均クエリ数 8.91
最終ジャッジ日時 2024-09-20 17:14:08
合計ジャッジ時間 4,051 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
25,436 KB
testcase_01 AC 19 ms
24,940 KB
testcase_02 AC 18 ms
24,812 KB
testcase_03 AC 19 ms
25,580 KB
testcase_04 AC 20 ms
24,940 KB
testcase_05 AC 20 ms
24,812 KB
testcase_06 AC 20 ms
24,940 KB
testcase_07 AC 34 ms
24,556 KB
testcase_08 AC 35 ms
25,196 KB
testcase_09 AC 36 ms
25,196 KB
testcase_10 AC 36 ms
24,812 KB
testcase_11 AC 35 ms
24,812 KB
testcase_12 AC 35 ms
24,940 KB
testcase_13 AC 35 ms
24,812 KB
testcase_14 AC 35 ms
25,196 KB
testcase_15 AC 34 ms
25,196 KB
testcase_16 AC 35 ms
24,940 KB
testcase_17 AC 35 ms
25,196 KB
testcase_18 AC 35 ms
24,556 KB
testcase_19 AC 35 ms
24,812 KB
testcase_20 AC 35 ms
24,812 KB
testcase_21 AC 36 ms
25,196 KB
testcase_22 AC 36 ms
25,196 KB
testcase_23 AC 35 ms
25,196 KB
testcase_24 AC 36 ms
25,196 KB
testcase_25 AC 36 ms
24,940 KB
testcase_26 AC 36 ms
25,196 KB
testcase_27 AC 36 ms
24,812 KB
testcase_28 AC 37 ms
25,180 KB
testcase_29 AC 37 ms
24,556 KB
testcase_30 AC 35 ms
25,196 KB
testcase_31 AC 36 ms
24,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<chrono>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
#include<type_traits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(chrono::system_clock::now().time_since_epoch().count());
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
    const int maxn = 131072;
    static char buf[maxn],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
    int res(0);
    char c = getchar();
    while(c < '0') c = getchar();
    while(c >= '0') {
        res = res * 10 + (c - '0');
        c = getchar();
    }
    return res;
}
inline LL fastpo(LL x, LL n, LL mod) {
    LL res(1);
    while(n) {
        if(n & 1) {
            res = res * (LL)x % mod;
        }
        x = x * (LL) x % mod;
        n /= 2;
    }
    return res;
}
template<LL mod> struct Num {
	LL a;
	Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }
	Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }
	Num operator * (const Num & b) { return Num{a * b.a % mod}; }
	Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }
	void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}
	void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}
	void operator *= (const Num & b) { a = a * b.a % mod; }
	void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }
	void operator = (const Num & b) { a = b.a; }
	void operator = (const LL & b) { a = b; }
};
template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {
	os << a.a;
	return os;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(LL x, int width = 0) {
	string res;
	if(x == 0) res.push_back('0');
	while(x) {
		res.push_back('0' + x % 10);
		x /= 10;
	}
	while((int)res.size() < width) res.push_back('0');
	reverse(res.begin(), res.end());
	return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
typedef double C;
struct P {
	C x, y;
	void scan() {
		double _x, _y;
		scanf("%lf%lf", &_x, &_y);
		x = _x; y = _y;
	}
	void print() {
		cout << '(' << x << ' ' << y << ')' << endl;
	}
	P operator + (const P & b) const { return P{x + b.x, y + b.y}; }
	P operator - (const P & b) const { return P{x - b.x, y - b.y}; }
	C operator * (const P & b) const { return x * b.y - y * b.x; }
	C operator % (const P & b) const { return x * b.x + y * b.y; }
};
P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int rela[N];
int getr(int x) {
    int p = x;
    while(rela[p] != p) p = rela[p];
    int p1 = p; p = x;
    while(rela[p] != p) {
        int p2 = rela[p];
        rela[p] = p1;
        p = p2;
    }
    return p1;
}
int a[N], b[N], ans[N], _[N], cmp[N];
int debug = 0;
void query() {
	printf("? ");
	for(int i = 1; i < n; i++) {
		printf("%d%c", a[i], i == n ? '\n' : ' ');
	}
	fflush(stdout);
	if(debug) {
		printf("b: ");
		for(int i = 1; i <= n; i++) {
			b[i] = i == 1 ? _[i] : a[i - 1] == 0 ? min(b[i - 1], _[i]) : max(b[i - 1], _[i]);
			printf("%d ", b[i]);
		}
		printf("\n");
	}else {

		for(int i = 1; i <= n; i++) {
			scanf("%d", &b[i]);
		}
	}
}
void answer() {
	printf("! ");
	for(int i = 1; i <= n; i++) {
		printf("%d%c", b[i], i == n ? '\n' : ' ');
	}
	fflush(stdout);
	if(debug) {
		for(int i = 1; i <= n; i++) {
			assert(b[i] == _[i]);
		}
	}else {
	}
}
int main() {
	int t;
	if(debug) {
		t = 2;
	}else {
		scanf("%d", &t);
	}
	for(int qq = 1; qq <= t; qq++) {
		if(debug) {
			n = 10;
			for(int i = 1; i <= n; i++) _[i] = i;
			srand(gene());
			random_shuffle(_ + 1, _ + n + 1);
		}else {
			scanf("%d", &n);
		}
		for(int i = 1; i < n; i++) {
			a[i] = i % 2;
		}
		query();
		for(int i = 1; i <= n; i++) {
			if(i == 1 || b[i] != b[i - 1]) {
				ans[i] = b[i];
			}else {
				ans[i] = -1;
				cmp[i] = a[i - 1] == 0 ? 1 : 0;
			}
		}
		for(int i = 2; i <= n; i++) {
			if(ans[i] == -1) {
				a[i - 1] = cmp[i];
			}else {
				if(i + 1 <= n && (ans[i + 1] != -1 && ans[i + 1] > ans[i] || ans[i + 1] == -1 && cmp[i + 1] == 1)) {
					a[i - 1] = 0;
				}else a[i - 1] = 1;
			}
		}
		query();
		for(int i = 2; i <= n; i++) {
			if(b[i] == b[i - 1]) {
				a[i - 1] ^= 1;
			}
		}
		query();
		answer();
	}
}
0