Submission #444737

#TimeUsernameProblemLanguageResultExecution timeMemory
444737ics0503Chameleon's Love (JOI20_chameleon)C++17
40 / 100
141 ms320 KiB
#include "chameleon.h"
#include <vector>
using namespace std;
void Solve(int n) {
	int i, j;
	for (i = 1; i <= 2*n; i++) {
		for (j = i + 1; j <= 2*n; j++) {
			vector<int>qr;
			for (int p = 1; p <= 2*n; p++) {
				if (i == p || j == p)continue;
				qr.push_back(p);
			}
			int Q = Query(qr);
			qr.clear();
			qr.push_back(i);
			qr.push_back(j);
			int P = Query(qr);
			if (Q != n && P == 1) {
				Answer(i, j);
				break;
			}
		}
	}
}
#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...