Submission #1185864
Source Code Expand
#include<bits/stdc++.h>
#define N 300005
#define M 6000005
using namespace std;
int n,m,trtot,ls[M],rs[M],sum[M],rt[N]; struct node{ int x,y; }a[N];
bool cmp(node u,node v){ return u.x<v.x; }
void add(int l,int r,int x,int &y,int z){
y=++trtot; sum[y]=sum[x]+1;
if (l==r) return; int mid=l+r>>1;
if (z<=mid){ rs[y]=rs[x]; add(l,mid,ls[x],ls[y],z); }
else{ ls[y]=ls[x]; add(mid+1,r,rs[x],rs[y],z); }
}
int qry(int k,int l,int r,int x){
if (x<l || !k) return 0;
if (l==r) return sum[k];
int mid=l+r>>1;
if (x<=mid) return qry(ls[k],l,mid,x); else return sum[ls[k]]+qry(rs[k],mid+1,r,x);
}
int main(){
scanf("%d%d",&n,&m);
int i,j,k;
for (i=1; i<=n; i++) scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+n+1,cmp);
for (i=m,j=n; i; i--){
rt[i]=rt[i+1];
for (; j && a[j].x==i; j--) add(1,m,rt[i],rt[i],a[j].y);
}
for (i=1; i<=m; i++){
for (k=n,j=0; j<=m; j+=i) k-=qry(rt[j+1],1,m,j+i-1);
printf("%d\n",k);
}
return 0;
}
Submission Info
Submission Time
2017-03-27 14:25:26+0900
Task
E - Snuke Line
User
lych_cys
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
968 Byte
Status
AC
Exec Time
218 ms
Memory
70528 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21: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:23:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (i=1; i<=n; i++) 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
2 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
2 ms
6400 KB
06.txt
AC
2 ms
6400 KB
07.txt
AC
2 ms
2304 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
128 ms
66048 KB
12.txt
AC
178 ms
70400 KB
13.txt
AC
99 ms
57600 KB
14.txt
AC
90 ms
51456 KB
15.txt
AC
90 ms
51456 KB
16.txt
AC
119 ms
63872 KB
17.txt
AC
175 ms
70400 KB
18.txt
AC
85 ms
47360 KB
19.txt
AC
178 ms
70400 KB
20.txt
AC
179 ms
70400 KB
21.txt
AC
176 ms
70400 KB
22.txt
AC
182 ms
70400 KB
23.txt
AC
177 ms
70400 KB
24.txt
AC
218 ms
70144 KB
25.txt
AC
103 ms
59648 KB
26.txt
AC
90 ms
51456 KB
27.txt
AC
217 ms
70272 KB
28.txt
AC
107 ms
59648 KB
29.txt
AC
177 ms
70272 KB
30.txt
AC
108 ms
57600 KB
31.txt
AC
105 ms
70528 KB
32.txt
AC
90 ms
59648 KB
33.txt
AC
85 ms
53504 KB
34.txt
AC
199 ms
70528 KB
35.txt
AC
196 ms
70528 KB
36.txt
AC
2 ms
2304 KB
37.txt
AC
19 ms
6528 KB