Submission #2124316


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;

const int N=100005;

int n,m,tot,ans[N],c[N];
struct data{int x,y,l,r,id,c;}a[N*3],q[N*50];

int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

bool cmp(data a,data b)
{
	return a.x<b.x;
}

void ins(int x,int y)
{
	while (x<=m) c[x]+=y,x+=x&(-x);
}

int query(int x)
{
	int ans=0;
	while (x) ans+=c[x],x-=x&(-x);
	return ans;
}

int main()
{
	n=read();m=read();
	for (int i=1;i<=n;i++) a[i].x=read(),a[i].y=read();
	sort(a+1,a+n+1,cmp);
	for (int i=2;i<=m;i++)
	{
		for (int j=i;j<=m;j+=i)
		{
			q[++tot].x=j-i;q[tot].l=j-i+1;q[tot].r=j-1;q[tot].id=i;q[tot].c=1;
			q[++tot].x=j-1;q[tot].l=j-i+1;q[tot].r=j-1;q[tot].id=i;q[tot].c=-1;
		}
		int x=(m/i)*i;
		q[++tot].x=x;q[tot].l=x+1;q[tot].r=m;q[tot].id=i;q[tot].c=1;
		q[++tot].x=m;q[tot].l=x+1;q[tot].r=m;q[tot].id=i;q[tot].c=-1;
	}
	sort(q+1,q+tot+1,cmp);
	for (int i=1;i<=m;i++) ans[i]=n;
	int now=1;
	for (int i=1;i<=tot;i++)
	{
		while (now<=n&&a[now].x<=q[i].x) ins(a[now].y,1),now++;
		ans[q[i].id]+=q[i].c*(query(q[i].r)-query(q[i].l-1));
	}
	for (int i=1;i<=m;i++) printf("%d\n",ans[i]);
	return 0;
}

Submission Info

Submission Time
Task E - Snuke Line
User beginend
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1358 Byte
Status AC
Exec Time 434 ms
Memory 64512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 39
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 2 ms 4352 KB
00_example_02.txt AC 2 ms 4352 KB
01.txt AC 2 ms 4352 KB
02.txt AC 2 ms 4352 KB
03.txt AC 2 ms 4352 KB
04.txt AC 2 ms 4352 KB
05.txt AC 3 ms 4608 KB
06.txt AC 3 ms 4608 KB
07.txt AC 2 ms 4352 KB
08.txt AC 3 ms 4480 KB
09.txt AC 2 ms 4352 KB
10.txt AC 2 ms 4352 KB
11.txt AC 195 ms 31232 KB
12.txt AC 427 ms 64384 KB
13.txt AC 75 ms 12544 KB
14.txt AC 62 ms 9600 KB
15.txt AC 61 ms 9600 KB
16.txt AC 149 ms 24960 KB
17.txt AC 423 ms 62336 KB
18.txt AC 56 ms 8832 KB
19.txt AC 433 ms 64512 KB
20.txt AC 430 ms 64384 KB
21.txt AC 430 ms 64384 KB
22.txt AC 430 ms 64384 KB
23.txt AC 430 ms 64384 KB
24.txt AC 432 ms 64128 KB
25.txt AC 93 ms 14592 KB
26.txt AC 63 ms 9856 KB
27.txt AC 434 ms 64256 KB
28.txt AC 91 ms 14592 KB
29.txt AC 433 ms 64128 KB
30.txt AC 91 ms 14592 KB
31.txt AC 419 ms 64512 KB
32.txt AC 84 ms 14592 KB
33.txt AC 59 ms 9856 KB
34.txt AC 427 ms 64512 KB
35.txt AC 429 ms 64512 KB
36.txt AC 2 ms 4352 KB
37.txt AC 368 ms 59904 KB