Submission #4278461
Source Code Expand
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int sum[400005],lazy[400005],a[100005],n,m;;
struct obj
{
int l,r;
}p[100005];
bool cmp(obj x,obj y)
{
return x.r-x.l<y.r-y.l;
}
void build(int k,int l,int r)
{
lazy[k]=0;
if(l==r)
{
sum[k]=a[l];
}
else
{
int mid=(l+r)>>1;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
sum[k]=sum[k<<1]+sum[k<<1|1];
}
}
void push_down(int k,int l,int r)
{
if(l==r)
{
sum[k]+=lazy[k];
a[l]=sum[k];
}
else
{
lazy[k<<1]+=lazy[k];
lazy[k<<1|1]+=lazy[k];
sum[k]+=lazy[k]*(r-l+1);
}
lazy[k]=0;
}
void change(int k,int l,int r,int x,int y,int w)
{
if(l>=x&&r<=y)
{
lazy[k]+=w;
}
else
{
push_down(k,l,r);
int mid=(l+r)>>1;
if(!(y<l||x>mid))
{
change(k<<1,l,mid,x,y,w);
}
if(!(y<mid+1||x>r))
{
change(k<<1|1,mid+1,r,x,y,w);
}
}
}
int query(int k,int l,int r,int x)
{
push_down(k,l,r);
if(l==r)
{
return a[l];
}
int mid=(l+r)>>1;
if(x<=mid)
{
return query(k<<1,l,mid,x);
}
return query(k<<1|1,mid+1,r,x);
}
int main()
{
scanf("%d%d",&n,&m);
build(1,1,m);
for(int i=0;i<n;i++)
{
scanf("%d%d",&p[i].l,&p[i].r);
}
int i=0;
sort(p,p+n,cmp);
for(int d=1;d<=m;d++)
{
while(i<n&&p[i].r-p[i].l<d)
{
change(1,1,m,p[i].l,p[i].r,1);
i++;
}
int ans=n-i;
for(int k=d;k<=m;k+=d)
{
ans+=query(1,1,m,k);
}
printf("%d\n",ans);
}
return 0;
}
Submission Info
Submission Time
2019-02-16 20:47:22+0900
Task
E - Snuke Line
User
luogu_bot2
Language
C++ (GCC 5.4.1)
Score
0
Code Size
1881 Byte
Status
WA
Exec Time
126 ms
Memory
3840 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:80:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:84:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&p[i].l,&p[i].r);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
2176 KB
00_example_02.txt
AC
1 ms
2176 KB
01.txt
AC
1 ms
2176 KB
02.txt
AC
1 ms
2176 KB
03.txt
AC
1 ms
2176 KB
04.txt
AC
1 ms
2176 KB
05.txt
AC
1 ms
2176 KB
06.txt
AC
1 ms
2176 KB
07.txt
AC
1 ms
2176 KB
08.txt
AC
1 ms
2176 KB
09.txt
AC
1 ms
2176 KB
10.txt
AC
1 ms
2176 KB
11.txt
WA
18 ms
3456 KB
12.txt
WA
17 ms
3840 KB
13.txt
WA
16 ms
3072 KB
14.txt
WA
16 ms
3072 KB
15.txt
WA
18 ms
3072 KB
16.txt
WA
17 ms
3200 KB
17.txt
WA
17 ms
3840 KB
18.txt
WA
16 ms
2944 KB
19.txt
WA
18 ms
3840 KB
20.txt
WA
18 ms
3840 KB
21.txt
WA
26 ms
3840 KB
22.txt
WA
17 ms
3840 KB
23.txt
WA
29 ms
3840 KB
24.txt
WA
17 ms
3840 KB
25.txt
WA
17 ms
3072 KB
26.txt
WA
15 ms
3072 KB
27.txt
WA
17 ms
3840 KB
28.txt
WA
17 ms
3072 KB
29.txt
WA
17 ms
3840 KB
30.txt
WA
18 ms
3072 KB
31.txt
WA
22 ms
3840 KB
32.txt
WA
16 ms
3072 KB
33.txt
WA
15 ms
3072 KB
34.txt
WA
17 ms
3840 KB
35.txt
WA
18 ms
3840 KB
36.txt
AC
1 ms
2176 KB
37.txt
AC
126 ms
3712 KB