답안 #23130 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23130	2017-05-03T10:51:08 Z	model_code	Nuclearia (CEOI15_nuclearia)	C	55 / 100	1000 ms	217320 KB

nuclearia

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

#define MAXH 3500

struct node
{
  unsigned long long coef[2];
};

static int w, h, span;
static struct node *itrees[MAXH];
static unsigned long long *values[MAXH];
static struct node *coefs;

static void
exch (int *a, int *b, int sw)
{
  int t;

  if (!sw)
    return;

  t = *a;
  *a = *b;
  *b = t;
}

static void
add_to_coefs (struct node *itree, int idx, int aspan, int tof, int tot, unsigned long long toadd[2])
{
  if (tof == 0 && tot == aspan - 1)
    {
      itree[idx].coef[0] += toadd[0];
      itree[idx].coef[1] += toadd[1];
      return;
    }

  aspan /= 2;
  if (tot < aspan)
    {
      add_to_coefs (itree, 2 * idx + 1, aspan, tof, tot, toadd);
      return;
    }
  if (tof >= aspan)
    {
      add_to_coefs (itree, 2 * idx + 2, aspan, tof - aspan, tot - aspan, toadd);
      return;
    }
  add_to_coefs (itree, 2 * idx + 1, aspan, tof, aspan - 1, toadd);
  add_to_coefs (itree, 2 * idx + 2, aspan, 0, tot - aspan, toadd);
}

static void
extract_coefs (struct node *itree, int idx, int aspan, struct node coefs[], struct node add)
{
  add.coef[0] += itree[idx].coef[0];
  add.coef[1] += itree[idx].coef[1];
  if (aspan == 1)
    {
      coefs[0] = add;
      return;
    }

  aspan /= 2;

  extract_coefs (itree, 2 * idx + 1, aspan, coefs, add);
  extract_coefs (itree, 2 * idx + 2, aspan, coefs + aspan, add);
}

static void
plant_interval (int x1, int x2, int y, unsigned long long toadd[2])
{
  if (x1 < 0)
    x1 = 0;

  if (x2 >= w)
    x2 = w - 1;

  if (x1 > x2)
    return;

  add_to_coefs (itrees[y], 0, span, x1, x2, toadd);
}

static void
plant_row (int x, int y, int delta, int rowsz, unsigned long long a, unsigned long long b)
{
  unsigned long long toadd[2];

  toadd[0] = a;
  toadd[1] = 0;
  plant_interval (x - delta, x + delta, y, toadd);

  toadd[0] = a + b * (x + delta);
  toadd[1] = -b;
  plant_interval (x + delta + 1, x + rowsz, y, toadd);

  toadd[0] = a - b * (x - delta);
  toadd[1] = b;
  plant_interval (x - rowsz, x - delta - 1, y, toadd);
}

static void
add_plant (int x, int y, unsigned long long a, unsigned long long b)
{
  int ay, sp = (a - 1) / b;
  long long abv;

  abv = a;
  for (ay = y; ay < h; ay++)
    {
      plant_row (x, ay, ay - y, sp, abv, b);
      if (abv <= b)
	break;
      abv -= b;
    }

  if (a <= b)
    return;

  abv = a - b;
  for (ay = y - 1; ay >= 0; ay--)
    {
      plant_row (x, ay, y - ay, sp, abv, b);
      if (abv <= b)
	break;
      abv -= b;
    }
}

static unsigned long long
get_value (int x, int y, struct node c)
{
  return c.coef[0] + c.coef[1] * x;
}

static unsigned long long
corsum (int x, int y)
{
  if (x < 0 || y < 0)
    return 0;
  return values[y][x];
}

static unsigned long long
get_sum (int x1, int y1, int x2, int y2)
{
  return corsum (x2, y2) - corsum (x1 - 1, y2) - corsum (x2, y1 - 1) + corsum (x1 - 1, y1 - 1);
}

int main (void)
{
  int i, n;
  int swap = 0;
  int x, y, a, b, q;

  scanf ("%d%d", &w, &h);
  if (w < h)
    {
      swap = 1;
      exch (&w, &h, swap);
    }

  for (span = 1; span < w; span <<= 1)
    continue;

  for (i = 0; i < h; i++)
    itrees[i] = calloc (2 * span - 1, sizeof (struct node));

  scanf ("%d", &n);
  for (i = 0; i < n; i++)
    {
      scanf ("%d%d%d%d", &x, &y, &a, &b);
      x--; y--;
      exch (&x, &y, swap);
      add_plant (x, y, a, b);
    }

  coefs = malloc (span * sizeof (struct node));
  for (y = 0; y < h; y++)
    {
      struct node a = {{0, 0}};
      values[y] = malloc (w * sizeof (unsigned long long));
      extract_coefs (itrees[y], 0, span, coefs, a);

      for (x = 0; x < w; x++)
	{
	  unsigned long long av = get_value (x, y, coefs[x]);

	  unsigned long long psum = corsum (x - 1, y) + corsum (x, y - 1) - corsum (x - 1, y - 1);

	  values[y][x] = psum + av;
	}
    }

  scanf ("%d", &q);
  for (i = 0; i < q; i++)
    {
      int x1, y1, x2, y2;
      unsigned long long s, ar;

      scanf ("%d%d%d%d", &x1, &y1, &x2, &y2);
      x1--; y1--; x2--; y2--;
      exch (&x1, &y1, swap);
      exch (&x2, &y2, swap);
      s = get_sum (x1, y1, x2, y2);
      ar = (unsigned long long) (x2 - x1 + 1) * (y2 - y1 + 1);

      printf ("%llu\n", (s + ar / 2) / ar);
    }

  return 0;
}

Compilation message

nuclearia.c: In function 'main':
nuclearia.c:158:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d", &w, &h);
   ^
nuclearia.c:171:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d", &n);
   ^
nuclearia.c:174:7: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
       scanf ("%d%d%d%d", &x, &y, &a, &b);
       ^
nuclearia.c:197:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d", &q);
   ^
nuclearia.c:203:7: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
       scanf ("%d%d%d%d", &x1, &y1, &x2, &y2);
       ^

Subtask #1
3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	217320 KB	Output is correct
2	Correct	89 ms	1172 KB	Output is correct
3	Correct	99 ms	1172 KB	Output is correct

Subtask #2
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	49 ms	217320 KB	Output is correct
2	Correct	123 ms	1172 KB	Output is correct

Subtask #3
3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	150848 KB	Output is correct
2	Correct	109 ms	1172 KB	Output is correct

Subtask #4
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	43 ms	104824 KB	Output is correct
2	Correct	123 ms	1172 KB	Output is correct

Subtask #5
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	263 ms	217320 KB	Output is correct
2	Correct	133 ms	1172 KB	Output is correct

Subtask #6
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	173 ms	58148 KB	Output is correct
2	Correct	86 ms	1172 KB	Output is correct

Subtask #7
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	266 ms	150848 KB	Output is correct
2	Correct	129 ms	1172 KB	Output is correct

Subtask #8
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	166 ms	49960 KB	Output is correct
2	Correct	103 ms	1172 KB	Output is correct

Subtask #9
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	653 ms	217320 KB	Output is correct

Subtask #10
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	676 ms	217320 KB	Output is correct

Subtask #11
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	131172 KB	Execution timed out
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	133172 KB	Execution timed out
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	129672 KB	Execution timed out
2	Halted	0 ms	0 KB	-

Subtask #14
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	131172 KB	Execution timed out
2	Halted	0 ms	0 KB	-