Submission #207760

#	Time	Username	Problem	Language	Result	Execution time	Memory
207760		bash	Xoractive (IZhO19_xoractive)	C++17	100 / 100	12 ms	664 KiB

Xoractive

/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include "interactive.h"
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}


set <int> num[8];
map<int,int> pos;
                  
multiset<int> query(vector<int> v){
	vector<int> v2 = get_pairwise_xor(v);
	multiset<int> res(v2.begin(), v2.end());
	return res;
}

vector<int> guess(int n) {
	if (n <= 15) {
		vector<int> ans;
		for (int i = 1; i<= n; i++) {
			ans.pb(ask(i));
		}
		return ans;
	} 
	int first_element = ask(1);
	num[0].insert(first_element);
	for (int i = 0; i < 7; i++) {
		vector<int> v;
		for (int j = 2; j <= n; j++) {
			if ((j >> i) & 1) {
				v.pb(j);
			}
		}
		multiset<int>m1 = query(v);
    	v.pb(1);
    	multiset<int>m2 = query(v);
    	m2.erase(m2.find(0));
    	for(int val : m1) {
    		m2.erase(m2.find(val));
    	}
    	for(int val : m2){
      		num[i].insert((first_element ^ val));
    	}
	}
	for (int i = 0; i < 7; i++) {
		for (int j : num[i]) {
			pos[j] |= (1 << i);
		}
	}	
	vector<pair<int,int> > res;
	for (auto i : pos) {
		res.pb({i.S, i.F});	
	}
	sort(res.begin(), res.end());
	vector<int> ans;
	for (auto i : res) {
		ans.pb(i.S);
	}
	return ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 94 / 94