QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#95890	#119. Worst Reporter 3	tricyzhkx	19	208ms	7144kb	C++14	551b	2023-04-12 12:48:35	2023-04-12 12:48:38

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-12 12:48:38]
评测

测评结果：19
用时：208ms
内存：7144kb

查看

[2023-04-12 12:48:35]
提交

answer

# include <bits/stdc++.h>
using namespace std;
int D[500010],p[500010];
int main()
{
	int n,q,T,l,r,cnt=0;
	cin>>n>>q;
	for(int i=1;i<=n;i++) scanf("%d",&D[i]);
	for(int i=2;i<=n;i++) D[i]=(D[i]+D[i-1]-1)/D[i-1]*D[i-1];
	for(int i=1,j;i<=n;i=j+1)
	{
		for(j=i;j<n && D[j+1]==D[i];j++);
		p[++cnt]=j;
	}
	while(q--)
	{
		scanf("%d%d%d",&T,&l,&r);
		int ans=(l<=T && T<=r);
		for(int i=1;i<=cnt;i++)
		{
			int t=T-T%D[p[i]],x=max(p[i-1]+1,t-r),y=min(p[i],t-l);
			if(x<=y) ans+=y-x+1;
		}
		printf("%d\n",ans);
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 7

Accepted

Test #1:

score: 7

Accepted

time: 187ms

memory: 6928kb

input:

499999 499999
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 499999 lines

Test #2:

score: 0

Accepted

time: 206ms

memory: 6876kb

input:

499998 499998
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 499998 lines

Test #3:

score: 0

Accepted

time: 203ms

memory: 6856kb

input:

500000 499997
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 499997 lines

Test #4:

score: 0

Accepted

time: 201ms

memory: 7144kb

input:

499999 500000
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 500000 lines

Test #5:

score: 0

Accepted

time: 193ms

memory: 6136kb

input:

499998 499999
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 499999 lines

Test #6:

score: 0

Accepted

time: 208ms

memory: 6920kb

input:

500000 499998
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

result:

ok 499998 lines

Subtask #2:

score: 12

Accepted

Test #7:

score: 12

Accepted

time: 3ms

memory: 5624kb

input:

output:

result:

ok 999 lines

Test #8:

score: 0

Accepted

time: 2ms

memory: 5640kb

input:

output:

result:

ok 998 lines

Test #9:

score: 0

Accepted

time: 2ms

memory: 5636kb

input:

output:

result:

ok 997 lines

Test #10:

score: 0

Accepted

time: 2ms

memory: 5592kb

input:

output:

result:

ok 1000 lines

Test #11:

score: 0

Accepted

time: 2ms

memory: 5708kb

input:

output:

result:

ok 999 lines

Test #12:

score: 0

Accepted

time: 2ms

memory: 5644kb

input:

output:

result:

ok 998 lines

Subtask #3:

score: 0

Runtime Error

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Test #13:

score: 0

Runtime Error

input:

499999 499999
374010150
448818544
940477558
518470042
44258219
119334986
898272498
225521509
652704227
96903886
837953933
680492536
873282581
682882329
809016767
640121094
296175812
92420943
324382717
271995812
707337621
329026552
257708005
326152128
599485541
490765157
126998675
914235224
831720618...