backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
38cc28167e02a33c44e216c4674524e0afae239f
C-Plus-Plus/d2/d45/segtree_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

563 lines
37 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: range_queries/segtree.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('d2/d45/segtree_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">segtree.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cmath&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for segtree.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../de/db6/segtree_8cpp__incl.svg" width="418" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d2/d45/segtree_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae752659b7c1719d68fdb2ca538a93696" id="r_ae752659b7c1719d68fdb2ca538a93696"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a> (const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
<tr class="memdesc:ae752659b7c1719d68fdb2ca538a93696"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
<tr class="memitem:a423a97ea0c7ea6e33b5844a6858d902d" id="r_a423a97ea0c7ea6e33b5844a6858d902d"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a> (std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
<tr class="memdesc:a423a97ea0c7ea6e33b5844a6858d902d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the sum of all elements in a range. <br /></td></tr>
<tr class="memitem:abd3e818681fb2e29cf08f4f60f82c8e0" id="r_abd3e818681fb2e29cf08f4f60f82c8e0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a> (std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
<tr class="memdesc:abd3e818681fb2e29cf08f4f60f82c8e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Updates a range of the segment tree. <br /></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementation. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure. </p>
<p>A segment tree, also known as a statistic tree, is a tree data structure used for storing information about intervals, or segments. Its classical version allows querying which of the stored segments contain a given point, but our modification allows us to perform (query) any binary operation on any range in the array in O(logN) time. Here, we have used addition (+). For range updates, we have used lazy propagation.</p>
<ul>
<li>Space Complexity : O(NlogN) <br />
</li>
<li>Build Time Complexity : O(NlogN) <br />
</li>
<li>Query Time Complexity : O(logN) <br />
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/madhavgaba" target="_blank">Madhav Gaba</a> </dd>
<dd>
<a href="https://github.com/sohamroy19" target="_blank">Soham Roy</a> </dd></dl>
</li>
</ul>
<p class="definition">Definition in file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="ae752659b7c1719d68fdb2ca538a93696" name="ae752659b7c1719d68fdb2ca538a93696"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae752659b7c1719d68fdb2ca538a93696">&#9670;&#160;</a></span>ConsTree()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void ConsTree </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int64_t &gt; *</td> <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>high</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>pos</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>for std::vector </p>
<p>for assert for log2 for std::uint64_t for IO operations</p>
<p>Constructs the initial segment tree</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>input to construct the tree out of </td></tr>
<tr><td class="paramname">segtree</td><td>the segment tree </td></tr>
<tr><td class="paramname">low</td><td>inclusive lowest index of arr to begin at </td></tr>
<tr><td class="paramname">high</td><td>inclusive highest index of arr to end at </td></tr>
<tr><td class="paramname">pos</td><td>index of segtree to fill (eg. root node) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 39</span> {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (low == high) {</div>
<div class="line"><span class="lineno"> 41</span> (*segtree)[pos] = arr[low];</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> </div>
<div class="line"><span class="lineno"> 45</span> uint64_t mid = (low + high) / 2;</div>
<div class="line"><span class="lineno"> 46</span> <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, segtree, low, mid, 2 * pos + 1);</div>
<div class="line"><span class="lineno"> 47</span> <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, segtree, mid + 1, high, 2 * pos + 2);</div>
<div class="line"><span class="lineno"> 48</span> (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
<div class="line"><span class="lineno"> 49</span>}</div>
<div class="ttc" id="asegtree_8cpp_html_ae752659b7c1719d68fdb2ca538a93696"><div class="ttname"><a href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a></div><div class="ttdeci">void ConsTree(const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00038">segtree.cpp:38</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00168">168</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 168</span> {</div>
<div class="line"><span class="lineno"> 169</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 170</span> </div>
<div class="line"><span class="lineno"> 171</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of elements: &quot;</span>;</div>
<div class="line"><span class="lineno"> 172</span> </div>
<div class="line"><span class="lineno"> 173</span> uint64_t n = 0;</div>
<div class="line"><span class="lineno"> 174</span> std::cin &gt;&gt; n;</div>
<div class="line"><span class="lineno"> 175</span> </div>
<div class="line"><span class="lineno"> 176</span> <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(n))) - 1);</div>
<div class="line"><span class="lineno"> 177</span> std::vector&lt;int64_t&gt; arr(n), lazy(max), segtree(max);</div>
<div class="line"><span class="lineno"> 178</span> </div>
<div class="line"><span class="lineno"> 179</span> <span class="keywordtype">int</span> choice = 0;</div>
<div class="line"><span class="lineno"> 180</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nDo you wish to enter each number?:\n&quot;</span></div>
<div class="line"><span class="lineno"> 181</span> <span class="stringliteral">&quot;1: Yes\n&quot;</span></div>
<div class="line"><span class="lineno"> 182</span> <span class="stringliteral">&quot;0: No (default initialize them to 0)\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 183</span> </div>
<div class="line"><span class="lineno"> 184</span> std::cin &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">if</span> (choice == 1) {</div>
<div class="line"><span class="lineno"> 186</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; numbers:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; i++) {</div>
<div class="line"><span class="lineno"> 188</span> std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
<div class="line"><span class="lineno"> 189</span> std::cin &gt;&gt; arr[i];</div>
<div class="line"><span class="lineno"> 190</span> }</div>
<div class="line"><span class="lineno"> 191</span> }</div>
<div class="line"><span class="lineno"> 192</span> </div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, n - 1, 0);</div>
<div class="line"><span class="lineno"> 194</span> </div>
<div class="line"><span class="lineno"> 195</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 196</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nMake your choice:\n&quot;</span></div>
<div class="line"><span class="lineno"> 197</span> <span class="stringliteral">&quot;1: Range update (input)\n&quot;</span></div>
<div class="line"><span class="lineno"> 198</span> <span class="stringliteral">&quot;2: Range query (output)\n&quot;</span></div>
<div class="line"><span class="lineno"> 199</span> <span class="stringliteral">&quot;0: Exit\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 200</span> std::cin &gt;&gt; choice;</div>
<div class="line"><span class="lineno"> 201</span> </div>
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">if</span> (choice == 1) {</div>
<div class="line"><span class="lineno"> 203</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound, upper bound &amp; value:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 204</span> </div>
<div class="line"><span class="lineno"> 205</span> uint64_t p = 1, q = 1, v = 0;</div>
<div class="line"><span class="lineno"> 206</span> std::cin &gt;&gt; p &gt;&gt; q &gt;&gt; v;</div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, v, 0, n - 1, 0);</div>
<div class="line"><span class="lineno"> 208</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
<div class="line"><span class="lineno"> 209</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound &amp; upper bound:\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 210</span> </div>
<div class="line"><span class="lineno"> 211</span> uint64_t p = 1, q = 1;</div>
<div class="line"><span class="lineno"> 212</span> std::cin &gt;&gt; p &gt;&gt; q;</div>
<div class="line"><span class="lineno"> 213</span> std::cout &lt;&lt; <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, 0, n - 1, 0);</div>
<div class="line"><span class="lineno"> 214</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 215</span> }</div>
<div class="line"><span class="lineno"> 216</span> } <span class="keywordflow">while</span> (choice &gt; 0);</div>
<div class="line"><span class="lineno"> 217</span> </div>
<div class="line"><span class="lineno"> 218</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 219</span>}</div>
<div class="ttc" id="asegtree_8cpp_html_a423a97ea0c7ea6e33b5844a6858d902d"><div class="ttname"><a href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a></div><div class="ttdeci">int64_t query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Returns the sum of all elements in a range.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00063">segtree.cpp:63</a></div></div>
<div class="ttc" id="asegtree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00147">segtree.cpp:147</a></div></div>
<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00103">segtree.cpp:103</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a423a97ea0c7ea6e33b5844a6858d902d" name="a423a97ea0c7ea6e33b5844a6858d902d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a423a97ea0c7ea6e33b5844a6858d902d">&#9670;&#160;</a></span>query()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int64_t query </td>
<td>(</td>
<td class="paramtype">std::vector&lt; int64_t &gt; *</td> <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int64_t &gt; *</td> <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>qlow</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>qhigh</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>high</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>pos</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns the sum of all elements in a range. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">segtree</td><td>the segment tree </td></tr>
<tr><td class="paramname">lazy</td><td>for lazy propagation </td></tr>
<tr><td class="paramname">qlow</td><td>lower index of the required query </td></tr>
<tr><td class="paramname">qhigh</td><td>higher index of the required query </td></tr>
<tr><td class="paramname">low</td><td>lower index of query for this function call </td></tr>
<tr><td class="paramname">high</td><td>higher index of query for this function call </td></tr>
<tr><td class="paramname">pos</td><td>index of segtree to consider (eg. root node) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>result of the range query for this function call </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (low &gt; high || qlow &gt; high || low &gt; qhigh) {</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">if</span> ((*lazy)[pos] != 0) {</div>
<div class="line"><span class="lineno"> 71</span> (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);</div>
<div class="line"><span class="lineno"> 72</span> </div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">if</span> (low != high) {</div>
<div class="line"><span class="lineno"> 74</span> (*lazy)[2 * pos + 1] += (*lazy)[pos];</div>
<div class="line"><span class="lineno"> 75</span> (*lazy)[2 * pos + 2] += (*lazy)[pos];</div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> (*lazy)[pos] = 0;</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> </div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (qlow &lt;= low &amp;&amp; qhigh &gt;= high) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">return</span> (*segtree)[pos];</div>
<div class="line"><span class="lineno"> 82</span> }</div>
<div class="line"><span class="lineno"> 83</span> </div>
<div class="line"><span class="lineno"> 84</span> uint64_t mid = (low + high) / 2;</div>
<div class="line"><span class="lineno"> 85</span> </div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);</div>
<div class="line"><span class="lineno"> 88</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementation. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00147">147</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 147</span> {</div>
<div class="line"><span class="lineno"> 148</span> <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(7))) - 1);</div>
<div class="line"><span class="lineno"> 149</span> assert(max == 15);</div>
<div class="line"><span class="lineno"> 150</span> </div>
<div class="line"><span class="lineno"> 151</span> std::vector&lt;int64_t&gt; arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, 7 - 1, 0);</div>
<div class="line"><span class="lineno"> 153</span> </div>
<div class="line"><span class="lineno"> 154</span> assert(<a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);</div>
<div class="line"><span class="lineno"> 155</span> </div>
<div class="line"><span class="lineno"> 156</span> <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, 2, 4, 1, 0, 7 - 1, 0);</div>
<div class="line"><span class="lineno"> 157</span> assert(<a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);</div>
<div class="line"><span class="lineno"> 158</span> </div>
<div class="line"><span class="lineno"> 159</span> <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, 0, 6, -2, 0, 7 - 1, 0);</div>
<div class="line"><span class="lineno"> 160</span> assert(<a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);</div>
<div class="line"><span class="lineno"> 161</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="abd3e818681fb2e29cf08f4f60f82c8e0" name="abd3e818681fb2e29cf08f4f60f82c8e0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abd3e818681fb2e29cf08f4f60f82c8e0">&#9670;&#160;</a></span>update()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void update </td>
<td>(</td>
<td class="paramtype">std::vector&lt; int64_t &gt; *</td> <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; int64_t &gt; *</td> <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>start</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>end</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>delta</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>low</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>high</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>pos</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Updates a range of the segment tree. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">segtree</td><td>the segment tree </td></tr>
<tr><td class="paramname">lazy</td><td>for lazy propagation </td></tr>
<tr><td class="paramname">start</td><td>lower index of the required query </td></tr>
<tr><td class="paramname">end</td><td>higher index of the required query </td></tr>
<tr><td class="paramname">delta</td><td>integer to add to each element of the range </td></tr>
<tr><td class="paramname">low</td><td>lower index of query for this function call </td></tr>
<tr><td class="paramname">high</td><td>higher index of query for this function call </td></tr>
<tr><td class="paramname">pos</td><td>index of segtree to consider (eg. root node) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 105</span> {</div>
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">if</span> (low &gt; high) {</div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 108</span> }</div>
<div class="line"><span class="lineno"> 109</span> </div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">if</span> ((*lazy)[pos] != 0) {</div>
<div class="line"><span class="lineno"> 111</span> (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);</div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (low != high) {</div>
<div class="line"><span class="lineno"> 114</span> (*lazy)[2 * pos + 1] += (*lazy)[pos];</div>
<div class="line"><span class="lineno"> 115</span> (*lazy)[2 * pos + 2] += (*lazy)[pos];</div>
<div class="line"><span class="lineno"> 116</span> }</div>
<div class="line"><span class="lineno"> 117</span> (*lazy)[pos] = 0;</div>
<div class="line"><span class="lineno"> 118</span> }</div>
<div class="line"><span class="lineno"> 119</span> </div>
<div class="line"><span class="lineno"> 120</span> <span class="keywordflow">if</span> (start &gt; high || end &lt; low) {</div>
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span> </div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (start &lt;= low &amp;&amp; end &gt;= high) {</div>
<div class="line"><span class="lineno"> 125</span> (*segtree)[pos] += delta * (high - low + 1);</div>
<div class="line"><span class="lineno"> 126</span> </div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (low != high) {</div>
<div class="line"><span class="lineno"> 128</span> (*lazy)[2 * pos + 1] += delta;</div>
<div class="line"><span class="lineno"> 129</span> (*lazy)[2 * pos + 2] += delta;</div>
<div class="line"><span class="lineno"> 130</span> }</div>
<div class="line"><span class="lineno"> 131</span> </div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 133</span> }</div>
<div class="line"><span class="lineno"> 134</span> </div>
<div class="line"><span class="lineno"> 135</span> uint64_t mid = (low + high) / 2;</div>
<div class="line"><span class="lineno"> 136</span> </div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);</div>
<div class="line"><span class="lineno"> 138</span> <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);</div>
<div class="line"><span class="lineno"> 139</span> (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
<div class="line"><span class="lineno"> 140</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a href="../../d2/d45/segtree_8cpp.html">segtree.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink