QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#819141	#964. Excluded Min	lgvc	TL	8ms	7488kb	C++23	498b	2024-12-18 13:02:03	2024-12-18 13:02:12

Judging History

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

[2024-12-18 13:02:12]
评测

测评结果：TL
用时：8ms
内存：7488kb

查看

[2024-12-18 13:02:03]
提交

answer

#include <bits/stdc++.h>
int N,Q,a[500009],v[500009];
signed main(void) {
    scanf("%d %d",&N,&Q);
    for(int i=1;i<=N;i++) {
        scanf("%d",&a[i]);
    }
    while(Q--) {
        int l,r;
        scanf("%d %d",&l,&r);
        for(int i=l;i<=r;i++) {
            v[a[i]]++;
        }
        int su=0,ans=0;
        for(int i=0;i<=r-l+1;i++) {
            if(su>=i) ans=i;
            su+=v[i];
        }
        memset(v,0,sizeof(v));
        printf("%d\n",ans);
    }
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 6864kb

input:

output:

3
1
0

result:

ok 3 number(s): "3 1 0"

Test #2:

score: 0

Accepted

time: 1ms

memory: 5892kb

input:

output:

0
3

result:

ok 2 number(s): "0 3"

Test #3:

score: 0

Accepted

time: 1ms

memory: 6036kb

input:

10 10
3 0 3 3 9 7 9 6 0 7
3 3
9 9
4 6
1 9
3 4
2 4
7 10
3 7
5 7
2 7

output:

result:

ok 10 numbers

Test #4:

score: 0

Accepted

time: 2ms

memory: 6892kb

input:

10 10
3 0 0 0 5 1 1 1 2 1
1 2
8 8
5 7
1 7
2 2
1 5
5 6
4 6
3 10
6 8

output:

result:

ok 10 numbers

Test #5:

score: 0

Accepted

time: 7ms

memory: 5772kb

input:

100 100
15 82 7 39 63 55 64 99 71 63 32 99 67 94 3 43 15 75 45 55 53 4 35 36 15 40 82 20 62 43 6 83 27 95 27 45 98 44 35 98 39 7 17 32 76 7 40 16 40 63 13 8 22 27 11 12 61 14 19 45 100 97 90 88 22 59 25 63 4 25 65 16 22 92 84 44 99 66 89 26 93 97 35 97 92 1 32 40 97 97 78 43 7 12 23 53 61 74 33 90
1...

output:

result:

ok 100 numbers

Test #6:

score: 0

Accepted

time: 7ms

memory: 6388kb

input:

100 100
17 86 33 8 11 27 8 11 13 9 3 43 11 23 26 42 44 12 44 12 15 0 75 51 72 5 49 2 40 57 24 47 39 42 4 5 6 52 3 2 42 19 62 33 24 22 16 69 4 33 44 70 29 11 2 2 58 9 6 10 25 10 33 26 17 3 14 0 48 7 48 51 0 39 54 37 14 9 3 85 18 4 25 9 2 0 39 8 17 13 25 45 10 39 12 18 9 5 66 6
13 89
10 90
42 67
43 52...

output:

result:

ok 100 numbers

Test #7:

score: 0

Accepted

time: 8ms

memory: 7488kb

input:

100 100
6 1 1 5 13 11 35 5 3 2 0 4 0 9 1 2 3 3 19 1 7 9 7 11 7 8 10 18 28 17 31 2 4 8 2 3 3 2 22 4 9 4 7 2 9 15 8 2 3 19 5 24 3 10 11 5 9 20 8 4 11 10 18 9 13 34 5 34 2 9 24 6 21 16 6 12 26 2 2 2 6 11 2 14 3 8 2 12 2 19 8 3 18 23 5 21 23 8 4 0
44 67
25 74
24 79
59 73
4 81
42 66
48 55
15 38
35 63
16 ...

output:

result:

ok 100 numbers

Test #8:

score: 0

Accepted

time: 4ms

memory: 6660kb

input:

100 100
0 1 0 1 0 1 1 1 0 2 1 1 2 0 1 1 0 3 0 0 0 0 0 0 0 0 1 2 2 0 0 0 0 1 0 0 1 2 0 0 1 0 0 3 0 1 0 0 3 0 0 0 1 1 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 2 0 0 0 4 0 1 1 0 1 0 2 2 0 0 1
41 53
31 36
78 99
60 86
1 67
3 92
89 92
60 70
42 56
42 46
39 84
40 66
9 27
75 78
33 94
17 53...

output:

result:

ok 100 numbers

Test #9:

score: -100

Time Limit Exceeded

input:

300000 300000
216504 101790 177261 84423 215788 67188 170620 125383 222808 149722 190483 152974 27524 172557 109218 201761 138030 177265 270417 244027 29296 13565 108388 270622 75102 137755 134081 21988 249714 268911 178911 39288 197287 232628 152784 226739 40134 213404 230781 181323 235763 55745 44...

output: