Submission #4391604
Source Code Expand
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
#define rep(i,a,b) for(int i=(a),i##ed=(b);i<=i##ed;i++)
#define per(i,a,b) for(int i=(a),i##ed=(b);i>=i##ed;i--)
using namespace std;
const int N=300010;
int n,m,sum,pos,res;
int t[N];
struct P {
int x,y;
inline bool operator<(const P &yy)const { return y-x<yy.y-yy.x; }
};P a[N];
inline void add(int x,int w) { for(;x<=m;x+=x&-x) t[x]+=w; }
inline int ask(int x) { int s=0;for(;x;x-=x&-x) s+=t[x];return s; }
int main() {
scanf("%d%d",&n,&m),sum=n,pos=1;
rep(i,1,n) scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+n+1);
rep(i,1,m) {
for(;a[pos].y-a[pos].x+1<i&&pos<=n;)
add(a[pos].x,1),add(a[pos].y+1,-1),++pos,--sum;
res=0; rep(j,1,m/i) res+=ask(j*i);
printf("%d\n",res+sum);
}
return 0;
}
Submission Info
Submission Time
2019-02-26 12:53:19+0900
Task
E - Snuke Line
User
luogu_bot5
Language
C++ (GCC 5.4.1)
Score
700
Code Size
794 Byte
Status
AC
Exec Time
106 ms
Memory
3584 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m),sum=n,pos=1;
^
./Main.cpp:19:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,1,n) scanf("%d%d",&a[i].x,&a[i].y);
^
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
0 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
85 ms
2944 KB
12.txt
AC
104 ms
3456 KB
13.txt
AC
72 ms
2560 KB
14.txt
AC
68 ms
2560 KB
15.txt
AC
68 ms
2560 KB
16.txt
AC
81 ms
2816 KB
17.txt
AC
103 ms
3456 KB
18.txt
AC
65 ms
2560 KB
19.txt
AC
104 ms
3456 KB
20.txt
AC
106 ms
3584 KB
21.txt
AC
104 ms
3456 KB
22.txt
AC
104 ms
3456 KB
23.txt
AC
104 ms
3456 KB
24.txt
AC
92 ms
3200 KB
25.txt
AC
67 ms
2560 KB
26.txt
AC
63 ms
2560 KB
27.txt
AC
96 ms
3328 KB
28.txt
AC
70 ms
2560 KB
29.txt
AC
100 ms
3072 KB
30.txt
AC
70 ms
2560 KB
31.txt
AC
90 ms
3200 KB
32.txt
AC
68 ms
2560 KB
33.txt
AC
64 ms
2560 KB
34.txt
AC
92 ms
3584 KB
35.txt
AC
91 ms
3584 KB
36.txt
AC
0 ms
128 KB
37.txt
AC
22 ms
384 KB