QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#413424	#8672. 排队	maojun	10	16ms	3932kb	C++20	327b	2024-05-17 15:15:02	2024-05-17 15:15:04

Judging History

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

[2024-05-17 15:15:04]
评测

测评结果：10
用时：16ms
内存：3932kb

查看

[2024-05-17 15:15:02]
提交

answer

#include<bits/stdc++.h>
using namespace std;

const int N=2e5+5;
int n,q,l[N],r[N];

int main(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++)scanf("%d%d",&l[i],&r[i]);
	for(int x,y;q--;){
		scanf("%d%d",&x,&y);
		int now=0;
		for(int i=x;i<=y;i++)now+=l[i]<=now&&now<=r[i];
		printf("%d\n",now);
	}
	return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 0ms

memory: 3876kb

input:

output:

1
3
1

result:

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

Test #2:

score: 10

Accepted

time: 9ms

memory: 3892kb

input:

output:

result:

ok 5000 numbers

Test #3:

score: 10

Accepted

time: 9ms

memory: 3932kb

input:

output:

result:

ok 5000 numbers

Test #4:

score: 10

Accepted

time: 10ms

memory: 3860kb

input:

output:

result:

ok 5000 numbers

Test #5:

score: 10

Accepted

time: 9ms

memory: 3884kb

input:

output:

result:

ok 5000 numbers

Test #6:

score: 10

Accepted

time: 3ms

memory: 3884kb

input:

output:

result:

ok 5000 numbers

Test #7:

score: 10

Accepted

time: 9ms

memory: 3828kb

input:

output:

result:

ok 5000 numbers

Test #8:

score: 10

Accepted

time: 9ms

memory: 3932kb

input:

output:

result:

ok 5000 numbers

Test #9:

score: 10

Accepted

time: 9ms

memory: 3896kb

input:

output:

result:

ok 5000 numbers

Test #10:

score: 10

Accepted

time: 9ms

memory: 3924kb

input:

output:

result:

ok 5000 numbers

Test #11:

score: 10

Accepted

time: 16ms

memory: 3884kb

input:

output:

result:

ok 5000 numbers

Subtask #2:

score: 0

Time Limit Exceeded

Test #12:

score: 0

Time Limit Exceeded

input:

200000 200000
3 6
3 3
6 10
1 7
2 7
6 9
4 6
3 4
0 8
0 6
3 5
3 4
1 8
7 8
4 5
0 3
1 5
2 9
1 2
1 2
3 4
5 7
6 10
3 9
4 7
1 6
2 6
1 7
2 5
1 7
6 8
1 1
0 7
7 8
0 9
1 7
3 8
3 7
1 2
4 8
5 6
0 6
5 6
2 7
2 6
0 6
0 6
1 7
2 5
0 3
0 3
7 10
3 8
0 2
3 4
3 7
4 9
0 6
4 7
2 6
8 10
2 10
4 10
3 3
2 6
4 5
3 9
1 8
1 2
2 9
...

output:

result:

Subtask #3:

score: 0

Time Limit Exceeded

Test #22:

score: 0

Time Limit Exceeded

input:

200000 200000
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 0
0 9
0 10
0 0
0 0
0 13
0 14
0 0
0 16
0 17
0 18
0 19
0 0
0 21
0 22
0 23
0 0
0 0
0 0
0 0
0 28
0 0
0 30
0 31
0 32
0 33
0 34
0 35
0 0
0 0
0 38
0 39
0 40
0 41
0 42
0 43
0 44
0 45
0 46
0 0
0 48
0 49
0 50
0 51
0 52
0 53
0 54
0 55
0 56
0 57
0 0
0 59
0 60
0 0
0 0
...

output:

result:

Subtask #4:

score: 0

Time Limit Exceeded

Test #32:

score: 0

Time Limit Exceeded

input:

200000 200000
0 200000
1 200000
1 200000
0 200000
0 200000
1 200000
1 200000
1 200000
0 200000
1 200000
0 200000
0 200000
1 200000
0 200000
0 200000
0 200000
0 200000
1 200000
0 200000
0 200000
1 200000
0 200000
1 200000
1 200000
1 200000
1 200000
0 200000
0 200000
1 200000
2 200000
1 200000
2 20000...

output:

result:

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

Subtask #6:

score: 0

Skipped

QOJ.ac

QOJ

Judging History

answer

Details

Subtask #1:

Test #1:

input:

output:

result:

Test #2:

input:

output:

result:

Test #3:

input:

output:

result:

Test #4:

input:

output:

result:

Test #5:

input:

output:

result:

Test #6:

input:

output:

result:

Test #7:

input:

output:

result:

Test #8:

input:

output:

result:

Test #9:

input:

output:

result:

Test #10:

input:

output:

result:

Test #11:

input:

output:

result:

Subtask #2:

Test #12:

input:

output:

result:

Subtask #3:

Test #22:

input:

output:

result:

Subtask #4:

Test #32:

input:

output:

result:

Subtask #5:

Dependency #1:

Dependency #2:

Subtask #6:

Dependency #5: