202209031856

Author: mkmark

independent/202209031856/0.in

@@ -0,0 +1,4 @@
+[2,1,2,3,2]
+[9,6,2,1,7]
+[1,3,0,5,2]
+1

independent/202209031856/1.in

@@ -0,0 +1,4 @@
+[2,1,1,1,2]
+[9,6,2,1,107]
+[1,3,0,5,2]
+1

independent/202209031856/2.in

@@ -0,0 +1,4 @@
+[2,1,2,2]
+[9,6,2,1]
+[1,3,1,5]
+1

independent/202209031856/3.in

@@ -0,0 +1,4 @@
+[1,2,1,1]
+[1,8,16,128]
+[2,4,32,64]
+1

independent/202209031856/README.md

@@ -0,0 +1 @@
+一个人每天会被给予一个任务，这个任务需要在城市c完成，如果他当前不在该城市，获得的收益为b，在该城市则获得收益为a，给定a b c的数组，初始城市在k，每天可以决定接收或放弃该天的任务。求最大收益。数组长度或城市个数n最大为50000。

independent/202209031856/main.cpp

@@ -0,0 +1,42 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main()
+{
+    LeetCodeInput li("3.in");
+
+    auto l0 = li.get<vi>(0);
+    auto l1 = li.get<vi>(1);
+    auto l2 = li.get<vi>(2);
+    auto l3 = li.get<int>(3);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.solution(l0, l1, l2, l3);
+    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;
+}

independent/202209031856/solution.cpp

@@ -0,0 +1,58 @@
+/*
+author: [email protected]
+time: O()
+space: O()
+
+Runtime: 
+Memory Usage: 
+*/
+
+#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:
+    int solution(vi jobs, vi a, vi b, int k) {
+        uint16_t n = size(jobs);
+        /// score_by_pos[pos] = score
+        unordered_map<uint16_t, int> score_by_pos;
+        score_by_pos.emplace(k, 0);
+
+        int max_new_score = 0;
+        int second_max_new_score = 0;
+        int last_pos = k;
+        bool last_lazy;
+        for (int day=0; day<n; ++day){ 
+            
+            if (jobs[day] == last_pos){
+                max_new_score = second_max_new_score + b[day];
+            } else {
+                second_max_new_score = max_new_score;
+                max_new_score += b[day];
+            }
+
+            auto it = score_by_pos.find(jobs[day]);
+            if (it != score_by_pos.end()){
+                int lazy_new_score = (*it).second + a[day];
+                max_new_score = max(max_new_score, lazy_new_score);
+            }
+
+            last_pos = jobs[day];
+            score_by_pos[jobs[day]] = max_new_score;
+        }
+
+        return max_new_score;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();