Submission #5408356


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>

typedef int32_t i32;
typedef int64_t i64;

static void print_int(i64 n){if(n<0){putchar('-');n=-n;}if(n==0){putchar('0');return;}int s[20],len=0;while(n>0){s[len++]=n%10+'0';n/=10;}while(len>0){putchar(s[--len]);}}
static i64 read_int(void){int prev='\0';int c=getchar();while(!('0'<=c && c<='9')){prev=c;c=getchar();}i64 res=0;while('0'<=c && c<='9'){res=10*res+c-'0';c=getchar();}return prev=='-'?-res:res;}

void add (i32 *bit, i32 x, i32 v) {
  i32 n = bit[0];
  for (i32 i = x; i <= n; i += i & -i) {
    bit[i] += v;
  }
}

i32 find (i32 *bit, i32 x) {
  i32 sum = 0;
  for (i32 i = x; i > 0; i -= i & -i) {
    sum += bit[i];
  }
  return sum;
}

typedef struct range {
  i32 l, r;
  struct range *next;
} range;

void run (void) {
  i32 n = read_int();
  i32 m = read_int();
  range *a = (range *) calloc (n, sizeof (range));
  range **start = (range **) calloc (m + 1, sizeof (range *));
  for (i32 i = 0; i < n; ++i, ++a) {
    i32 l = read_int();
    i32 r = read_int() + 1;
    i32 d = r - l;
    *a = (range) {l, r, start[d]};
    start[d] = a;
  }
  i32 *bit = (i32 *) calloc (m + 2, sizeof (i32));
  bit[0] = m + 1;
  for (i32 d = 1, i = 0; d <= m; ++d) {
    for (range *p = start[d - 1]; p != NULL; p = p->next) {
      ++i;
      add (bit, p->l, 1);
      add (bit, p->r, -1);
    }
    i32 ans = n - i;
    for (i32 j = d; j <= m; j += d) {
      ans += find (bit, j);
    }
    print_int (ans);
    putchar ('\n');
  }
}

int main (void) {
  run();
  return 0;
}

Submission Info

Submission Time
Task E - Snuke Line
User sansen
Language C (GCC 5.4.1)
Score 700
Code Size 1625 Byte
Status AC
Exec Time 68 ms
Memory 6656 KB

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 128 KB
00_example_02.txt AC 1 ms 128 KB
01.txt AC 1 ms 128 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 128 KB
04.txt AC 1 ms 128 KB
05.txt AC 1 ms 128 KB
06.txt AC 1 ms 128 KB
07.txt AC 1 ms 128 KB
08.txt AC 1 ms 128 KB
09.txt AC 1 ms 128 KB
10.txt AC 1 ms 128 KB
11.txt AC 49 ms 5632 KB
12.txt AC 68 ms 6656 KB
13.txt AC 36 ms 4992 KB
14.txt AC 32 ms 4864 KB
15.txt AC 32 ms 4864 KB
16.txt AC 44 ms 5376 KB
17.txt AC 65 ms 6528 KB
18.txt AC 32 ms 4864 KB
19.txt AC 65 ms 6656 KB
20.txt AC 66 ms 6656 KB
21.txt AC 63 ms 6656 KB
22.txt AC 65 ms 6656 KB
23.txt AC 64 ms 6656 KB
24.txt AC 58 ms 5504 KB
25.txt AC 36 ms 4992 KB
26.txt AC 33 ms 4864 KB
27.txt AC 60 ms 5632 KB
28.txt AC 38 ms 4992 KB
29.txt AC 61 ms 5504 KB
30.txt AC 37 ms 4992 KB
31.txt AC 57 ms 5632 KB
32.txt AC 37 ms 5120 KB
33.txt AC 33 ms 4864 KB
34.txt AC 59 ms 5888 KB
35.txt AC 59 ms 5888 KB
36.txt AC 1 ms 128 KB
37.txt AC 16 ms 384 KB