QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#554789#8332. Two in OnehicgnliawTL 55ms3704kbC++142.0kb2024-09-09 15:48:552024-09-09 15:48:56

Judging History

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

  • [2024-09-09 15:48:56]
  • 评测
  • 测评结果:TL
  • 用时:55ms
  • 内存:3704kb
  • [2024-09-09 15:48:55]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
inline int read(){
	int s = 0;char ch = getchar();
	while(ch<'0'||ch>'9')ch = getchar();
	while(ch>='0'&&ch<='9'){s = (s<<1)+(s<<3)+ch-'0';ch = getchar();}
	return s;
}
int n,a[N],cnt[N],T,sum[N],r[N];
void clar(int* arr){
	for(int i = 1;i<=n;i++)arr[i] = 0;
}
void solve1(){
	int ans = 0,ansl,ansr;
	int nk[105],ct;
	for(int i = 1;i<=n;i++){
		clar(cnt);
		clar(sum);
		for(int j = i;j<=n;j++){
			sum[cnt[a[j]]]--;
			sum[++cnt[a[j]]]++;
			ct = 0;
			for(int k = 1;k<=n;k++){
				if(sum[k])nk[++ct] = k;
			}
			for(int k = 1;k<=ct;k++){
				if(ans<nk[k]){
					ans = nk[k];
					ansl = i,ansr = j;
				}
				for(int t = 1;t<k;t++){
					if((nk[k]|nk[t])>ans){
						ans = nk[k]|nk[t];
						ansl = i,ansr = j;
					}
				}
			}
		}
	}
//	cout << ans << '\n';
	clar(cnt);
	for(int i = ansl;i<=ansr;i++)cnt[a[i]]++;
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=n;j++){
			if((cnt[i]|cnt[j])==ans){
				cout << ans << '\n';
//				cout << ansl << ' ' << ansr << '\n'
//				<< i << ' ' << j << '\n';
				return;
			}
		}
	}
}
void solve2(){
	int mx1 = 0,mx2 = 0;
	clar(cnt);
	for(int i = 1;i<=n;i++){
		r[a[i]] = i;
		cnt[a[i]]++;
	}
	for(int i = 1;i<=n;i++){
		if(cnt[i]>=cnt[mx1]){
			mx2 = mx1;
			mx1 = i;
		}else if(cnt[i]>cnt[mx2])mx2 = i;
	}
	int c;
	if(!cnt[mx2]){
		cout << cnt[mx1] << '\n';
//		cout << 1 << ' ' << n << '\n';
//		cout << mx1 << ' ' << mx1 << '\n';
		return;
	}
	for(c = 1<<20;c;c>>=1){
		if((cnt[mx1]&c)&&(cnt[mx2]&c))break;
	}
	for(int i = n;i>=1;i--){
		if(!(cnt[mx1]&c)||!(cnt[mx2]&c)){
			cout << (cnt[mx1]|cnt[mx2]) << '\n';
//			cout << 1 << ' ' << i << '\n';
//			cout << mx1 << ' ' << mx2 << '\n';
			return; 
		}
		cnt[a[i]]--;
	}
	return;
}
int main(){
//	freopen("ttheal.in","r",stdin);
//	freopen("ttheal.out","w",stdout);
	T = read();
	while(T--){
		n = read();
		for(int i = 1;i<=n;i++)a[i] = read();
		if(n<=100)solve1();
		else solve2();
	}
	return 0;
}

详细

Test #1:

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

input:

1
7
1 2 3 4 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

1
9
1 1 1 1 1 2 2 2 2

output:

7

result:

ok 1 number(s): "7"

Test #3:

score: 0
Accepted
time: 7ms
memory: 3680kb

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:

255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255

result:

ok 50 numbers

Test #4:

score: 0
Accepted
time: 32ms
memory: 3704kb

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:

3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
1
5
3
3
3
3
3
3
3
3
3
3
3
5
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
6
3
3
3
3
5
3
3
3
5
3
3
3
3
3
3
3
3
3
3
5
3
3
3
3
3
3
3
3
3
3
3
5
3
3
3
1
3
3
3
3
3
3
5
3
3
3
3
3
3
3
3
3
3
...

result:

ok 79114 numbers

Test #5:

score: 0
Accepted
time: 51ms
memory: 3620kb

input:

50000
10
6 3 8 5 4 6 3 5 3 9
10
10 4 3 10 4 5 2 7 8 10
10
10 6 2 2 4 9 7 3 3 4
10
1 2 9 7 5 2 1 2 10 1
10
2 8 2 3 7 8 3 5 10 5
10
5 6 10 2 7 3 5 10 5 4
10
3 4 4 2 2 1 1 8 5 10
10
3 3 3 8 5 7 3 6 7 9
10
10 6 5 3 2 8 10 9 9 4
10
5 8 6 2 10 5 8 8 10 7
10
5 8 2 10 2 2 9 5 4 2
10
7 6 4 7 5 9 2 2 1 7
10
7...

output:

3
3
3
3
3
3
3
6
3
3
6
3
3
3
6
3
3
3
3
6
3
3
3
3
3
3
3
3
6
3
6
3
3
3
6
3
6
3
7
3
3
6
3
3
3
6
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
6
3
3
3
3
3
3
3
3
3
5
3
3
7
3
3
3
3
3
3
6
3
3
3
6
3
3
3
7
3
6
3
3
3
3
3
3
3
6
3
3
5
3
3
6
7
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
7
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
6
3
7
3
3
3
3
3
3
6
3
...

result:

ok 50000 numbers

Test #6:

score: 0
Accepted
time: 55ms
memory: 3644kb

input:

50000
10
2 1 2 2 2 2 1 2 1 3
10
3 2 1 3 2 2 1 2 2 3
10
3 2 1 1 2 3 2 1 1 2
10
1 1 3 2 2 1 1 1 3 1
10
1 2 1 1 2 2 1 2 3 2
10
2 2 3 1 2 1 2 3 2 2
10
1 2 2 1 1 1 1 2 2 3
10
1 1 1 2 2 2 1 2 2 3
10
3 2 2 1 1 2 3 3 3 2
10
2 2 2 1 3 2 2 2 3 2
10
2 2 1 3 1 1 3 2 2 1
10
2 2 2 2 2 3 1 1 1 2
10
2 3 2 1 1 2 2 1...

output:

7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
9
7
7
7
7
7
7
7
7
7
7
9
7
7
7
7
7
9
7
7
7
7
7
7
9
9
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
9
7
7
7
7
7
9
7
10
7
7
7
7
7
7
10
7
7
7
7
7
7
7
7
7
7
7
7
7
10
7
7
7
7
7
7
7
7
7
7
7
7...

result:

ok 50000 numbers

Test #7:

score: -100
Time Limit Exceeded

input:

5000
100
35 13 56 51 37 39 100 35 21 36 54 19 99 74 38 99 90 69 29 23 38 27 40 94 92 93 93 45 94 22 65 65 43 62 47 53 11 77 87 15 77 72 3 38 25 19 4 82 48 69 15 13 8 76 48 8 19 86 25 26 34 70 38 42 87 81 31 92 30 24 80 69 8 74 48 30 57 47 65 42 35 47 42 85 18 94 97 13 8 24 100 31 51 72 69 95 74 90 9...

output:

7
7
3
7
7
7
7
7
7
7
7
7
7
3
7
7
7
7
7
7
7
7
3
7
7
3
7
7
7
7
3
7
7
7
7
7
7
3
7
7
3
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
7
3
7
7
7
3
7
7
7
7
7
3
7
7
7
3
7
7
7
3
7
7
7
7
3
7
7
3
7
7
7
7
7
7
7
7
7
7
3
7
7
7
7
7
7
7
7
7
7
3
7
7
3
3
7
7
7
7
7
7
7
7
7
7
7
7
3
3
7
7
7
7
3
7
7
7
7
7
7
7
7
7
7
7
3
7
...

result: