QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #443549 | #6540. Beautiful Sequence | Firmino | WA | 1ms | 3632kb | C++14 | 680b | 2024-06-15 15:53:49 | 2024-06-15 15:53:49 |
Judging History
answer
#include <iostream>
#include <algorithm>
using namespace std;
int read(){
int re=0,c=getchar();
while(c<'0'||c>'9') c=getchar();
while(c>='0'&&c<='9') re=(re<<3)+(re<<1)+(c^48),c=getchar();
return re;
}
const int maxn=3e5+5;
int n,lg[maxn],a[maxn],sz[maxn],cd;
void init(){
a[n+1]=cd=0;
}
void solve(){
n=read();
init();
for (int i=1;i<=n;i++) a[i]=read();
sort(a+1,a+n+1);
int st=1;
for (int i=2;i<=n+1;i++){
if(a[i]!=a[i-1]) sz[++cd]=i-st,st=i;
}
int ans=n-cd+1,la=0;
for (int i=cd;i;i--){
if(sz[i]<=la) la-=sz[i],ans++;
else if(i<cd) la++;
}
cout<<ans<<endl;
}
int main(){
int t=read();
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
input:
2 6 1 1 2 3 3 4 5 1 2 2 3 3
output:
4 4
result:
ok 2 number(s): "4 4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
2 5 1 2 2 3 3 20 1 1 1 1 1 1 4 5 8 8 8 8 9 9 9 9 10 10 10 10
output:
4 17
result:
ok 2 number(s): "4 17"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3632kb
input:
300 14 1 1 1 2 2 2 3 3 3 4 5 5 6 6 14 1 1 1 2 2 3 3 4 4 5 5 6 7 7 14 1 1 2 2 3 4 4 4 5 5 5 6 6 6 14 1 1 2 2 3 3 3 4 5 5 5 6 6 6 14 1 1 1 1 1 1 2 2 2 2 2 3 3 3 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 14 1 2 2 3 4 5 5 6 6 6 7 8 8 8 14 1 2 2 2 2 2 3 4 5 6 7 8 9 10 14 1 2 2 3 4 4 4 5 6 6 6 6 6 7 14 1 1 2 2 2 3 3...
output:
10 9 11 11 12 14 10 9 11 11 9 10 10 9 11 11 11 9 9 12 10 9 10 10 11 10 11 11 11 11 10 8 9 9 10 10 11 13 10 12 11 11 8 10 9 11 10 10 10 8 11 10 11 9 10 10 10 10 11 11 12 9 10 10 9 10 9 10 11 11 10 10 10 10 11 10 10 10 9 9 8 10 8 11 9 11 9 11 11 12 9 8 10 8 12 11 9 11 10 10 11 10 10 9 10 9 10 10 10 11...
result:
wrong answer 33rd numbers differ - expected: '10', found: '9'