Submission #36680141

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
int solve(const vector<int>&a,int bit){
	if(bit<0){
		return 1;
	}
	vector<int>sum(a);
	for(int i=1;i<(int)a.size();++i)sum[i]^=sum[i-1];
	auto Get=[&](int l,int r){
		if(!l)return sum[r];
		return sum[r]^sum[l-1];
	};
	vector<int>pos;
	for(int i=0;i<(int)a.size();++i){
		if(a[i]>>bit&1){
			pos.push_back(i);
		}
	}
	if((int)pos.size()==0){
		return solve(a,bit-1)<<1;
	}
	vector<int>new_a;
	for(int i=0;i<(int)pos.size();++i){
		if(i&1){
			new_a.push_back(Get(pos[i-1],pos[i]));
		}else{
			int l=i==0?0:pos[i-1]+1;
			int r=pos[i]-1;
			for(int j=l;j<=r;++j){
				new_a.push_back(a[j]);
			}
		}
	}
	int l=pos.back()+1;
	int r=(int)a.size()-1;
	for(int j=l;j<=r;++j){
		new_a.push_back(a[j]);
	}
	return solve(new_a,bit-1);
}
int main(){
#ifdef local
	freopen("a.in","r",stdin);
#endif
	int n;
	cin>>n;
	vector<int>a((1<<n)-1);
	rep(i,0,(1<<n)-2)cin>>a[i];
	cout<<solve(a,n-1)<<'\n';
}

Submission Info

Submission Time
Task F - Attraction on Tree
User xay5421
Language C++ (GCC 9.2.1)
Score 0
Code Size 1077 Byte
Status RE
Exec Time 2268 ms
Memory 2101628 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
WA × 3
AC × 1
WA × 37
TLE × 9
RE × 11
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in5.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt RE 115 ms 3248 KiB
in10.txt WA 33 ms 34560 KiB
in11.txt WA 27 ms 34816 KiB
in12.txt WA 36 ms 34568 KiB
in13.txt WA 26 ms 34700 KiB
in14.txt WA 3 ms 3580 KiB
in15.txt WA 2 ms 3524 KiB
in16.txt WA 7 ms 4544 KiB
in17.txt WA 7 ms 4704 KiB
in18.txt WA 4 ms 4036 KiB
in19.txt WA 4 ms 4168 KiB
in2.txt WA 33 ms 34652 KiB
in20.txt WA 6 ms 3896 KiB
in21.txt WA 3 ms 3972 KiB
in22.txt WA 4 ms 4028 KiB
in23.txt RE 105 ms 3312 KiB
in24.txt WA 33 ms 34644 KiB
in25.txt RE 107 ms 3232 KiB
in26.txt WA 35 ms 34700 KiB
in27.txt WA 32 ms 34644 KiB
in28.txt WA 31 ms 34756 KiB
in29.txt WA 33 ms 34592 KiB
in3.txt RE 104 ms 3464 KiB
in30.txt WA 32 ms 34700 KiB
in31.txt WA 33 ms 34800 KiB
in32.txt TLE 2268 ms 2101628 KiB
in33.txt RE 117 ms 3520 KiB
in34.txt TLE 2250 ms 1445068 KiB
in35.txt TLE 2255 ms 1625792 KiB
in36.txt TLE 2251 ms 1478040 KiB
in37.txt WA 7 ms 3472 KiB
in38.txt WA 721 ms 519492 KiB
in39.txt WA 2 ms 3528 KiB
in4.txt RE 105 ms 3240 KiB
in40.txt AC 3 ms 3344 KiB
in41.txt RE 105 ms 3240 KiB
in42.txt RE 105 ms 3308 KiB
in43.txt RE 108 ms 3532 KiB
in44.txt WA 28 ms 31580 KiB
in45.txt WA 45 ms 40028 KiB
in46.txt TLE 2245 ms 1202576 KiB
in47.txt WA 10 ms 7208 KiB
in48.txt TLE 2258 ms 1634236 KiB
in49.txt TLE 2258 ms 1647548 KiB
in5.txt WA 28 ms 34624 KiB
in50.txt TLE 2257 ms 1618240 KiB
in51.txt TLE 2257 ms 1619260 KiB
in52.txt WA 176 ms 132224 KiB
in53.txt WA 4 ms 3528 KiB
in54.txt WA 31 ms 34684 KiB
in55.txt WA 33 ms 34700 KiB
in6.txt WA 27 ms 34720 KiB
in7.txt WA 27 ms 34824 KiB
in8.txt RE 106 ms 3328 KiB
in9.txt RE 105 ms 3184 KiB
sample1.txt WA 2 ms 3380 KiB
sample2.txt WA 2 ms 3372 KiB
sample3.txt WA 4 ms 4432 KiB