Submission #2875220
Source Code Expand
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=300005,M=100005;
int n,m,cnt[M*4];
struct node
{
int l,r;
}a[N];
bool operator<(const node&a,const node&b){return a.r-a.l<b.r-b.l;}
void insert(int u,int l,int r,int ql,int qr)
{
if(l>=ql&&r<=qr){cnt[u]++;return;}
int mid=l+r>>1;
if(ql<=mid)insert(u<<1,l,mid,ql,qr);
if(qr>mid)insert(u<<1|1,mid+1,r,ql,qr);
}
int query(int p)
{
int ans=0,u=1,l=1,r=m;
for(;;)
{
ans+=cnt[u];
if(l==r)break;
int mid=l+r>>1;
if(p<=mid)u=u<<1,r=mid;
else u=u<<1|1,l=mid+1;
}
return ans;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d%d",&a[i].l,&a[i].r);
sort(a+1,a+1+n);
for(int i=1,j=1;i<=m;i++)
{
while(j<=n&&a[j].r-a[j].l<i)insert(1,1,m,a[j].l,a[j].r),j++;
int ans=0;
for(int k=i;k<=m;k+=i)ans+=query(k);
printf("%d\n",ans+n-j+1);
}
return 0;
}
Submission Info
Submission Time
2018-07-21 18:18:45+0900
Task
E - Snuke Line
User
luogu_bot2
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
857 Byte
Status
AC
Exec Time
191 ms
Memory
4224 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:37:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:38:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++)scanf("%d%d",&a[i].l,&a[i].r);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
700 / 700
Status
Set Name
Test Cases
Sample
00_example_01.txt, 00_example_02.txt
All
00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt
Case Name
Status
Exec Time
Memory
00_example_01.txt
AC
1 ms
128 KB
00_example_02.txt
AC
1 ms
128 KB
01.txt
AC
1 ms
128 KB
02.txt
AC
1 ms
256 KB
03.txt
AC
1 ms
128 KB
04.txt
AC
1 ms
128 KB
05.txt
AC
1 ms
128 KB
06.txt
AC
1 ms
128 KB
07.txt
AC
1 ms
128 KB
08.txt
AC
1 ms
128 KB
09.txt
AC
1 ms
128 KB
10.txt
AC
1 ms
128 KB
11.txt
AC
129 ms
3328 KB
12.txt
AC
190 ms
4096 KB
13.txt
AC
97 ms
2560 KB
14.txt
AC
85 ms
2560 KB
15.txt
AC
85 ms
2560 KB
16.txt
AC
117 ms
2944 KB
17.txt
AC
187 ms
4096 KB
18.txt
AC
78 ms
2560 KB
19.txt
AC
191 ms
4096 KB
20.txt
AC
191 ms
4224 KB
21.txt
AC
191 ms
4096 KB
22.txt
AC
191 ms
4096 KB
23.txt
AC
191 ms
4096 KB
24.txt
AC
166 ms
3840 KB
25.txt
AC
88 ms
2688 KB
26.txt
AC
79 ms
2560 KB
27.txt
AC
177 ms
3968 KB
28.txt
AC
97 ms
2688 KB
29.txt
AC
185 ms
3584 KB
30.txt
AC
97 ms
2688 KB
31.txt
AC
179 ms
3200 KB
32.txt
AC
100 ms
2560 KB
33.txt
AC
90 ms
2560 KB
34.txt
AC
175 ms
4224 KB
35.txt
AC
174 ms
4224 KB
36.txt
AC
1 ms
128 KB
37.txt
AC
77 ms
384 KB