oj.uz

Submission #229469

# Submission time Handle Problem Language Result Execution time Memory
229469 2020-05-04T14:58:34 Z _7_7_ Xoractive (IZhO19_xoractive) C++14
6 / 100
 8 ms 384 KB 
#include "interactive.h"
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 111;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;




int G[10];
set < int > Q[10], q;
unordered_map < int, int > was, d;

int Ask (int x) {
	if (was.count(x))
		return was[x];
	return was[x] = ask(x);
}



vi guess(int n) {
	int p = 1;				
	while (p*2 <= n)
		p *= 2;
	--p;

	vi res;
	res.resize(n);	
	res[0] = ask(1);
	
	for (int i = 0; i <= 6; ++i) {
		if ((1 << i) > n)
			break;

		vi cur, cur1;
		for (int j = 2; j <= n; ++j)
			if (j & (1 << i)) {
				cur.pb(j);
				cur1.pb(j);
			}

		cur.pb(1);
		
		q.clear();				
		cur = get_pairwise_xor(cur);
		cur1 = get_pairwise_xor(cur1);
				

		for (auto j : cur)
			q.insert(j);

		for (auto j : cur1)
			q.erase(j);

		q.erase(0);

		for (auto j : q)
			Q[i].insert(j ^ res[0]);
	}

	
	set < int > QQ;
	for (int i = 0; i < 7; ++i)
		for (auto j : Q[i])
			QQ.insert(j);

	for (auto i : QQ) {
		int jj = 0;
		for (int j = 0; j < 7; ++j) 
			if (Q[j].count(i))
				jj |= (1 << j);
		 
		res[jj - 1] = i;
	}

	
	return res;		
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Incorrect 6 ms 384 KB Output is not correct
4 Halted 0 ms 0 KB -