Submission #1222719

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222719		sleepntsheep	Zagonetka (COI18_zagonetka)	C++20	9 / 100	3 ms	400 KiB

zagonetka

#include <algorithm>
#include <cstring>
#include <cstdio>

#define N 9

int n, p[N], a1[N], a2[N];

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) scanf("%*d"), p[i] = i;

	do {
		printf("query");
		for (int i = 0; i < n; ++i) printf(" %d", p[i] + 1);
		putchar(10);
		fflush(stdout);
		int x;
		scanf("%d", &x);
		if (x)
			memcpy(a2, p, sizeof p);
	} while (std::next_permutation(p, p + n));

	for (int i = 0; i < n; ++i) p[i] = i;

	do {
		printf("query");
		for (int i = 0; i < n; ++i) printf(" %d", p[i] + 1);
		putchar(10);
		fflush(stdout);
		int x;
		scanf("%d", &x);
		if (x) {
			memcpy(a1, p, sizeof p);
			break;
		}
	} while (std::next_permutation(p, p + n));

	puts("end");

	for (int i = 0; i < n; ++i)
		printf("%d ", a1[i] + 1);
	putchar(10);
	for (int i = 0; i < n; ++i)
		printf("%d ", a2[i] + 1);
	putchar(10);

	fflush(stdout);
	return 0;
}

Compilation message (stderr)

zagonetka.cpp: In function 'int main()':
zagonetka.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
zagonetka.cpp:11:42: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         for (int i = 0; i < n; ++i) scanf("%*d"), p[i] = i;
      |                                     ~~~~~^~~~~~~
zagonetka.cpp:19:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |                 scanf("%d", &x);
      |                 ~~~~~^~~~~~~~~~
zagonetka.cpp:32:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |                 scanf("%d", &x);
      |                 ~~~~~^~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 51