#include <stdio.h> #include <vector> #include <algorithm> class Node { public: Node *left; Node *right; long long growthSpeed; long long lastScything; long long lastLength; long long rightGrowthSpeed; long long rightLength; long long rightCount; void addRight(long long growthSpeed) { if (right == NULL) { right = new Node(growthSpeed); } else { right->addNode(growthSpeed); } rightGrowthSpeed += growthSpeed; rightCount += 1; } void addLeft(long long growthSpeed) { if(left == NULL) { left = new Node(growthSpeed); } else { left->addNode(growthSpeed); } } public: Node(long long growthSpeed) { left = NULL; right = NULL; this->growthSpeed = growthSpeed; lastScything = 0; lastLength = 0; rightGrowthSpeed = 0; rightLength = 0; rightCount = 0; } void addNode(long long growthSpeed) { if (growthSpeed >= this->growthSpeed) { addRight(growthSpeed); } else { addLeft(growthSpeed); } } void updateNodeData(long long lastScything, long long lastHeight) { if(this->lastScything > lastScything) { return; } this->lastScything = lastScything; this->lastLength = lastHeight; rightLength = lastHeight * rightCount; if(left != NULL) { left->updateNodeData(lastScything, lastHeight); } } long long rightScything(long long time, long long maxHeight) { if(right == NULL) { return 0; } long long timedelta = time - right->lastScything; long long rightHeight = rightLength + (timedelta * rightGrowthSpeed); right->updateNodeData(lastScything, lastLength); right->lastLength = rightLength; long long rightScythingVal = right->scything(time, maxHeight); rightLength = rightHeight - rightScythingVal; right->lastScything = time; return rightScythingVal; } long long leftScything(long long time, long long maxHeight) { if (left != NULL) { return left->scything(time, maxHeight); } else { return 0; } } long long rightSmartScything(long long time, long long maxHeight) { if (right != NULL) { long long timedelta = time - right->lastScything; long long rightHeight = rightLength + (timedelta * rightGrowthSpeed); rightLength = maxHeight * rightCount; right->lastScything = time; return rightHeight - rightLength; } return 0; } long long scything(long long time, long long maxHeight) { // if(growthSpeed == 5) { // printf("%lld %lld %lld %lld\n", time, maxHeight, lastScything, lastLength); // } long long timedelta = time - lastScything; long long height = lastLength + (timedelta * growthSpeed); long long ret = 0; if (height > maxHeight) { ret += (height - maxHeight); ret += rightSmartScything(time, maxHeight); ret += leftScything(time, maxHeight); lastLength = maxHeight; lastScything = time; } else { ret += rightScything(time, maxHeight); } return ret; } }; void bisectInsert(Node *root, std::vector<long long> &growthSpeeds, int begin, int end) { int mid = (begin + end) / 2; root->addNode(growthSpeeds[mid]); if (mid != begin) { bisectInsert(root, growthSpeeds, begin, mid - 1); } if (mid != end) { bisectInsert(root, growthSpeeds, mid + 1, end); } } Node* buildBalancedTree(std::vector<long long> &growthSpeeds, int begin, int end) { int mid = (begin + end) / 2; Node *root = new Node(growthSpeeds[mid]); if (mid != begin) { bisectInsert(root, growthSpeeds, begin, mid - 1); } if (mid != end) { bisectInsert(root, growthSpeeds, mid + 1, end); } return root; } int main() { int n, m; scanf("%d %d", &n, &m); std::vector<long long> growthSpeeds(n); for(int i = 0 ; i < n ; ++i) { scanf("%lld", &growthSpeeds[i]); } std::sort(growthSpeeds.begin(), growthSpeeds.end()); Node *root = buildBalancedTree(growthSpeeds, 0, n - 1); for(int i = 0 ; i < m ; ++i) { long long scythingTime, scythingHeight; scanf("%lld %lld", &scythingTime, &scythingHeight); printf("%lld\n", root->scything(scythingTime, scythingHeight)); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 | #include <stdio.h> #include <vector> #include <algorithm> class Node { public: Node *left; Node *right; long long growthSpeed; long long lastScything; long long lastLength; long long rightGrowthSpeed; long long rightLength; long long rightCount; void addRight(long long growthSpeed) { if (right == NULL) { right = new Node(growthSpeed); } else { right->addNode(growthSpeed); } rightGrowthSpeed += growthSpeed; rightCount += 1; } void addLeft(long long growthSpeed) { if(left == NULL) { left = new Node(growthSpeed); } else { left->addNode(growthSpeed); } } public: Node(long long growthSpeed) { left = NULL; right = NULL; this->growthSpeed = growthSpeed; lastScything = 0; lastLength = 0; rightGrowthSpeed = 0; rightLength = 0; rightCount = 0; } void addNode(long long growthSpeed) { if (growthSpeed >= this->growthSpeed) { addRight(growthSpeed); } else { addLeft(growthSpeed); } } void updateNodeData(long long lastScything, long long lastHeight) { if(this->lastScything > lastScything) { return; } this->lastScything = lastScything; this->lastLength = lastHeight; rightLength = lastHeight * rightCount; if(left != NULL) { left->updateNodeData(lastScything, lastHeight); } } long long rightScything(long long time, long long maxHeight) { if(right == NULL) { return 0; } long long timedelta = time - right->lastScything; long long rightHeight = rightLength + (timedelta * rightGrowthSpeed); right->updateNodeData(lastScything, lastLength); right->lastLength = rightLength; long long rightScythingVal = right->scything(time, maxHeight); rightLength = rightHeight - rightScythingVal; right->lastScything = time; return rightScythingVal; } long long leftScything(long long time, long long maxHeight) { if (left != NULL) { return left->scything(time, maxHeight); } else { return 0; } } long long rightSmartScything(long long time, long long maxHeight) { if (right != NULL) { long long timedelta = time - right->lastScything; long long rightHeight = rightLength + (timedelta * rightGrowthSpeed); rightLength = maxHeight * rightCount; right->lastScything = time; return rightHeight - rightLength; } return 0; } long long scything(long long time, long long maxHeight) { // if(growthSpeed == 5) { // printf("%lld %lld %lld %lld\n", time, maxHeight, lastScything, lastLength); // } long long timedelta = time - lastScything; long long height = lastLength + (timedelta * growthSpeed); long long ret = 0; if (height > maxHeight) { ret += (height - maxHeight); ret += rightSmartScything(time, maxHeight); ret += leftScything(time, maxHeight); lastLength = maxHeight; lastScything = time; } else { ret += rightScything(time, maxHeight); } return ret; } }; void bisectInsert(Node *root, std::vector<long long> &growthSpeeds, int begin, int end) { int mid = (begin + end) / 2; root->addNode(growthSpeeds[mid]); if (mid != begin) { bisectInsert(root, growthSpeeds, begin, mid - 1); } if (mid != end) { bisectInsert(root, growthSpeeds, mid + 1, end); } } Node* buildBalancedTree(std::vector<long long> &growthSpeeds, int begin, int end) { int mid = (begin + end) / 2; Node *root = new Node(growthSpeeds[mid]); if (mid != begin) { bisectInsert(root, growthSpeeds, begin, mid - 1); } if (mid != end) { bisectInsert(root, growthSpeeds, mid + 1, end); } return root; } int main() { int n, m; scanf("%d %d", &n, &m); std::vector<long long> growthSpeeds(n); for(int i = 0 ; i < n ; ++i) { scanf("%lld", &growthSpeeds[i]); } std::sort(growthSpeeds.begin(), growthSpeeds.end()); Node *root = buildBalancedTree(growthSpeeds, 0, n - 1); for(int i = 0 ; i < m ; ++i) { long long scythingTime, scythingHeight; scanf("%lld %lld", &scythingTime, &scythingHeight); printf("%lld\n", root->scything(scythingTime, scythingHeight)); } return 0; } |