Submission #1257908

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257908		terracottalite	Island Hopping (JOI24_island)	C++20	2 / 100	2 ms	904 KiB

island

#include <stdio.h>
#include <vector>
using namespace std;

#ifndef TEST
#include "island.h"
#endif

#ifdef TEST
int query(int x, int k) {
	printf("? %d %d\n", x, k);
	fflush(stdout);
	int ret;
	scanf("%d", &ret);
	return ret;
}

void answer(int x, int y) {
	printf("! %d %d\n", x, y);
	fflush(stdout);
}
#endif

void solve(int n, int l) {
	/*
	set<int> unvi;
	for (int i=1;i<=n;i++) {
		unvi.insert(i);
	}
	*/

	int a[400][2];

	for (int i=1;i<=n;i++) {
		a[i][0] = query(i, 1);
		a[i][1] = query(i, 2);
	}

	int mat[400][400];

	for (int i=1;i<=n;i++) for (int j=1;j<=n;j++) mat[i][j] = 0;

	for (int i=1;i<=n;i++) {
		mat[i][a[i][0]] = 1;
		mat[a[i][0]][i] = 1;

		if (mat[i][1] != mat[a[i][0]][1] && mat[i][1] != mat[a[i][0]][0]) {
			mat[i][a[i][1]] = 1;
			mat[a[i][1]][i] = 1;
		}
	}

	for (int i=1;i<=n;i++) {
		for (int j=1;j<=n;j++) {
			if (mat[i][j] && i < j) answer(i, j);
		}
	}
}

#ifdef TEST
int main() {
	int n, l;
	scanf("%d %d", &n, &l);
	solve(n, l);
}
#endif

• Subtask 1: 2 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 9
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 22
• Subtask 8: 0 / 28