Submission #3420694


Source Code Expand

#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
struct qq{int l,r;}a[300005];
int m,n,now,b[100005];
bool cmp(qq e,qq f)
{
	return e.r-e.l<f.r-f.l;
}
void add(int x,int d)
{
	for (int k=x;k<=n;k+=k&-k)
	  b[k]+=d;
}
int sum(int x)
{
    int s=0;
	for (int k=x;k;k-=k&-k)
	  s+=b[k];
	return s;  
}
int main()
{
   scanf("%d%d",&m,&n); 
   for (int i=1;i<=m;i++)
     scanf("%d%d",&a[i].l,&a[i].r);
   sort(a+1,a+1+m,cmp); 
   now=1;
   for (int i=1;i<=n;i++)
     {
     int ans=0;	
	 for (int j=now;j<=m;j++)
	   if (a[j].r-a[j].l<i) 
	   {
	   add(a[j].l,1);
	   add(a[j].r+1,-1); 
	   now++;
       }
       else
       break;
     for (int j=i;j<=n;j+=i)
	   ans+=sum(j);
	 printf("%d\n",(m-now+1)+ans);
     }
}

Submission Info

Submission Time
Task E - Snuke Line
User liangjialin
Language C++14 (GCC 5.4.1)
Score 700
Code Size 863 Byte
Status AC
Exec Time 110 ms
Memory 3712 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&m,&n); 
                       ^
./Main.cpp:31:35: 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
AC × 2
AC × 39
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 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 2 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 92 ms 2944 KB
12.txt AC 110 ms 3584 KB
13.txt AC 79 ms 2688 KB
14.txt AC 75 ms 2560 KB
15.txt AC 75 ms 2560 KB
16.txt AC 87 ms 2944 KB
17.txt AC 109 ms 3584 KB
18.txt AC 72 ms 2560 KB
19.txt AC 110 ms 3584 KB
20.txt AC 110 ms 3584 KB
21.txt AC 110 ms 3584 KB
22.txt AC 110 ms 3584 KB
23.txt AC 110 ms 3584 KB
24.txt AC 98 ms 3328 KB
25.txt AC 74 ms 2688 KB
26.txt AC 70 ms 2560 KB
27.txt AC 102 ms 3328 KB
28.txt AC 77 ms 2688 KB
29.txt AC 105 ms 3200 KB
30.txt AC 77 ms 2688 KB
31.txt AC 95 ms 3328 KB
32.txt AC 74 ms 2688 KB
33.txt AC 71 ms 2688 KB
34.txt AC 97 ms 3712 KB
35.txt AC 97 ms 3712 KB
36.txt AC 1 ms 256 KB
37.txt AC 22 ms 512 KB