제출 #37690

#제출 시각아이디문제언어결과실행 시간메모리
3769014kg원숭이와 사과 나무 (IZhO12_apple)C++11
0 / 100
0 ms1112 KiB
#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); 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 (x <= l && r <= y) { node->num = r - l + 1; node->check = true; 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(); }

컴파일 시 표준 에러 (stderr) 메시지

apple.cpp: In function 'int main()':
apple.cpp:68:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &k);
                 ^
apple.cpp:70: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);
                                ^
#Verdict Execution timeMemoryGrader output
Fetching results...