#588335 (C++17) No.1306 Exactly 2 Digits

• 問題: No.1306 Exactly 2 Digits
• ユーザー: hirakich1000000007
• 提出日時: 2020-12-02 19:22:50
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 139 ms / 2,000 ms
• コード長: 11,049 bytes
• コンパイル時間: 1,545 ms
• コンパイル使用メモリ: 124,300 KB
• 実行使用メモリ: 25,580 KB
• 平均クエリ数: 1236.78
• 最終ジャッジ日時: 2024-07-17 07:39:48
• 合計ジャッジ時間: 15,618 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 24,812 KB
testcase_01	AC	24 ms; 24,556 KB
testcase_02	AC	22 ms; 24,836 KB
testcase_03	AC	23 ms; 25,476 KB
testcase_04	AC	22 ms; 25,220 KB
testcase_05	AC	22 ms; 24,836 KB
testcase_06	AC	23 ms; 24,836 KB
testcase_07	AC	23 ms; 24,580 KB
testcase_08	AC	22 ms; 24,836 KB
testcase_09	AC	22 ms; 24,580 KB
testcase_10	AC	22 ms; 24,836 KB
testcase_11	AC	22 ms; 24,836 KB
testcase_12	AC	22 ms; 24,836 KB
testcase_13	AC	23 ms; 25,196 KB
testcase_14	AC	22 ms; 25,196 KB
testcase_15	AC	24 ms; 25,424 KB
testcase_16	AC	24 ms; 25,196 KB
testcase_17	AC	24 ms; 25,196 KB
testcase_18	AC	24 ms; 25,196 KB
testcase_19	AC	23 ms; 24,812 KB
testcase_20	AC	24 ms; 24,796 KB
testcase_21	AC	23 ms; 24,556 KB
testcase_22	AC	24 ms; 24,812 KB
testcase_23	AC	24 ms; 24,940 KB
testcase_24	AC	23 ms; 24,940 KB
testcase_25	AC	23 ms; 24,940 KB
testcase_26	AC	23 ms; 25,052 KB
testcase_27	AC	23 ms; 24,940 KB
testcase_28	AC	24 ms; 25,472 KB
testcase_29	AC	23 ms; 24,556 KB
testcase_30	AC	24 ms; 25,452 KB
testcase_31	AC	23 ms; 24,940 KB
testcase_32	AC	23 ms; 24,940 KB
testcase_33	AC	24 ms; 24,556 KB
testcase_34	AC	24 ms; 24,812 KB
testcase_35	AC	25 ms; 25,216 KB
testcase_36	AC	23 ms; 24,812 KB
testcase_37	AC	24 ms; 25,580 KB
testcase_38	AC	24 ms; 25,052 KB
testcase_39	AC	26 ms; 25,196 KB
testcase_40	AC	24 ms; 24,812 KB
testcase_41	AC	25 ms; 24,812 KB
testcase_42	AC	24 ms; 24,556 KB
testcase_43	AC	24 ms; 24,952 KB
testcase_44	AC	26 ms; 25,324 KB
testcase_45	AC	25 ms; 24,556 KB
testcase_46	AC	26 ms; 24,812 KB
testcase_47	AC	27 ms; 24,812 KB
testcase_48	AC	28 ms; 25,196 KB
testcase_49	AC	29 ms; 24,556 KB
testcase_50	AC	30 ms; 24,556 KB
testcase_51	AC	31 ms; 24,812 KB
testcase_52	AC	33 ms; 25,196 KB
testcase_53	AC	36 ms; 24,940 KB
testcase_54	AC	34 ms; 24,940 KB
testcase_55	AC	37 ms; 24,940 KB
testcase_56	AC	39 ms; 24,556 KB
testcase_57	AC	42 ms; 25,196 KB
testcase_58	AC	42 ms; 24,812 KB
testcase_59	AC	43 ms; 25,196 KB
testcase_60	AC	47 ms; 24,812 KB
testcase_61	AC	52 ms; 24,812 KB
testcase_62	AC	51 ms; 24,812 KB
testcase_63	AC	55 ms; 24,812 KB
testcase_64	AC	53 ms; 25,196 KB
testcase_65	AC	55 ms; 25,196 KB
testcase_66	AC	62 ms; 24,812 KB
testcase_67	AC	63 ms; 24,940 KB
testcase_68	AC	63 ms; 24,812 KB
testcase_69	AC	67 ms; 25,040 KB
testcase_70	AC	68 ms; 24,812 KB
testcase_71	AC	71 ms; 25,196 KB
testcase_72	AC	70 ms; 24,940 KB
testcase_73	AC	68 ms; 25,196 KB
testcase_74	AC	80 ms; 25,184 KB
testcase_75	AC	77 ms; 24,556 KB
testcase_76	AC	87 ms; 24,556 KB
testcase_77	AC	94 ms; 24,556 KB
testcase_78	AC	99 ms; 25,196 KB
testcase_79	AC	107 ms; 24,556 KB
testcase_80	AC	112 ms; 25,196 KB
testcase_81	AC	91 ms; 24,812 KB
testcase_82	AC	115 ms; 24,556 KB
testcase_83	AC	116 ms; 25,196 KB
testcase_84	AC	126 ms; 25,196 KB
testcase_85	AC	131 ms; 24,812 KB
testcase_86	AC	109 ms; 24,812 KB
testcase_87	AC	116 ms; 25,452 KB
testcase_88	AC	139 ms; 25,016 KB
testcase_89	AC	116 ms; 24,556 KB
testcase_90	AC	104 ms; 24,940 KB
testcase_91	AC	114 ms; 25,196 KB
testcase_92	AC	104 ms; 24,880 KB
testcase_93	AC	122 ms; 24,812 KB
testcase_94	AC	106 ms; 24,556 KB
testcase_95	AC	112 ms; 25,196 KB
testcase_96	AC	103 ms; 25,196 KB
testcase_97	AC	104 ms; 25,196 KB
testcase_98	AC	98 ms; 24,812 KB
testcase_99	AC	115 ms; 25,196 KB
testcase_100	AC	114 ms; 24,940 KB
testcase_101	AC	122 ms; 24,812 KB
testcase_102	AC	105 ms; 24,812 KB
testcase_103	AC	111 ms; 24,812 KB
testcase_104	AC	111 ms; 24,800 KB
testcase_105	AC	114 ms; 25,196 KB
testcase_106	AC	100 ms; 25,192 KB
testcase_107	AC	114 ms; 25,196 KB
testcase_108	AC	108 ms; 24,556 KB
testcase_109	AC	127 ms; 24,556 KB
testcase_110	AC	103 ms; 24,940 KB
testcase_111	AC	106 ms; 24,940 KB
testcase_112	AC	98 ms; 25,196 KB
testcase_113	AC	132 ms; 24,940 KB
testcase_114	AC	133 ms; 25,112 KB
testcase_115	AC	115 ms; 24,556 KB
testcase_116	AC	137 ms; 24,812 KB
testcase_117	AC	114 ms; 24,812 KB
testcase_118	AC	125 ms; 25,196 KB
testcase_119	AC	108 ms; 24,812 KB
testcase_120	AC	101 ms; 24,812 KB
testcase_121	AC	118 ms; 24,836 KB
testcase_122	AC	117 ms; 24,940 KB

コンパイルメッセージ

main.cpp:9:32: warning: option '-Wincompatible-pointer-types' is valid for C/ObjC but not for C++ [-Wpragmas]
    9 | #pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
      |                                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'sll solve()':
main.cpp:458:31: warning: 'id' may be used uninitialized [-Wmaybe-uninitialized]
  458 |                         printf("? %lld %lld\n", list[0], id);
      |                         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:435:21: note: 'id' was declared here
  435 |         sll px, py, id;
      |                     ^~
main.cpp:463:29: warning: 'py' may be used uninitialized [-Wmaybe-uninitialized]
  463 |                         sll mb = (oy + qr.second) - py;
      |                             ^~
main.cpp:435:17: note: 'py' was declared here
  435 |         sll px, py, id;
      |                 ^~
main.cpp:462:29: warning: 'px' may be used uninitialized [-Wmaybe-uninitialized]
  462 |                         sll ma = (ox + qr.first) - px;
      |                             ^~
main.cpp:435:13: note: 'px' was declared here
  435 |         sll px, py, id;
      |             ^~

ソースコード

#if 0
cat <<EOF >mistaken-paste
#endif
// thx Ebi-chan!

// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("O3")

#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>

#define BIG 2000000007LL
#define VERYBIG 200000000000000007LL
#define ULTRABIG 300000000000000000000LL

#define MOD 1000000007LL
#define FOD  998244353LL
#define HOD 1000000009LL
#define IOD  100000007LL
typedef uint64_t ull;
typedef  int64_t sll;

#define N_MAX 1048576

#ifdef __cplusplus
#include <queue>
#include <stack>
// #include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
// #include <functional>
// #include <array>
#include <iostream>

using std::queue;
using std::priority_queue;
using std::stack;
// using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
// using std::get;
// using std::function;
// using std::array;
using std::cin;
using std::cout;
using std::endl;

template <typename T, typename U>
pair<T, U> operator+(pair<T, U> l, pair<T, U> r) {
	return pair<T, U>(l.first + r.first, l.second + r.second);
}

#endif

#ifndef M_PI
#define M_PI 3.14159265358979323846264338327950
#endif

typedef struct {
	sll a;
	sll b;
} hwll;

typedef struct {
	sll a;
	sll b;
	sll c;
} hwllc;

typedef struct {
	hwll a;
	hwll b;
} linell;

typedef struct {
	double a;
	double b;
} hwreal;

sll n, m;
sll h, w;
sll k;
sll q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;

ull umin (ull x, ull y) {
	return (x < y) ? x : y;
}

ull umax (ull x, ull y) {
	return (x > y) ? x : y;
}

sll smin (sll x, sll y) {
	return (x < y) ? x : y;
}

sll smax (sll x, sll y) {
	return (x > y) ? x : y;
}

double dmin (double x, double y) {
	return (x < y) ? x : y;
}

double dmax (double x, double y) {
	return (x > y) ? x : y;
}

ull gcd (ull x, ull y) {
	if (y == 0) {
		return x;
	} else {
		return gcd(y, x % y);
	}
}

ull bitpow (ull a, ull x, ull modulo) {
	ull result = 1;
	while (x) {
		if (x & 1) {
			result *= a;
			result %= modulo;
		}
		x /= 2;
		a = (a * a) % modulo;
	}
	return result;
}

ull divide (ull a, ull b, ull modulo) {
	return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}

ull udiff (ull a, ull b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

sll sdiff (sll a, sll b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

int bitcount (ull n) {
	int result = 0;
	while (n) {
		if (n & 1) result++;
		n /= 2;
	}
	return result;
}

#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)
#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right
#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1

// int32_t pullcomp (const void *left, const void *right) {
// 	ull l = *(ull*)left;
// 	ull r = *(ull*)right;
// 	if (l < r) {
// 		return -1;
// 	}
// 	if (l > r) {
// 		return +1;
// 	}
// 	return 0;
// }
BEGCMP(pullcomp){
	DEFLR(ull);
	CMPRET(l, r);
	return 0;
}
BEGCMP(prevcomp){
	DEFLR(sll);
	CMPRET(r, l);
	return 0;
}
BEGCMP(psllcomp){
	DEFLR(sll);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pcharcomp){
	DEFLR(char);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pdoublecomp){
	DEFLR(double);
	CMPRET(l, r);
	return 0;
}

int32_t pstrcomp (const void *left, const void *right) {
	char* l = *(char**)left;
	char* r = *(char**)right;

	return strcmp(l, r);
}

BEGCMP(phwllABcomp){
	DEFLR(hwll);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}
BEGCMP(phwllREVcomp){
	DEFLR(hwll);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	return 0;
}
BEGCMP(ptriplecomp){
	DEFLR(hwllc);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	CMPRET(l.c, r.c);
	return 0;
}
BEGCMP(ptripleREVcomp){
	DEFLR(hwllc);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	CMPRET(l.c, r.c);
	return 0;
}
BEGCMP(ptripleCABcomp){
	DEFLR(hwllc);
	CMPRET(l.c, r.c);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}
BEGCMP(phwrealcomp){
	DEFLR(hwreal);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}

int32_t pquadcomp (const void *left, const void *right) {
	linell l = *(linell*)left;
	linell r = *(linell*)right;

	sll ac = phwllABcomp(&(l.a), &(r.a));
	if (ac) return ac;
	sll bc = phwllABcomp(&(l.b), &(r.b));
	if (bc) return bc;

	return 0;
}
int32_t pfracomp (const void *left, const void *right) {
	hwll l = *(hwll*)left;
	hwll r = *(hwll*)right;

	CMPRET(l.a * r.b, l.b * r.a);
	return 0;
}
bool isinrange (sll left, sll x, sll right) {
	return (left <= x && x <= right);
}

bool isinrange_soft (sll left, sll x, sll right) {
	return (left <= x && x <= right) || (left >= x && x >= right);
}

void sw (sll *l, sll *r) {
	if (*l == *r) return;
	sll t = *l;
	*l = *r;
	*r = t;
}

void uw (ull *l, ull *r) {
	if (*l == *r) return;
	ull t = *l;
	*l = *r;
	*r = t;
}

ull frac[N_MAX * 10], invf[N_MAX * 10];
void f_init (sll n, sll m) {
	frac[0] = 1;
	for (sll i = 1; i <= n; i++) {
		frac[i] = frac[i - 1] * i % m;
	}

	invf[n] = divide(1, frac[n], m);
	for (sll i = n - 1; i >= 0; i--) {
		invf[i] = invf[i + 1] * (i + 1) % m;
	}
}
ull ncr (sll n, sll r, ull m) {
	if (n < 0 || r < 0 || n < r) return 0;
	return frac[n] * (invf[r] * invf[n - r] % m) % m;
}

sll a[N_MAX * 10];
// ull a[N_MAX + 5];
// sll a[3001][3001];
sll b[N_MAX * 5];
// ull b[N_MAX + 5];
// sll b[3001][3001];
sll c[N_MAX * 5];
sll d[N_MAX * 5];
sll e[N_MAX * 4];
char s[N_MAX + 1];
// char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
char u[N_MAX + 1];
hwll xy[N_MAX];
hwllc tup[N_MAX];
// sll table[3005][3005];
sll table[2005][2005];
ull gin[N_MAX];
// here we go

// ull parent[501910], size[501910], edges[501910];
// void init (ull n) {
// 	for (sll i = 0; i < n; i++) {
// 		parent[i] = i;
// 		size[i] = 1;
// 	}
// }
// sll find (ull x) {
// 	if (parent[x] == x) return x;
// 	return parent[x] = find(parent[x]);
// }
// bool unite (ull v, ull u) {
// 	v = find(v);
// 	u = find(u);

// 	if (v == u) return false;

// 	if (size[v] < size[u]) {
// 		ull tmp = v;
// 		v = u;
// 		u = tmp;
// 	}
// 	size[v] += size[u];
// 	parent[u] = v;
// 	return true;
// }

typedef pair<sll, sll> P;
map<P, vector<sll> > mp;
map<sll, sll> cnt;

sll solve () {
	sll i, j, ki, li;
	// ull result = 0;
	sll result = 0;
	double dresult = 0;
	// ull maybe = 0;
	sll maybe = 0;
	// ull sum = 0;
	sll sum = 0;
	sll item;
	sll *dpcell;

	mp[P(0, 0)].push_back(1LL);
	cnt[0] = 2;

	sll minv = VERYBIG, maxv = -VERYBIG;

	for (i = 2; i <= n * n - n; i++) {
		printf("? %lld %lld\n", i, 1LL);
		fflush(stdout);
		scanf("%lld%lld", &va, &vb);

		mp[P(va, vb)].push_back(i);
		cnt[va]++;
		cnt[vb]++;

		minv = smin(minv, va);
		maxv = smax(maxv, vb);
	}

	sll ox, oy; // ox = 1~N-1, oy = 0~N-1

	if (cnt[minv] == n - 1) {
		oy = -minv;

		for (i = 0; i <= n - 1; i++) cnt[minv + i] -= (n - 1);

		sll collmin = VERYBIG;
		for (auto [key, val] : cnt) {
			// printf("%lld : %lld\n", key, val);
			if (val > 0) collmin = smin(collmin, key);
		}

		ox = -collmin + 1;
	} else {
		oy = (n - 1) - maxv;

		for (i = 0; i <= n - 1; i++) cnt[maxv - i] -= (n - 1);


		sll collmax = -VERYBIG;
		for (auto [key, val] : cnt) {
			// printf("%lld : %lld\n", key, val);
			if (val > 0) collmax = smax(collmax, key);
		}
		ox = (n - 1) - collmax;
	}

	// printf("%lld %lld...\n", ox, oy);

	sll px, py, id;

	for (auto [qr, list] : mp) {
		if (list.size() == 1) {
			if (isinrange(1, ox + qr.first, n - 1) && isinrange(0, oy + qr.second, n - 1)) {
				xy[list[0]].a = ox + qr.first;
				xy[list[0]].b = oy + qr.second;
			} else {
				xy[list[0]].a = ox + qr.second;
				xy[list[0]].b = oy + qr.first;
			}

			if (qr.first != qr.second) {
				id = list[0];
				px = xy[id].a;
				py = xy[id].b;
			}
		}
	}
	for (auto [qr, list] : mp) {
		if (list.size() == 2) {
			// printf("qr: %lld %lld, list: %lld, %lld\n", qr.first, qr.second, list[0], list[1]);

			printf("? %lld %lld\n", list[0], id);
			fflush(stdout);
			scanf("%lld%lld", &va, &vb);

			sll ma = (ox + qr.first) - px;
			sll mb = (oy + qr.second) - py;

			// printf("%lld, %lld ?\n", ma, mb);

			if (ma > mb) {
				sll t = ma;
				ma = mb;
				mb = t;
			}

			if (ma == va && mb == vb) {
				xy[list[0]].a = ox + qr.first;
				xy[list[0]].b = oy + qr.second;

				xy[list[1]].a = ox + qr.second;
				xy[list[1]].b = oy + qr.first;
			} else {
				xy[list[1]].a = ox + qr.first;
				xy[list[1]].b = oy + qr.second;

				xy[list[0]].a = ox + qr.second;
				xy[list[0]].b = oy + qr.first;
			}
		}
	}

	putchar('!');
	for (i = 1; i <= n * n - n; i++) {
		printf(" %lld", xy[i].a * n + xy[i].b);
	}
	putchar('\n');

	// printf("%lld\n", result);
	// printf("%.15f\n", dresult);
	// puts(s);

	return 0;

	success:
	// puts("YES");
	puts("Yes");
	// printf("%lld\n", result);
	// puts("0");
	// puts("First");
	return 0;

	fail:
	// puts("NO");
	puts("No");
	// puts("0");
	// puts("-1");
	// puts("-1 -1 -1");
	// puts(":(");
	return 1;
}

int main (int argc, char *argv[]) {
	int32_t i, j;



	// scanf("%llu", &m);
	// scanf("%lld", &w);
	// scanf("%lld%lld", &h, &w);
	scanf("%lld", &n, &m);
	// scanf("%lld", &k, &n, &m);
	// scanf("%llu%llu", &h, &w);
	// scanf("%lld", &q);
	// scanf("%lld%lld%lld", &va, &vb, &vc, &vd);
	// va--;
	// vb--;
	// scanf("%llu%llu%llu%llu", &ua, &ub, &uc, &ud, &ue);
	// scanf("%s", s);
	// scanf("%s", t);
	// scanf("%s", u);
	// scanf("%lld", &k);
	// scanf("%lld", &m);
	// scanf("%lld", &n);
	// for (i = 0; i < n; i++) {
	// 	// scanf("%s", s[i]);
	// 	// scanf("%lld", &c[i]);
	// 	scanf("%lld", &a[i]);
	// }
	// scanf(" %c", &ch);
	// scanf("%llu", &q);
	for (i = 0; i < 0; i++) {

		// scanf("%lld%lld", &xy[i].a, &xy[i].b);
		// scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
		// scanf("%lld", &c[i]);

		scanf("%lld", &a[i]);
		// scanf("%lld", &b[i]);
		// scanf("%lld", &c[i]);
		// scanf("%lld", &d[i]);
		// scanf("%lld", &e[i]);
		// a[i]--;
		// b[i]--;
		// c[i]--;
		// d[i]--;
		// xy[i].a--;
		// xy[i].b--;
		// tup[i].a--;
		// tup[i].b--;
	}
	// scanf("%lld%lld", &va, &vb);
	// scanf("%llu", &m);
	// scanf("%llu", &q);
	// scanf("%s", t);
	// for (i = 0; i < n; i++) {
	// 	// scanf("%lld%lld", &xy[i].a, &xy[i].b);
	// 	// xy[i].a--;
	// 	// xy[i].b--;
	// 	// scanf("%lld", &a[i], &b[i]);
	// 	// scanf("%lld", &b[i]);
	// 	// a[i]--;
	// 	// b[i]--;
	// 	scanf("%lld", &c[i]);
	// 	// scanf("%lld", &d[i]);
	// 	// scanf("%lld", &e[i]);
	// 	c[i]--;
	// 	// d[i]--;
	// }

	// for (i = 0; i < q; i++) {
	// 	// scanf("%lld%lld", &xy[i].a, &xy[i].b);
	// 	scanf("%lld", &c[i]);
	// 	// xy[i].a--;
	// 	// xy[i].b--;
	// }

	// for (i = 0; i < h; i++) {
	// 	for (j = 0; j < w; j++) {
	// 		scanf("%lld", &table[i][j]);
	// 		// table[i][j]--;
	// 	}
	// }
	// for (i = 0; i < n; i++) {
	// 	scanf("%s", s[i]);
	// }
	// for (i = 0; i < n; i++) {
	// 	scanf("%s", t[i]);
	// }
	// scanf("%llu", &q);
	// for (i = 0; i < q; i++) {
	// 	scanf("%lld%lld%lld", &e[i], &c[i], &d[i]);
	// 	c[i]--;
	// }

	solve();

	return 0;
}