Submission #502787

# Submission time Handle Problem Language Result Execution time Memory
502787 2022-01-06T15:17:24 Z enerelt14 Xoractive (IZhO19_xoractive) C++14
6 / 100
7 ms 584 KB
#include "interactive.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int>ans;
vector<int>layer[10];
vector<int>layerr[10];
vector<int>anss[10];
vector<int>ress[405];
int kk[10]={0};
void build_1(int id, int l, int r, int la){
	if (id%2==0 && la!=0){
		map<int, int>vis;
		for (int i=0;i<ress[id/2-1].size();i++)vis[ress[id/2-1][i]]++;
		for (int i=0;i<ress[id-1].size();i++)vis[ress[id-1][i]]--;
		for (int i=0;i<ress[id/2-1].size();i++){
			if (vis[ress[id/2-1][i]]!=0)ress[id].pb(ress[id/2-1][i]);
		}
	}
	else{
		for (int i=kk[la];i<kk[la]+r-l+1;i++){
			ress[id].pb(anss[la][i]);
		}
		kk[la]+=(r-l+1);
	}
	if (l==r){
		ans.pb(ress[id][0]);
		return;
	}
	int m=(l+r)/2;
	build_1(id*2+1, l, m, la+1);
	build_1(id*2+2, m+1, r, la+1);
}
void build(int id, int l, int r, int la){
	if (id%2==1){
		for (int i=l;i<=r;i++){
			layer[la].pb(i);
			if (i!=1)layerr[la].pb(i);
		}
	}
	if (l==r)return;
	int m=(l+r)/2;
	build(id*2+1, l, m, la+1);
	build(id*2+2, m+1, r, la+1);
}
vector<int>rs;
vector<int>res;
vector<int> guess(int n){
	int x=ask(1);
	for (int i=1;i<=n;i++)layer[0].pb(i);
	for (int i=2;i<=n;i++)layerr[0].pb(i);
	build(0, 1, n, 0);
	int cur=0;
	while(!layer[cur].empty()){
		map<int, int>num;
		rs=get_pairwise_xor(layer[cur]);
		res=get_pairwise_xor(layerr[cur]);
		for (int i=0;i<rs.size();i++){
			if (rs[i]!=0)num[rs[i]]++;
		}
		for (int i=0;i<res.size();i++){
			if (res[i]!=0)num[res[i]]--;
		}
		anss[cur].pb(0);
		for (int i=0;i<rs.size();i++){
			if (rs[i]!=0 && num[rs[i]]!=0){
				anss[cur].pb(rs[i]);
				num[rs[i]]=0;
			}
		}
		for (int i=0;i<anss[cur].size();i++)anss[cur][i]^=x;
		cur++;
	}
	build_1(0, 1, n, 0);
	return ans;
}

Compilation message

Xoractive.cpp: In function 'void build_1(int, int, int, int)':
Xoractive.cpp:14:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for (int i=0;i<ress[id/2-1].size();i++)vis[ress[id/2-1][i]]++;
      |                ~^~~~~~~~~~~~~~~~~~~~
Xoractive.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   for (int i=0;i<ress[id-1].size();i++)vis[ress[id-1][i]]--;
      |                ~^~~~~~~~~~~~~~~~~~
Xoractive.cpp:16:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for (int i=0;i<ress[id/2-1].size();i++){
      |                ~^~~~~~~~~~~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:58:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for (int i=0;i<rs.size();i++){
      |                ~^~~~~~~~~~
Xoractive.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for (int i=0;i<res.size();i++){
      |                ~^~~~~~~~~~~
Xoractive.cpp:65:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for (int i=0;i<rs.size();i++){
      |                ~^~~~~~~~~~
Xoractive.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for (int i=0;i<anss[cur].size();i++)anss[cur][i]^=x;
      |                ~^~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 584 KB Output is not correct
2 Halted 0 ms 0 KB -