Submission #5495310
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5+5;
int sum[N],add[N];
int pen[N];
void update(int ind,int add) {
while(ind<N) {
pen[ind] += add;
ind += ind&(-ind);
}
}
int query(int ind) {
int ret= 0;
while(ind>0) {
ret += pen[ind];
ind = ind&(ind-1);
}
return ret;
}
vector<pair<pair<int,int>,int> > input[N];
void solve() {
int n,m;
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i) {
int l,r;
scanf("%d%d",&l,&r);
int len = r-l+1;
sum[1] += 1;
sum[len+1] -= 1;
if(len+1<=r) {
input[len+1].push_back(make_pair(make_pair(l,r),1));
input[r+1].push_back(make_pair(make_pair(l,r),-1));
}
}
int d,i,l,r,pos,ret;
for(d=1;d<=m;++d) {
sum[d] = sum[d-1] + sum[d];
for(i=0;i<input[d].size();++i) {
l = input[d][i].first.first;
r = input[d][i].first.second;
pos = input[d][i].second;
update(l,pos);
update(r+1,-pos);
}
ret = sum[d];
for(i = d;i<=m;i+=d) {
ret += query(i);
}
printf("%d\n", ret);
}
}
int main() {
//freopen("input.txt","r",stdin);
solve();
}
Submission Info
Submission Time
2019-05-21 00:14:09+0900
Task
E - Snuke Line
User
ffresh
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1269 Byte
Status
AC
Exec Time
152 ms
Memory
14976 KB
Compile Error
./Main.cpp: In function ‘void solve()’:
./Main.cpp:30:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:33:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&l,&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
2 ms
2560 KB
00_example_02.txt
AC
2 ms
2560 KB
01.txt
AC
2 ms
2560 KB
02.txt
AC
3 ms
2688 KB
03.txt
AC
2 ms
2688 KB
04.txt
AC
2 ms
2688 KB
05.txt
AC
2 ms
2688 KB
06.txt
AC
2 ms
2688 KB
07.txt
AC
2 ms
2560 KB
08.txt
AC
3 ms
2688 KB
09.txt
AC
2 ms
2688 KB
10.txt
AC
2 ms
2560 KB
11.txt
AC
112 ms
13364 KB
12.txt
AC
145 ms
14720 KB
13.txt
AC
95 ms
12344 KB
14.txt
AC
84 ms
11828 KB
15.txt
AC
84 ms
11828 KB
16.txt
AC
105 ms
12980 KB
17.txt
AC
150 ms
14592 KB
18.txt
AC
79 ms
11444 KB
19.txt
AC
144 ms
14720 KB
20.txt
AC
143 ms
14720 KB
21.txt
AC
144 ms
14720 KB
22.txt
AC
152 ms
14720 KB
23.txt
AC
146 ms
14720 KB
24.txt
AC
119 ms
13040 KB
25.txt
AC
88 ms
11632 KB
26.txt
AC
83 ms
12016 KB
27.txt
AC
129 ms
14976 KB
28.txt
AC
91 ms
11632 KB
29.txt
AC
129 ms
14080 KB
30.txt
AC
94 ms
12264 KB
31.txt
AC
96 ms
11820 KB
32.txt
AC
82 ms
11052 KB
33.txt
AC
79 ms
10924 KB
34.txt
AC
109 ms
13312 KB
35.txt
AC
109 ms
13312 KB
36.txt
AC
2 ms
2560 KB
37.txt
AC
22 ms
3200 KB