QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#516519	#8332. Two in One	lsflsf2023^#	WA	55ms	4000kb	C++14	1.7kb	2024-08-12 17:53:21	2024-08-12 17:53:21

Judging History

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

[2024-08-12 17:53:21]
评测

测评结果：WA
用时：55ms
内存：4000kb

查看

[2024-08-12 17:53:21]
提交

answer

#include <bits/stdc++.h>

using namespace std;

int a[100005];

int b[100005];

int c[25];

int d[25];

int e[100005];

int main()
{
	int T;
	scanf("%d", &T);
	while (T --)
	  {
	  	int n;
	  	scanf("%d", &n);
	  	for (int i = 1 ; i <= n ; ++ i)
	  	  scanf("%d", a + i), b[i] = 0, e[i] = 0;
	  	for (int i = 0 ; i < 25 ; ++ i)
	  	  c[i] = 0;
	  	for (int i = 1 ; i <= n ; ++ i)
	  	  ++ b[a[i]];
	  	for (int i = 1 ; i <= n ; ++ i)
	  	  ++ e[b[i]];
	  	for (int i = 1 ; i <= n ; ++ i)
	  	  b[i] = e[i];
	  	for (int i = 1 ; i <= n ; ++ i)
	  	  for (int j = 0 ; j < 25 ; ++ j)
	  	    if (1 << j & i)
	  	      c[j] += b[i];
	  	//for (int i = 0 ; i < 25 ; ++ i)
	  	  //printf("%d ", c[i]);
	  	int x;
	  	for (int i = 24 ; ~i ; -- i)
	  	  if (c[i])
	  	    {
	  	    	x = i;
	  	    	break;
			  }
		//cout << x << endl;
		if (c[x] >= 2)
		  printf("%d\n", (1 << x + 1) - 1);
		else
		  {
		  	int y;
		  	int Ans = 0;
		  	for (int i = 1 ; i <= n ; ++ i)
		  	  if (b[i])
		  	  if (1 << x & i)
		  	    y = i;
		  	//cout << y << endl;
		  	for (int i = 1 ; i <= n ; ++ i)
		  	  if (b[i] && i != y)
		  	    {
		  	    	//cout << i << " " << y << endl;
		  	    	for (int j = 0 ; j < 25 ; ++ j)
		  	    	  d[j] = 0;
		  	    	for (int j = 0 ; j < 25 ; ++ j)
		  	    	  {
		  	    	  	if (1 << j & i)
		  	    	  	  ++ d[j];
		  	    	  	if (1 << j & y)
		  	    	  	  ++ d[j];
						}
					int R = 0;
					bool Flag = false;
					for (int j = 24 ; ~j ; -- j)
					  {
					  	if (d[j] || Flag)
					  	  R |= 1 << j;
					  	if (d[j] >= 2)
					  	  Flag = true;
					  }
					if (R > Ans)
					  Ans = R;
				  }
				printf("%d\n", Ans);
		  }
	  }
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3952kb

input:

1
7
1 2 3 4 3 2 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3848kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

result:

ok 1 number(s): "7"

Test #3:

score: 0

Accepted

time: 55ms

memory: 4000kb

input:

50
10000
72 65 90 94 67 93 41 43 54 83 31 34 38 37 44 42 92 63 66 79 90 45 41 40 19 54 34 90 13 74 40 77 41 57 74 86 91 79 34 39 21 88 90 57 23 31 8 15 80 27 45 38 53 96 51 82 70 71 19 75 62 95 31 67 99 97 94 29 90 7 95 82 61 98 62 77 43 65 66 30 41 69 38 79 51 9 63 77 13 30 72 70 67 93 92 45 74 50 ...

output:

result:

ok 50 numbers

Test #4:

score: -100

Wrong Answer

time: 43ms

memory: 3960kb

input:

79114
7
1 2 4 3 2 3 7
7
1 2 4 7 4 1 5
6
4 2 2 4 2 1
7
1 2 1 4 7 3 2
7
1 2 4 7 1 1 3
7
1 2 6 1 5 2 5
6
5 2 6 1 2 5
7
1 1 7 6 6 5 2
7
1 2 5 6 6 7 7
7
1 1 2 7 2 3 6
7
1 1 1 4 6 2 2
7
1 1 5 7 3 5 2
7
1 1 7 6 2 2 5
6
4 3 4 6 3 1
6
4 4 3 2 3 1
7
1 1 2 3 7 6 2
6
1 2 5 6 3 4
7
1 1 1 1 4 7 6
6
2 6 6 2 5 3
6
...

output:

result:

wrong answer 9442nd numbers differ - expected: '1', found: '0'