Submission #1084846


Source Code Expand

#include <stdio.h>
#include <set>
#include <algorithm>

using namespace std;
typedef pair<int,int> pii;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)

int n,m;
pii ranges[353531];   // sort by first, [left, right]
pii ranges2[353531];  // sort by second, [right, id]

int ans[125252];

const int B = 400;
const int C = 300;

// pointer struct
struct data{
  // id, position, in-iterator, out-iterator
  int id,pos,in,out;
};
data pts[C];
int cnt[353531];

int main(){
  // input
  scanf("%d%d",&n,&m);
  REP(i,n){
    int l,r;
    scanf("%d%d",&l,&r);
    ranges[i] = pii(l,r);
  }
  
  // d small
  FOR(d,1,min(B,m+1)){
    int tmp = 0;
    REP(i,n){
      int x = (ranges[i].first+d-1)/d;
      if(x*d<=ranges[i].second)tmp++;
    }
    ans[d]=tmp;
  }

  // d large
  // sort
  sort(ranges,ranges+n);
  REP(i,n)ranges2[i]=pii(ranges[i].second, i);
  sort(ranges2,ranges2+n);

  // pointer init
  data yo;
  yo.id=0; yo.pos=0; yo.in=0; yo.out=0;
  set<int> S;
  int tmp = 0;
  FOR(i,1,m+1){
    yo.pos++;
    while(yo.in<n && ranges[yo.in].first==yo.pos){
      S.insert(yo.in);
      yo.in++;
    }
    while(yo.out<n && ranges2[yo.out].first<yo.pos){
      S.erase(S.find(ranges2[yo.out].second));
      yo.out++;
    }
    if(i%B==0){
      // pts
      pts[yo.id] = yo;
      yo.id++;
      for(int x : S){
        if(cnt[x]==0)tmp++;
        cnt[x]++;
      }
    }
  }

  int pts_len = yo.id;
  FOR(d,min(B,m+1),m+1){
    ans[d] = tmp;
    if(d==m)break;
    REP(i,pts_len){
      if(pts[i].pos > m)break;
      // step pts[i]
      pts[i].pos += i+1;
      while(pts[i].in<n && ranges[pts[i].in].first<=pts[i].pos){
        if(cnt[pts[i].in]==0)tmp++;
        cnt[pts[i].in]++;
        pts[i].in++;
      }
      while(pts[i].out<n && ranges2[pts[i].out].first<pts[i].pos){
        int id = ranges2[pts[i].out].second;
        cnt[id]--;
        if(cnt[id]==0)tmp--;
        pts[i].out++;
      }
    }
  }
  FOR(d,1,m+1)printf("%d\n",ans[d]);
  return 0;
}

Submission Info

Submission Time
Task E - Snuke Line
User rickytheta
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2177 Byte
Status AC
Exec Time 1276 ms
Memory 21248 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^
./Main.cpp:34:24: 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
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 2 ms 256 KB
00_example_02.txt AC 2 ms 256 KB
01.txt AC 2 ms 256 KB
02.txt AC 3 ms 384 KB
03.txt AC 3 ms 256 KB
04.txt AC 2 ms 256 KB
05.txt AC 3 ms 256 KB
06.txt AC 3 ms 256 KB
07.txt AC 2 ms 256 KB
08.txt AC 3 ms 256 KB
09.txt AC 3 ms 256 KB
10.txt AC 2 ms 256 KB
11.txt AC 711 ms 13440 KB
12.txt AC 845 ms 14080 KB
13.txt AC 586 ms 13056 KB
14.txt AC 556 ms 13056 KB
15.txt AC 555 ms 13056 KB
16.txt AC 677 ms 13312 KB
17.txt AC 839 ms 13952 KB
18.txt AC 539 ms 13056 KB
19.txt AC 841 ms 13952 KB
20.txt AC 845 ms 14080 KB
21.txt AC 841 ms 13952 KB
22.txt AC 841 ms 13952 KB
23.txt AC 843 ms 13952 KB
24.txt AC 568 ms 8704 KB
25.txt AC 527 ms 8448 KB
26.txt AC 520 ms 8576 KB
27.txt AC 607 ms 10624 KB
28.txt AC 557 ms 9856 KB
29.txt AC 638 ms 11264 KB
30.txt AC 580 ms 11520 KB
31.txt AC 1276 ms 21248 KB
32.txt AC 673 ms 20352 KB
33.txt AC 624 ms 20224 KB
34.txt AC 909 ms 14720 KB
35.txt AC 906 ms 14720 KB
36.txt AC 2 ms 256 KB
37.txt AC 12 ms 896 KB