Submission #1159248

#TimeUsernameProblemLanguageResultExecution timeMemory
1159248OI_AccountPark (JOI17_park)C++20
10 / 100
13 ms328 KiB
#include "park.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1400;
static int Place[1400];

int n;
bitset<N + 1> mark;

bool query(int u, int v) {
	if (u > v)
		swap(u, v);
	for (int i = 0; i < n; i++)
		Place[i] = mark[i];
	return Ask(u, v, Place);
}

void solveSub1() {
	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++)	{
			mark.reset();
			mark[i] = mark[j] = 1;
			if (query(i, j))
				Answer(i, j);
		}
}

void Detect(int T, int N) {
	n = N;
	if (T == 1)
		solveSub1();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...