Submission #37728

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
37728	2017-12-27T11:08:55 Z	14kg	Monkey and Apple-trees (IZhO12_apple)	C++11	100 / 100	86 ms	1112 KB

apple

#include <stdio.h>
#include <algorithm>
#define NN 1073741824
#define min2(x,y) (x<y?x:y)
#define max2(x,y) (x>y?x:y)

using namespace std;
struct TREE {
	int num;
	bool check;
	TREE *left, *right;
} *top;

int f(TREE *node, int l, int r, int x, int y) {
	int mid = (l + r) / 2;

	if (x <= l && r <= y) return node->num;
	if (r < x || y < l) return 0;
	if (node->check) return min2(y, r) - max2(l, x) + 1;

	if (node->left == NULL) {
		node->left = (TREE*)malloc(sizeof(TREE));
		node->left->left = node->left->right = NULL;
		node->left->num = node->check ? (mid - l + 1) : 0;
		node->left->check = node->check;
	}
	if (node->right == NULL) {
		node->right = (TREE*)malloc(sizeof(TREE));
		node->right->left = node->right->right = NULL;
		node->right->num = node->check ? (mid - l + 1) : 0;
		node->right->check = node->check;
	}
	return f(node->left, l, mid, x, y) + f(node->right, mid + 1, r, x, y);
}
void Push(TREE *node, int l, int r, int x, int y) {
	int mid = (l + r) / 2;

	if (node->check) return;
	if (x <= l && r <= y) {
		node->num = r - l + 1;
		node->check = true;
		node->left = node->right = NULL;
		return;
	}
	if (r < x || y < l) return;

	if (node->left == NULL) {
		node->left = (TREE*)malloc(sizeof(TREE));
		node->left->left = node->left->right = NULL;
		node->left->num = node->check ? (mid - l + 1) : 0;
		node->left->check = node->check;
	}
	if (node->right == NULL) {
		node->right = (TREE*)malloc(sizeof(TREE));
		node->right->left = node->right->right = NULL;
		node->right->num = node->check ? (mid - l + 1) : 0;
		node->right->check = node->check;
	}
	Push(node->left, l, mid, x, y);
	Push(node->right, mid + 1, r, x, y);
	node->num = node->left->num + node->right->num;
}
int main() {
	int k, s, x, y, C = 0;

	top= (TREE*)malloc(sizeof(TREE));
	top->check = false, top->num = 0;
	top->left = top->right = NULL;

	scanf("%d", &k);
	while (k--) {
		scanf("%d %d %d", &s, &x, &y);
		x += C, y += C;
		if (s == 1) {
			C = f(top, 1, NN, x, y);
			printf("%d\n", C);
		}
		else Push(top, 1, NN, x, y);
	} //getchar(), getchar();
}

Compilation message

apple.cpp: In function 'int main()':
apple.cpp:70:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &k);
                 ^
apple.cpp:72:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &s, &x, &y);
                                ^

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1112 KB	Output is correct
2	Correct	0 ms	1112 KB	Output is correct
3	Correct	0 ms	1112 KB	Output is correct
4	Correct	3 ms	1112 KB	Output is correct
5	Correct	6 ms	1112 KB	Output is correct
6	Correct	6 ms	1112 KB	Output is correct
7	Correct	6 ms	1112 KB	Output is correct
8	Correct	46 ms	1112 KB	Output is correct
9	Correct	86 ms	1112 KB	Output is correct
10	Correct	66 ms	1112 KB	Output is correct
11	Correct	49 ms	1112 KB	Output is correct
12	Correct	73 ms	1112 KB	Output is correct
13	Correct	69 ms	1112 KB	Output is correct
14	Correct	69 ms	1112 KB	Output is correct
15	Correct	56 ms	1112 KB	Output is correct
16	Correct	59 ms	1112 KB	Output is correct
17	Correct	56 ms	1112 KB	Output is correct
18	Correct	59 ms	1112 KB	Output is correct
19	Correct	46 ms	1112 KB	Output is correct
20	Correct	56 ms	1112 KB	Output is correct