oj.uz

Submission #813400

# Submission time Handle Problem Language Result Execution time Memory
813400 2023-08-07T17:05:19 Z arnold518 Ancient Machine 2 (JOI23_ancient2) C++17
0 / 100
 0 ms 208 KB 
#include "ancient2.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

namespace
{
	int N, M;
}


string Solve(int _N)
{
	N=_N;
	string ans;
	M=N+2;
	printf("%d\n", M);
	
	for(int i=0; i<N; i++)
	{
		vector<int> A(M), B(M);

		for(int j=0; j<i; j++) A[j]=j+1, B[j]=j+1;
		A[i]=i+1; B[i]=i+2;
		for(int j=i+1; j<M; j++) A[j]=j, B[j]=j;

		int t=Query(M, A, B);
		if(t==i+1) ans+="0";
		else ans+="1";
	}

	return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -