QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#267256#7685. Barkley IIStefanSebezRE 0ms3892kbC++23828b2023-11-27 03:16:342023-11-27 03:16:34

Judging History

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

  • [2023-11-27 03:16:34]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3892kb
  • [2023-11-27 03:16:34]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N=5*1e5+50;
const int inf=1e9;
int n,m;
int T[N];
void Update(int ind,int val){
    for(int i=ind;i<=n;i+=i&(-i)) T[i]+=val;
}
int Get(int ind){
    int sum=0;
    for(int i=ind;i>=1;i-=i&(-i)) sum+=T[i];
    return sum;
}
int main()
{
    int tt;scanf("%i",&tt);
    while(tt--)
    {
        scanf("%i%i",&n,&m);
        int a[n+1];
        for(int i=1;i<=n;i++)
        {
            scanf("%i",&a[i]);
        }
        int b[m+1]={0},res=inf;
        for(int i=1;i<=n;i++)
        {
            if(b[a[i]]!=0)
            {
                Update(b[a[i]],-1);
            }
            Update(i,1);
            res=min(res,Get(i)-Get(b[i])+1);
            b[a[i]]=i;
        }
        printf("%i\n",res);
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
5 4
1 2 2 3 4
5 10000
5 2 3 4 1

output:

2
3

result:

ok 2 number(s): "2 3"

Test #2:

score: -100
Runtime Error

input:

50000
10 19
12 6 1 12 11 15 4 1 13 18
10 8
8 7 6 7 6 2 2 3 4 8
10 6
3 2 6 6 5 2 3 4 5 6
10 11
6 3 7 9 2 1 2 10 10 4
10 6
6 1 2 6 1 1 3 4 2 1
10 9
8 5 3 9 1 7 5 5 1 1
10 5
1 4 3 2 5 4 5 3 5 2
10 14
3 8 12 10 4 2 3 13 7 3
10 14
5 5 12 2 8 1 13 9 8 5
10 7
5 5 6 6 1 5 3 7 3 4
10 7
5 1 4 6 1 6 4 3 7 5
10...

output:


result: