QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#550630	#8332. Two in One	ASnown	WA	19ms	3864kb	C++14	1.1kb	2024-09-07 13:39:37	2024-09-07 13:39:38

Judging History

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

[2024-09-07 13:39:38]
评测

测评结果：WA
用时：19ms
内存：3864kb

查看

[2024-09-07 13:39:37]
提交

answer

#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int N = 1e5+15;
int n;
int a[N];
int cnt[N];
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   int T; cin>>T; while(T--)
   Solve();
}
void Solve() {
   cin>>n;
   for(int i=1;i<=n;i++) cin>>a[i];
   for(int i=1;i<=n;i++) cnt[i]=0;
   int ans=0,ansr,ansa,ansb;
   int mx=0,mxc,ma=0,mac;
   for(int i=1;i<=n;i++) {
      ++cnt[a[i]];
      if(cnt[a[i]]>=mx) ma=mx,mac=mxc,mx=cnt[a[i]],mxc=a[i];
      else if(cnt[a[i]]>ma) ma=cnt[a[i]],mac=a[i];
      if(Max(ans,mx)) ansr=i,ansa=ansb=mxc;
      if(Max(ans,mx|ma)) ansr=i,ansa=mxc,ansb=mac;
   }
   printf("%d\n",ans);
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3828kb

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: 3788kb

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

memory: 3864kb

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

memory: 3840kb

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 18th numbers differ - expected: '5', found: '7'