Submission #2126363
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=3e5+20; int n,m,c[N]; struct node{ int l,r,len; }a[N]; bool cmp(node a,node b) { return a.len<b.len; } void update(int j,int k) { for(int i=j;i<=m;i+=(i&-i)) c[i]+=k; } int sum(int j) { int res=0; for(int i=j;i>=1;i-=(i&-i)) res+=c[i]; return res; } int main() { while(cin>>n>>m) { memset(c,0,sizeof(c));// for(int i=1;i<=n;i++) { scanf("%d%d",&a[i].l,&a[i].r); a[i].len=a[i].r-a[i].l+1; } sort(a+1,a+n+1,cmp); int k=1; for(int d=1;d<=m;d++) { //O(m+nlogm) for(;k<=n&&a[k].len<d;k++)//最多n次 { update(a[k].l,1); update(a[k].r+1,-1);//差分,[1..li..kd..ri,ri+1...m],树状数组统计前缀和 } int ans=n-k+1;//区间长度>=d个数 //O(mlogm) for(int e=d;e<=m;e+=d) { ans+=sum(e); } cout<<ans<<endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Snuke Line |
User | zjqaq |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1508 Byte |
Status | AC |
Exec Time | 262 ms |
Memory | 5632 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:32:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&a[i].l,&a[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 | 2 ms | 2944 KB |
00_example_02.txt | AC | 2 ms | 2944 KB |
01.txt | AC | 2 ms | 2944 KB |
02.txt | AC | 2 ms | 2944 KB |
03.txt | AC | 2 ms | 2944 KB |
04.txt | AC | 2 ms | 2944 KB |
05.txt | AC | 3 ms | 2944 KB |
06.txt | AC | 3 ms | 2944 KB |
07.txt | AC | 2 ms | 2944 KB |
08.txt | AC | 3 ms | 2944 KB |
09.txt | AC | 2 ms | 2944 KB |
10.txt | AC | 2 ms | 2944 KB |
11.txt | AC | 154 ms | 5120 KB |
12.txt | AC | 255 ms | 5504 KB |
13.txt | AC | 92 ms | 4992 KB |
14.txt | AC | 80 ms | 4992 KB |
15.txt | AC | 80 ms | 4992 KB |
16.txt | AC | 132 ms | 5120 KB |
17.txt | AC | 254 ms | 5504 KB |
18.txt | AC | 74 ms | 4992 KB |
19.txt | AC | 262 ms | 5504 KB |
20.txt | AC | 262 ms | 5504 KB |
21.txt | AC | 258 ms | 5504 KB |
22.txt | AC | 259 ms | 5504 KB |
23.txt | AC | 257 ms | 5504 KB |
24.txt | AC | 244 ms | 5248 KB |
25.txt | AC | 92 ms | 4992 KB |
26.txt | AC | 76 ms | 4992 KB |
27.txt | AC | 255 ms | 5376 KB |
28.txt | AC | 95 ms | 4992 KB |
29.txt | AC | 253 ms | 5248 KB |
30.txt | AC | 95 ms | 4992 KB |
31.txt | AC | 242 ms | 5632 KB |
32.txt | AC | 93 ms | 4992 KB |
33.txt | AC | 77 ms | 4992 KB |
34.txt | AC | 247 ms | 5632 KB |
35.txt | AC | 243 ms | 5632 KB |
36.txt | AC | 2 ms | 2944 KB |
37.txt | AC | 170 ms | 3072 KB |