diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2024-08-30 16:46:50 +0200 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2024-08-30 16:46:50 +0200 |
| commit | 1abc08be606b7379bb1b9c5150bf73841a4b9c66 (patch) | |
| tree | 9886ec700ac1b581c37f68b2dad234aed0c10e96 /content | |
| parent | 776dba9473df7f4b1ca071b61c994fdcca3e07b3 (diff) | |
improve pbs
Diffstat (limited to 'content')
| -rw-r--r-- | content/other/pbs.cpp | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/content/other/pbs.cpp b/content/other/pbs.cpp index 5508d6c..6cf872a 100644 --- a/content/other/pbs.cpp +++ b/content/other/pbs.cpp @@ -1,10 +1,11 @@ // Q = # of queries, bucket sort is sometimes faster -vector<int> low(Q, 0), high(Q, MAX_OPERATIONS); +vector<int> low(Q, 0), high(Q, MAX_OPERATIONS + 1); while (true) { vector<pair<int, int>> focus; - for (int i = 0; i < Q; i++) if (low[i] < high[i]) { - focus.emplace_back((low[i] + high[i]) / 2, i); - } + for (int i = 0; i < Q; i++) { + if (low[i] + 1 < high[i]) { + focus.emplace_back((low[i] + high[i]) / 2, i); + }} if (focus.empty()) break; sort(all(focus)); @@ -14,5 +15,5 @@ while (true) { // simulation step } if (/* requirement already fulfilled */) high[i] = mid; - else low[i] = mid + 1; + else low[i] = mid; }} // answer in low (and high) |
