Submission #3054264


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,ind;
struct node{
	int ls,rs,sum;
}tr[20500010];
void pushup(int o){
	tr[o].sum=tr[tr[o].ls].sum+tr[tr[o].rs].sum;
}
void build(int &o,int l,int r){
	o=++ind;
	if(r==l)return;
	build(tr[o].ls,l,(l+r)/2);
	build(tr[o].rs,(l+r)/2+1,r);
}
void update(int &_new,int old,int l,int r,int pos){
	_new=++ind;
	tr[_new]=tr[old];
	tr[_new].sum++;
	if(l==r)return;
	int mid=(l+r)/2;
	if(pos<=mid)update(tr[_new].ls,tr[old].ls,l,mid,pos);
	else update(tr[_new].rs,tr[old].rs,mid+1,r,pos);
	pushup(_new);
}
int query(int _new,int old,int l,int r,int x,int y){
	if(x>r||y<l)return 0;
	if(x<=l&&y>=r)return tr[_new].sum-tr[old].sum;
	int mid=(l+r)/2;
	if(y<=mid)return query(tr[_new].ls,tr[old].ls,l,mid,x,y);
	else if(x>mid)return query(tr[_new].rs,tr[old].rs,mid+1,r,x,y);
	else return query(tr[_new].ls,tr[old].ls,l,mid,x,mid)+query(tr[_new].rs,tr[old].rs,mid+1,r,mid+1,y);
}
int rt[551000];
struct data{
	int l,r;
	friend bool operator <(data a,data b){
		return a.l==b.l?a.r<b.r:a.l<b.l;
	}
}item[300100];
void solve(int d){
	int res=0,now=0,pre=0;
	for(int i=1;i*d<=m;++i){
		int k=0;
		for(int j=16;j>=0;--j){
			if((1<<j)>n)continue;
			if((k+(1<<j))<=n&&(item[k+(1<<j)].l-1)/d<i)k+=(1<<j);
		}
		now=k;
		if(now>n)now=n;
		int t=(item[now].l-1)/d;
		res+=query(rt[now],rt[pre],1,m,d*(t+1),m);
		pre=now;
	}
	printf("%d\n",res);
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i){
		scanf("%d%d",&item[i].l,&item[i].r);
	}
	sort(item+1,item+n+1);
	build(rt[0],1,n);
	for(int i=1;i<=n;++i){
		update(rt[i],rt[i-1],1,m,item[i].r);
	}
	for(int d=1;d<=m;++d){
		solve(d);
	}
}

Submission Info

Submission Time
Task E - Snuke Line
User luogu_bot3
Language C++ (GCC 5.4.1)
Score 0
Code Size 1748 Byte
Status WA
Exec Time 511 ms
Memory 76544 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:61: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:63:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&item[i].l,&item[i].r);
                                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 14
WA × 25
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 2 ms 4352 KB
06.txt AC 3 ms 4352 KB
07.txt AC 2 ms 4352 KB
08.txt AC 2 ms 4352 KB
09.txt AC 2 ms 4352 KB
10.txt AC 2 ms 4352 KB
11.txt WA 264 ms 70144 KB
12.txt WA 507 ms 74496 KB
13.txt WA 136 ms 61696 KB
14.txt WA 113 ms 55552 KB
15.txt WA 113 ms 55552 KB
16.txt WA 219 ms 67968 KB
17.txt WA 498 ms 74496 KB
18.txt WA 104 ms 51456 KB
19.txt WA 511 ms 74496 KB
20.txt WA 509 ms 74496 KB
21.txt WA 511 ms 74496 KB
22.txt WA 508 ms 74496 KB
23.txt WA 508 ms 74496 KB
24.txt WA 491 ms 76160 KB
25.txt WA 144 ms 63744 KB
26.txt WA 112 ms 57600 KB
27.txt WA 496 ms 76160 KB
28.txt WA 148 ms 63744 KB
29.txt WA 501 ms 74240 KB
30.txt WA 150 ms 63744 KB
31.txt WA 491 ms 74624 KB
32.txt WA 143 ms 63744 KB
33.txt WA 112 ms 57600 KB
34.txt WA 492 ms 76544 KB
35.txt WA 491 ms 76544 KB
36.txt AC 2 ms 4352 KB
37.txt AC 157 ms 4480 KB