Submission #3426475
Source Code Expand
#include<algorithm> #include<cstring> #include<cctype> #include<cstdio> #include<vector> #define rep(i,x,y) for(int i=x; i<=y; ++i) #define pb push_back using namespace std; typedef long long LL; const int N=100005; int n,m,t1[N],t2[N],tot; vector <int> vt[N]; int getint() { char ch; while(!isdigit(ch=getchar())); int x=ch-48; while(isdigit(ch=getchar())) x=x*10+ch-48; return x; } void ins(int t[],int x) { for(int i=x+1; i<=m+1; i+=i&-i) ++t[i]; } int query(int t[],int x) { if(x<0) return 0; int rt=0; for(int i=x+1; i; i-=i&-i) rt+=t[i]; return rt; } int query(int t[],int l,int r) { r=min(r,m); return query(t,r)-query(t,l-1); } int solve(int p) { LL ans=0; int sz=vt[p].size(); rep(i,0,sz-1) ins(t1,vt[p][i]),ins(t2,vt[p][i]+p-1),++tot; rep(i,0,m/p) { int l=i*p,r=(i+1)*p-1; ans+=(LL)(query(t2,l,r)-query(t1,l,r))*i; } return ans+n-tot; } int main() { n=getint(),m=getint(); rep(i,1,n) { int l=getint(),r=getint(); vt[r-l+2].pb(l-1); } rep(i,1,m) printf("%d\n",solve(i)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Snuke Line |
User | superguymj |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1097 Byte |
Status | AC |
Exec Time | 115 ms |
Memory | 7168 KB |
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 | 2 ms | 2560 KB |
03.txt | AC | 2 ms | 2560 KB |
04.txt | AC | 2 ms | 2560 KB |
05.txt | AC | 2 ms | 2560 KB |
06.txt | AC | 2 ms | 2560 KB |
07.txt | AC | 2 ms | 2560 KB |
08.txt | AC | 2 ms | 2560 KB |
09.txt | AC | 2 ms | 2560 KB |
10.txt | AC | 2 ms | 2560 KB |
11.txt | AC | 68 ms | 5504 KB |
12.txt | AC | 115 ms | 7168 KB |
13.txt | AC | 41 ms | 4608 KB |
14.txt | AC | 34 ms | 4352 KB |
15.txt | AC | 34 ms | 4352 KB |
16.txt | AC | 60 ms | 5120 KB |
17.txt | AC | 111 ms | 7040 KB |
18.txt | AC | 32 ms | 4352 KB |
19.txt | AC | 113 ms | 7168 KB |
20.txt | AC | 113 ms | 7168 KB |
21.txt | AC | 113 ms | 7168 KB |
22.txt | AC | 115 ms | 7168 KB |
23.txt | AC | 115 ms | 7168 KB |
24.txt | AC | 95 ms | 5248 KB |
25.txt | AC | 39 ms | 4348 KB |
26.txt | AC | 32 ms | 4220 KB |
27.txt | AC | 97 ms | 5504 KB |
28.txt | AC | 41 ms | 4604 KB |
29.txt | AC | 102 ms | 5504 KB |
30.txt | AC | 45 ms | 4600 KB |
31.txt | AC | 89 ms | 4992 KB |
32.txt | AC | 38 ms | 4352 KB |
33.txt | AC | 32 ms | 4352 KB |
34.txt | AC | 93 ms | 5632 KB |
35.txt | AC | 93 ms | 5632 KB |
36.txt | AC | 2 ms | 2560 KB |
37.txt | AC | 55 ms | 2816 KB |