QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#550581	#8332. Two in One	dfghjjj	WA	10ms	7980kb	C++20	1.1kb	2024-09-07 13:31:11	2024-09-07 13:31:12

Judging History

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

[2024-09-07 13:31:12]
评测

测评结果：WA
用时：10ms
内存：7980kb

查看

[2024-09-07 13:31:11]
提交

answer

#include<bits/stdc++.h> 
#define ll long long 
#define x first 
#define y second 
#define il inline 
#define em emplace 
#define eb emplace_back 
#define debug() puts("-----") 
using namespace std; 
typedef pair<int,int> pii; 
il int read(){ 
	int x=0,f=1; char ch=getchar(); 
	while(ch<'0'||ch>'9'){ if(ch=='-') f=-1; ch=getchar(); } 
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar(); 
	return x*f; 
} 
const int N=5e5+10; 
int n; 
int a[N]; 
int cnt[N]; 
int w[N],id=0; 
il bool cmp(int a,int b){ return cnt[a]>cnt[b]; } 
il void solve(){ 
	n=read(); pii ans1={0,0},ans2={0,0}; 
    for(int i=1;i<=n;i++) a[i]=read(),cnt[i]=0; 
	int ans=0; id=0; 
    for(int r=1;r<=n;r++){ 
        cnt[a[r]]++; 
		bool flg=false; 
        for(int i=1;i<=id;i++){ 
            int res=cnt[a[r]]|cnt[w[i]]; 
            if(a[r]==w[i]) flg=true; 
            if(res>ans) ans=res,ans1={1,r},ans2={a[r],w[i]};
        } if(!flg) w[++id]=a[r]; 
        sort(w+1,w+id+1,cmp); if(id>2) id=2; 
    } printf("%lld\n",ans); 
} 
signed main(){ 
	int T=read(); 
	while(T--) solve(); 
	return 0; 
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 7980kb

input:

1
7
1 2 3 4 3 2 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 1ms

memory: 7932kb

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: 10ms

memory: 7900kb

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: 10ms

memory: 7904kb

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'