답안 #362069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362069 2021-02-01T16:43:17 Z Lawliet Xoractive (IZhO19_xoractive) C++17
100 / 100
3 ms 492 KB
#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 110;

int n;
int firstValue;

vector<int> values[MAXN];
vector<int> notValues[MAXN];

vector<int> allValues;

void print(string name, vector<int> A)
{
	cout << name << " -> ";

	for(int i = 0 ; i < (int)A.size() ; i++)
		printf("%d ",A[i]);

	printf("\n");
}

vector<int> getDiff(vector<int> A, vector<int> B)
{
	vector<int> ans;

	int pA = 0, pB = 0;

	while( pA < (int)A.size() && pB < (int)B.size() )
	{
		if( A[pA] == B[pB] ) pA++, pB++;
		else if( A[pA] > B[pB] ) pB++;
		else ans.push_back( A[pA++] );
	}

	while( pA < (int)A.size() )
		ans.push_back( A[pA++] );

	return ans;
}

vector<int> getIntersection(vector<int> A, vector<int> B)
{
	vector<int> ans;

	int pA = 0, pB = 0;

	while( pA < (int)A.size() && pB < (int)B.size() )
	{
		if( A[pA] < B[pB] ) pA++;
		else if( A[pA] > B[pB] ) pB++;
		else ans.push_back( A[pA] ), pA++, pB++;
	}

	return ans;
}

vector<int> getComplementary(vector<int> A) { return getDiff( allValues , A ); }

vector<int> removeDuplicated(vector<int> A)
{
	vector<int> ans;

	for(int i = 0 ; i < (int)A.size() ; i += 2)
		ans.push_back( A[i] );

	return ans;
}

vector<int> findElements(vector<int> A)
{
	vector<int> merge = A;
	merge.insert( merge.begin() , 1 );

	vector<int> xorRight = get_pairwise_xor( A );
	vector<int> xorMerge = get_pairwise_xor( merge );

	vector<int> ans = getDiff( xorMerge , xorRight );
	ans.erase( ans.begin() );

	for(int i = 0 ; i < (int)ans.size() ; i++)
		ans[i] ^= firstValue;

	ans = removeDuplicated( ans );
	sort( ans.begin() , ans.end() );

	return ans;
}

void getAllValues()
{
	set<int> s;

	for(int k = 0 ; (1 << k) < n ; k++)
		for(int j = 0 ; j < (int)values[k].size() ; j++)
			s.insert( values[k][j] );

	for(auto it = s.begin() ; it != s.end() ; it++)
		allValues.push_back( *it );
}

vector<int> guess(int N) 
{
	n = N;

	vector<int> ans;
	firstValue = ask( 1 );

	for(int k = 0 ; (1 << k) < n ; k++)
	{
		vector<int> cur;

		for(int i = 0 ; i < n ; i++)
			if( i & (1 << k) ) cur.push_back( i + 1 );

		values[k] = findElements( cur );
	}

	getAllValues();

	for(int k = 0 ; (1 << k) < n ; k++)
		notValues[k] = getComplementary( values[k] );

	ans.push_back( firstValue );

	for(int i = 1 ; i < n ; i++)
	{
		vector<int> t = allValues;

		for(int k = 0 ; (1 << k) < n ; k++)
		{
			if( i & (1 << k) ) t = getIntersection( t , values[k] );
			else t = getIntersection( t , notValues[k] );
		}

		ans.push_back( t[0] );
	}

	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 3 ms 492 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 3 ms 388 KB Output is correct
22 Correct 3 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 3 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 3 ms 364 KB Output is correct
37 Correct 3 ms 364 KB Output is correct
38 Correct 2 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 3 ms 364 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 3 ms 364 KB Output is correct
43 Correct 2 ms 364 KB Output is correct
44 Correct 2 ms 364 KB Output is correct
45 Correct 3 ms 364 KB Output is correct
46 Correct 3 ms 364 KB Output is correct
47 Correct 2 ms 364 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 3 ms 364 KB Output is correct
50 Correct 2 ms 364 KB Output is correct
51 Correct 2 ms 364 KB Output is correct
52 Correct 2 ms 364 KB Output is correct
53 Correct 2 ms 364 KB Output is correct
54 Correct 3 ms 364 KB Output is correct
55 Correct 3 ms 364 KB Output is correct
56 Correct 3 ms 364 KB Output is correct
57 Correct 3 ms 364 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 2 ms 364 KB Output is correct
61 Correct 2 ms 364 KB Output is correct
62 Correct 3 ms 364 KB Output is correct
63 Correct 2 ms 364 KB Output is correct
64 Correct 3 ms 364 KB Output is correct
65 Correct 3 ms 364 KB Output is correct
66 Correct 2 ms 364 KB Output is correct
67 Correct 2 ms 364 KB Output is correct
68 Correct 2 ms 364 KB Output is correct
69 Correct 3 ms 364 KB Output is correct
70 Correct 2 ms 364 KB Output is correct
71 Correct 2 ms 364 KB Output is correct
72 Correct 3 ms 384 KB Output is correct
73 Correct 3 ms 364 KB Output is correct
74 Correct 3 ms 364 KB Output is correct
75 Correct 2 ms 364 KB Output is correct
76 Correct 3 ms 364 KB Output is correct
77 Correct 2 ms 364 KB Output is correct
78 Correct 3 ms 364 KB Output is correct
79 Correct 2 ms 364 KB Output is correct
80 Correct 2 ms 364 KB Output is correct
81 Correct 3 ms 364 KB Output is correct
82 Correct 3 ms 364 KB Output is correct
83 Correct 2 ms 364 KB Output is correct
84 Correct 3 ms 364 KB Output is correct
85 Correct 3 ms 364 KB Output is correct
86 Correct 3 ms 364 KB Output is correct
87 Correct 2 ms 364 KB Output is correct
88 Correct 3 ms 364 KB Output is correct
89 Correct 3 ms 364 KB Output is correct
90 Correct 3 ms 492 KB Output is correct
91 Correct 2 ms 364 KB Output is correct
92 Correct 3 ms 364 KB Output is correct
93 Correct 2 ms 364 KB Output is correct
94 Correct 2 ms 364 KB Output is correct
95 Correct 2 ms 364 KB Output is correct
96 Correct 3 ms 364 KB Output is correct
97 Correct 3 ms 364 KB Output is correct
98 Correct 2 ms 364 KB Output is correct
99 Correct 3 ms 364 KB Output is correct
100 Correct 3 ms 364 KB Output is correct