oj.uz

Submission #23128

# Submission time Handle Problem Language Result Execution time Memory
23128 2017-05-03T10:50:49 Z model_code Nuclearia (CEOI15_nuclearia) C++11
40 / 100
 283 ms 188616 KB 
#include <stdio.h>
#include <stdlib.h>

#define MAXW 10000000
#define MAXN 1000000
#define MAXQ 1000000

typedef long long int huge;

int w, h, n, q;

typedef struct PLANT
{
	int x;
	int y;
	int a;
	int b;
}
PLANT;

typedef struct QUERY
{
	int x1;
	int y1;
	int x2;
	int y2;
}
QUERY;

huge Nuclearia[MAXW], Piece[MAXW];
PLANT Plant[MAXN];
QUERY Query[MAXQ];

int max(int a, int b)
{
	return (a > b) ? a : b;
}

void Summarize()
{
	for(int x = 1; x < w; x++)
	{
		Nuclearia[x] += Nuclearia[x - 1];
	}
}

void Print(huge sum, int width)
{
	huge rsl = sum / width;
	if((sum % width) * 2 >= width)
	{
		rsl++;
	}
	
	printf("%lld\n", rsl);
}

int main()
{
	scanf("%d%d", &w, &h);
	
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
	{
		scanf("%d%d%d%d", &(Plant[i].x), &(Plant[i].y), &(Plant[i].a), &(Plant[i].b));
		Plant[i].x--;
	}
	
	scanf("%d", &q);
	for(int i = 0; i < q; i++)
	{
		scanf("%d%d%d%d", &(Query[i].x1), &(Query[i].y1), &(Query[i].x2), &(Query[i].y2));
		Query[i].x1 -= 2;
		Query[i].x2--;
	}
	
	for(int i = 0; i < n; i++)
	{
		PLANT& P = Plant[i];
		int d = (P.a - 1) / P.b;
		int x1 = P.x - d;
		int x2 = P.x + d + 1;
		int r = P.a % P.b;
		
		if(r)
		{
			Piece[max(0, x1)] += r;
			if(x2 < w) Piece[x2] -= r;
			
			x1++;
			x2--;
		}
		
		int x = P.x + 1;
		x2++;
		
		if(x1 < 0)
		{
			int m = -x1;
			Piece[0] += P.b * m;
			x1 += m;
		}
		
		Nuclearia[x1] += P.b;
		if(x < w) Nuclearia[x] -= P.b * 2;
		if(x2 < w) Nuclearia[x2] += P.b;
	}
	
	Summarize();
	
	for(int x = 0; x < w; x++)
	{
		Nuclearia[x] += Piece[x];
	}
	
	Summarize();
	Summarize();
	
	for(int i = 0; i < q; i++)
	{
		QUERY& Q = Query[i];
		huge rsl = Nuclearia[Q.x2];
		if(Q.x1 >= 0) rsl -= Nuclearia[Q.x1];
		
		Print(rsl, Q.x2 - Q.x1);
	}
	
	return 0;
}

Compilation message

nuclearia.cpp: In function 'int main()':
nuclearia.cpp:60:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &w, &h);
                       ^
nuclearia.cpp:62:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
nuclearia.cpp:65:80: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &(Plant[i].x), &(Plant[i].y), &(Plant[i].a), &(Plant[i].b));
                                                                                ^
nuclearia.cpp:69:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
                 ^
nuclearia.cpp:72:84: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d", &(Query[i].x1), &(Query[i].y1), &(Query[i].x2), &(Query[i].y2));
                                                                                    ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 188616 KB Output is correct
2 Correct 79 ms 188616 KB Output is correct
3 Correct 89 ms 188616 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 188616 KB Output is correct
2 Correct 109 ms 188616 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 188616 KB Output is correct
2 Correct 106 ms 188616 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 188616 KB Output is correct
2 Correct 89 ms 188616 KB Output is correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 188616 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 188616 KB Output is correct

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 199 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 193 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 189 ms 188616 KB Output isn't correct
2 Halted 0 ms 0 KB -