2386

mkmark · mkmark · commit d0313f62bfab · 2022-09-04T14:58:17.000+08:00
diff --git a/leetcode/2386/1.in b/leetcode/2386/1.in
@@ -0,0 +1,2 @@
+[2,4,-2]
+5
diff --git a/leetcode/2386/12.in b/leetcode/2386/12.in
@@ -0,0 +1,2 @@
+[-487322177,-656480132,850198596,-291605661,-272668395,110865952,-162529283,-145886963,202657909,125667049,-282090943,120877054,-85849348,-482630078,-802177895,-574862206,374637017,804297842]
+1707
diff --git a/leetcode/2386/15.in b/leetcode/2386/15.in
@@ -0,0 +1,2 @@
+[380342990,-246234524,-778364240,224959608,569711933,568348883,734397453,-610236078,662947362,29215261,-791207453,-75950938,46847233,971804154,-512427950,920138728]
+942
diff --git a/leetcode/2386/2.in b/leetcode/2386/2.in
@@ -0,0 +1,2 @@
+[1,-2,3,4,-10,12]
+16
diff --git a/leetcode/2386/32.in b/leetcode/2386/32.in
@@ -0,0 +1,2 @@
+[508960725,-591576738,-842983833,841747633,350699661]
+11
diff --git a/leetcode/2386/35.in b/leetcode/2386/35.in
@@ -0,0 +1,2 @@
+[153123449,-974739108,-408679566,-996444415,-978921261,805907128,-102259288,-397930077,51033052,-193994032,158654659,-486195972,-294264190,-65262667,375941242,-890038230,315970860,403847239,-32469129,-350561293,192113942,794248972,-632675681,434029943,746632801,500370163,164413366,346449701,473890512]
+1906
diff --git a/leetcode/2386/36.in b/leetcode/2386/36.in
@@ -0,0 +1,2 @@
+[-91282107,-541711002,-276822556,90917395,834041510,-840892824,-508608840,-147048391,557843113,272412766,-918980912,820869808,385517519,-341785025,486628402,993154325,-629135417,677219246,62835597,64218970,928242835,896481126,-738154826,478700010,-893696727,-119562113,-43819130,-987768829,157402884,-386180872,237072809,-919540108,267447436,201913793,-281453262,168068441,690937145,894616338,428922554,355032016,-282793837,-445107592,-559015912,266029154,-245027665,324705364,-727272924,186301685,-905146561,-209906218,111448330,7925324,-103030197,62731785,652384508,242259114,56539784,69378804,190147339,-844137898,-595488526,-731717935,-480766744,767916483,119646172,16969979,906477612,387179801,-845067849,-703297363,816507867,436741820,285885943,-305638994,374442522,-657030826,-770219295,-543436120,612879155,646087640,-403176698,393578994,-155171985,-408422544,-487489088]
+1477
diff --git a/leetcode/2386/58.in b/leetcode/2386/58.in
@@ -0,0 +1,2 @@
+[26929228,570672773,944323923,-270730815,930794290,-67116629,-721033930,627057977,926459554,-191968216,-398561424,-515687801,204037911,951799536,112713617,-226334699,-397918319,-410676131,533102608,577982132,-511728515,619395005,144696870,131772970,383285071,650142277,475663783,-865748557,-864544818,-301195584,-943119002,23511617,-491988973,-390592083,-660186889,-813962712,698408444,58251670,684475819,891816718,359849434,403687766,-187872803,-294533016,753455126,-304740665,-253456889,111122495,933806534,876313714,-238027634,550781753,492246509]
+1867
diff --git a/leetcode/2386/main.cpp b/leetcode/2386/main.cpp
@@ -0,0 +1,40 @@
+/*
+author: mark@mkmark.net
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution-2.1.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main()
+{
+    LeetCodeInput li("36.in");
+
+    auto l0 = li.get<vi>(0);
+    auto l1 = li.get<int>(1);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.kSum(l0, l1);
+    chrono::steady_clock::time_point end = chrono::steady_clock::now();
+    cout << "Time difference = " << chrono::duration_cast<chrono::microseconds> (end - begin).count() << "µs" << endl;
+
+    cout << output << endl;
+
+    // for (int i: output){
+    //     cout << i << ' ';
+    // }
+
+    // for (auto i: output){
+    //     for (int j: i){
+    //         cout << j << ' ';
+    //     }
+    //     cout << '\n';
+    // }
+
+    return 0;
+}
diff --git a/leetcode/2386/solution-1.cpp b/leetcode/2386/solution-1.cpp
@@ -0,0 +1,71 @@
+/*
+author: mark@mkmark.net
+time: O()
+space: O()
+
+Runtime: tle
+Memory Usage: 
+
+bfs + pq
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    long long kSum(vector<int>& nums, int k) {
+        sort(all(nums), [&nums](int & i, int & j){return abs(i)<abs(j);});
+        long long sum = 0;
+        long long smallest = 0;
+
+        int n = size(nums);
+        for (int i=0; i<n; ++i){
+            sum += nums[i];
+            if (nums[i]<0) {
+                smallest += nums[i];
+            }
+        }
+
+        priority_queue<long long, vector<long long>, greater<long long>> pq;
+
+        vector<long long> subsets;
+        subsets.push_back(smallest);
+        pq.push(smallest);
+        long long last_top = pq.top();
+
+        int count = 0;
+        int pos = 0;
+
+        int maximum = 0;
+
+        while (count != k){
+            if (pq.empty() || (pos<n && pq.top()>smallest+abs(nums[pos]))){
+                int m = size(subsets);
+                subsets.resize(m<<1);
+                for (int i = 0; i<m; ++i){
+                    long long new_num = subsets[i]+abs(nums[pos]);
+                    subsets[m+i]=new_num;
+                    pq.push(new_num);
+                }
+                ++pos;
+            }
+            last_top = pq.top();
+            pq.pop();
+            ++count;
+        }
+        return sum-last_top;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();
diff --git a/leetcode/2386/solution-2.1.cpp b/leetcode/2386/solution-2.1.cpp
@@ -0,0 +1,79 @@
+/*
+author: mark@mkmark.net
+time: O(nlogn + k2)
+space: O()
+
+Runtime: 238 ms, faster than 100.00% of C++ online submissions for Find the K-Sum of an Array.
+Memory Usage: 74.6 MB, less than 44.44% of C++ online submissions for Find the K-Sum of an Array.
+
+bfs + multiset + abs
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    long long kSum(vector<int>& nums, int k) {
+        long long sum = 0;
+        long long smallest = 0;
+
+        int n = size(nums);
+        for (int i=0; i<n; ++i){
+            sum += nums[i];
+            if (nums[i]<0) {
+                smallest += nums[i];
+                nums[i] = -nums[i];
+            }
+        }
+        /// nlogn
+        sort(all(nums));
+
+        multiset<long long> s;
+
+        vector<long long> subsets;
+        subsets.push_back(smallest);
+        s.insert(smallest);
+        long long last_top = *s.begin();
+
+        int count = 0;
+        int pos = 0;
+
+        int maximum = 0;
+
+        /// k2
+        while (count != k){
+            if (s.empty() || (pos<n && *s.begin()>smallest+nums[pos])){
+                int m = size(subsets);
+                for (int i = 0; i<m; ++i){
+                    long long new_num = subsets[i]+nums[pos];
+                    if (size(s) < k-count){
+                        subsets.push_back(new_num);
+                        s.insert(new_num);
+                    } else if (new_num < *(prev(s.end()))){
+                        subsets.push_back(new_num);
+                        s.erase(prev(s.end()));
+                        s.insert(new_num);
+                    }
+                }
+                ++pos;
+            }
+            last_top = *s.begin();
+            s.erase(s.begin());
+            ++count;
+        }
+        return sum-last_top;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();
diff --git a/leetcode/2386/solution-2.cpp b/leetcode/2386/solution-2.cpp
@@ -0,0 +1,78 @@
+/*
+author: mark@mkmark.net
+time: O()
+space: O()
+
+Runtime: 266 ms, faster than 88.89% of C++ online submissions for Find the K-Sum of an Array.
+Memory Usage: 74.5 MB, less than 44.44% of C++ online submissions for Find the K-Sum of an Array.
+
+bfs + multiset
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    long long kSum(vector<int>& nums, int k) {
+        /// nlogn
+        sort(all(nums), [&nums](int & i, int & j){return abs(i)<abs(j);});
+        long long sum = 0;
+        long long smallest = 0;
+
+        int n = size(nums);
+        for (int i=0; i<n; ++i){
+            sum += nums[i];
+            if (nums[i]<0) {
+                smallest += nums[i];
+            }
+        }
+
+        multiset<long long> s;
+
+        vector<long long> subsets;
+        subsets.push_back(smallest);
+        s.insert(smallest);
+        long long last_top = *s.begin();
+
+        int count = 0;
+        int pos = 0;
+
+        int maximum = 0;
+
+        /// k2
+        while (count != k){
+            if (s.empty() || (pos<n && *s.begin()>smallest+abs(nums[pos]))){
+                int m = size(subsets);
+                for (int i = 0; i<m; ++i){
+                    long long new_num = subsets[i]+abs(nums[pos]);
+                    if (size(s) < k-count){
+                        subsets.push_back(new_num);
+                        s.insert(new_num);
+                    } else if (new_num < *prev(s.end())){
+                        subsets.push_back(new_num);
+                        s.erase(prev(s.end()));
+                        s.insert(new_num);
+                    }
+                }
+                ++pos;
+            }
+            last_top = *s.begin();
+            s.erase(s.begin());
+            ++count;
+        }
+        return sum-last_top;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();
diff --git a/leetcode/2386/solution-3.1.cpp b/leetcode/2386/solution-3.1.cpp
@@ -0,0 +1,82 @@
+/*
+author: mark@mkmark.net
+time: O()
+space: O()
+
+Runtime: 
+Memory Usage: 
+
+bfs + multimap + multiset
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    long long kSum(vector<int>& nums, int k) {
+        /// nlogn
+        sort(all(nums), [&nums](int & i, int & j){return abs(i)<abs(j);});
+        long long sum = 0;
+        long long smallest = 0;
+
+        int n = size(nums);
+        for (int i=0; i<n; ++i){
+            sum += nums[i];
+            if (nums[i]<0) {
+                smallest += nums[i];
+            }
+        }
+
+        multiset<long long> subsets;
+        multimap<long long, multiset<long long>::iterator> s;
+        s.insert({smallest, subsets.insert(smallest)});
+        long long last_top = (*s.begin()).first;
+
+        int count = 0;
+        int pos = 0;
+
+        int maximum = 0;
+
+        /// k2
+        while (count != k){
+            if (s.empty() || (pos<n && (*s.begin()).first>smallest+abs(nums[pos]))){
+                multiset<long long> to_insert;
+                vector<multiset<long long>::iterator> to_erase;
+                for (auto i : subsets){
+                    long long new_num = i+abs(nums[pos]);
+                    if (size(s) < k-count){
+                        s.insert({new_num, to_insert.insert(new_num)});
+                    } else if (new_num < (*prev(s.end())).first){
+                        to_erase.push_back((*prev(s.end())).second);
+                        s.erase(prev(s.end()));
+                        s.insert({new_num, to_insert.insert(new_num)});
+                    } else {
+                        break;
+                    }
+                }
+                subsets.merge(to_insert);
+                for (auto it : to_erase){
+                    subsets.erase(it);
+                }
+                ++pos;
+            }
+            last_top = (*s.begin()).first;
+            s.erase(s.begin());
+            ++count;
+        }
+        return sum-last_top;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();
diff --git a/leetcode/2386/solution-3.cpp b/leetcode/2386/solution-3.cpp
diff --git a/leetcode/2386/solution-4.cpp b/leetcode/2386/solution-4.cpp

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+[-487322177,-656480132,850198596,-291605661,-272668395,110865952,-162529283,-145886963,202657909,125667049,-282090943,120877054,-85849348,-482630078,-802177895,-574862206,374637017,804297842]`
	`2`	`+1707`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+[380342990,-246234524,-778364240,224959608,569711933,568348883,734397453,-610236078,662947362,29215261,-791207453,-75950938,46847233,971804154,-512427950,920138728]`
	`2`	`+942`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+[508960725,-591576738,-842983833,841747633,350699661]`
	`2`	`+11`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+[153123449,-974739108,-408679566,-996444415,-978921261,805907128,-102259288,-397930077,51033052,-193994032,158654659,-486195972,-294264190,-65262667,375941242,-890038230,315970860,403847239,-32469129,-350561293,192113942,794248972,-632675681,434029943,746632801,500370163,164413366,346449701,473890512]`
	`2`	`+1906`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	+[-91282107,-541711002,-276822556,90917395,834041510,-840892824,-508608840,-147048391,557843113,272412766,-918980912,820869808,385517519,-341785025,486628402,993154325,-629135417,677219246,62835597,64218970,928242835,896481126,-738154826,478700010,-893696727,-119562113,-43819130,-987768829,157402884,-386180872,237072809,-919540108,267447436,201913793,-281453262,168068441,690937145,894616338,428922554,355032016,-282793837,-445107592,-559015912,266029154,-245027665,324705364,-727272924,186301685,-905146561,-209906218,111448330,7925324,-103030197,62731785,652384508,242259114,56539784,69378804,190147339,-844137898,-595488526,-731717935,-480766744,767916483,119646172,16969979,906477612,387179801,-845067849,-703297363,816507867,436741820,285885943,-305638994,374442522,-657030826,-770219295,-543436120,612879155,646087640,-403176698,393578994,-155171985,-408422544,-487489088]
	`2`	`+1477`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	+[26929228,570672773,944323923,-270730815,930794290,-67116629,-721033930,627057977,926459554,-191968216,-398561424,-515687801,204037911,951799536,112713617,-226334699,-397918319,-410676131,533102608,577982132,-511728515,619395005,144696870,131772970,383285071,650142277,475663783,-865748557,-864544818,-301195584,-943119002,23511617,-491988973,-390592083,-660186889,-813962712,698408444,58251670,684475819,891816718,359849434,403687766,-187872803,-294533016,753455126,-304740665,-253456889,111122495,933806534,876313714,-238027634,550781753,492246509]
	`2`	`+1867`