QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#774494#9541. Expanding Arraychenjue#WA 0ms3808kbC++14668b2024-11-23 13:20:422024-11-23 13:20:43

Judging History

你现在查看的是最新测评结果

  • [2024-11-23 13:20:43]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3808kb
  • [2024-11-23 13:20:42]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+10;
void solve(){
	int n; cin >> n;
	int a[n + 1];
	set<int> s;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i < n; i++){
		s.insert(a[i] ^ a[i + 1]);
		s.insert(a[i]);
		s.insert(a[i + 1]);
		s.insert(a[i] & a[i + 1]);
		s.insert(a[i] | a[i + 1]);
		s.insert(a[i + 1] & (a[i]^a[i+1]));
		s.insert((a[i]^a[i + 1])&a[i+1]);
		s.insert(a[i + 1]|(a[i]^a[i+1]));
		s.insert((a[i]^a[i + 1])|a[i+1]);
	}
	s.insert(0);
//	for(auto i : s){
//		cout << i << " ";
//	}
	cout << s.size();
}
signed main(){
	int _=1;
//	cin>>_;
	while(_--)solve(); 
	
} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3576kb

input:

2
2 3

output:

4

result:

ok single line: '4'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3732kb

input:

2
3 4

output:

4

result:

ok single line: '4'

Test #3:

score: -100
Wrong Answer
time: 0ms
memory: 3808kb

input:

2
3 5

output:

7

result:

wrong answer 1st lines differ - expected: '8', found: '7'