Submission #4278318
Source Code Expand
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxn=3e5+5,maxm=1e5+5;
int m,n;
struct Pair{
int l,r;
}p[maxn];
bool Cmp(Pair a,Pair b){return a.r-a.l<b.r-b.l;}
int a[maxn],s[maxn*4],tag[maxn*4];
void build(int node,int begin,int end){
tag[node]=0;
if(begin==end){
s[node]=a[begin];
}else{
build(2*node,begin,(begin+end)/2);
build(2*node+1,(begin+end)/2+1,end);
s[node]=s[2*node]+s[2*node+1];
}
}
void pushdown(int node,int begin,int end){
if(begin==end){
s[node]+=tag[node];
a[begin]=s[node];
}else{
tag[2*node]+=tag[node];
tag[2*node+1]+=tag[node];
s[node]+=tag[node]*(end-begin+1);
}
tag[node]=0;
}
void Change(int node,int begin,int end,int left,int right,int add){
if(begin>=left&&end<=right){
tag[node]+=add;
}else{
pushdown(node,begin,end);
int m=(begin+end)/2;
if(!(right<begin||left>m)){
Change(2*node,begin,m,left,right,add);
}
if(!(right<m+1||left>end)){
Change(2*node+1,m+1,end,left,right,add);
}
}
}
int query(int node,int begin,int end,int idx){
pushdown(node,begin,end);
if(begin==end)return a[begin];
int m=(begin+end)/2;
if(idx<=m)return query(2*node,begin,m,idx);
return query(2*node+1,m+1,end,idx);
}
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);
sort(p,p+n,Cmp);
int i=0;
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:38:39+0900
Task
E - Snuke Line
User
luogu_bot3
Language
C++ (GCC 5.4.1)
Score
700
Code Size
2074 Byte
Status
AC
Exec Time
285 ms
Memory
8704 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:56: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:59: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
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
3 ms
6400 KB
00_example_02.txt
AC
2 ms
6400 KB
01.txt
AC
2 ms
6400 KB
02.txt
AC
3 ms
6400 KB
03.txt
AC
2 ms
6400 KB
04.txt
AC
2 ms
6400 KB
05.txt
AC
3 ms
6400 KB
06.txt
AC
3 ms
6400 KB
07.txt
AC
2 ms
6400 KB
08.txt
AC
3 ms
6400 KB
09.txt
AC
2 ms
6400 KB
10.txt
AC
2 ms
6400 KB
11.txt
AC
179 ms
7808 KB
12.txt
AC
283 ms
8576 KB
13.txt
AC
126 ms
7168 KB
14.txt
AC
107 ms
7040 KB
15.txt
AC
106 ms
7040 KB
16.txt
AC
158 ms
7424 KB
17.txt
AC
278 ms
8576 KB
18.txt
AC
98 ms
7040 KB
19.txt
AC
285 ms
8576 KB
20.txt
AC
284 ms
8576 KB
21.txt
AC
284 ms
8576 KB
22.txt
AC
284 ms
8576 KB
23.txt
AC
284 ms
8576 KB
24.txt
AC
251 ms
8320 KB
25.txt
AC
115 ms
7168 KB
26.txt
AC
101 ms
7040 KB
27.txt
AC
266 ms
8448 KB
28.txt
AC
127 ms
7168 KB
29.txt
AC
276 ms
8448 KB
30.txt
AC
126 ms
7168 KB
31.txt
AC
277 ms
8704 KB
32.txt
AC
137 ms
7168 KB
33.txt
AC
118 ms
7040 KB
34.txt
AC
265 ms
8704 KB
35.txt
AC
265 ms
8704 KB
36.txt
AC
2 ms
6400 KB
37.txt
AC
134 ms
7552 KB