Submission #1208330

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208330		dubabuba	Ancient Machine 2 (JOI23_ancient2)	C++20	10 / 100	97 ms	432 KiB

ancient2

#include "ancient2.h"
#include <bits/stdc++.h>

using namespace std;

string Solve(int N) {
	// assert(N == 1000);
	vector<int> a(N + 2, 1);
	vector<int> b(N + 2, 1);

	string ret;
	ret.resize(N);
	for(int cur = N - 1; cur >= 0; cur--) {
		for(int i = 0; i <= cur - 1; i++) {
			a[i] = i + 1;
			b[i] = i + 1;
		}

		// for(int i = cur; i <= N + 1; i++) {
		// 	a[i] = N;
		// 	b[i] = N + 1;
		// }

		a[cur] = N;
		b[cur] = N + 1;

		a[N] = b[N] = N;
		a[N + 1] = b[N + 1] = N + 1;

		int T = Query(N + 2, a, b);
		// for(int x : a)
		// 	cout << x << ' ';
		// cout << endl;

		// for(int x : b)
		// 	cout << x << ' ';
		// cout << endl;
		// cout << "ans = " << T << endl;

		if(T == N)
			ret[cur] = '0';
		else
			ret[cur] = '1';
	}

	return ret;
}

• Subtask 1: 10 / 100