merge to add final problems

yasarcereen · yasarcereen · commit 03135417723b · 2023-02-20T20:22:25.000+03:00
diff --git a/Qualification Round/Card Master Köş/solution.cpp b/Qualification Round/Card Master Köş/solution.cpp
@@ -5,7 +5,7 @@ using namespace std;
 int main() {
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
-    
+
     long long n, k;
     cin >> n >> k;
 
diff --git a/Qualification Round/Casting Homework/solution.cpp b/Qualification Round/Casting Homework/solution.cpp
@@ -9,48 +9,47 @@ string solve(string s, int target, int k) {
     vector<bool> found(k + 1, false);
 
     vector<int> nums(n);
-    for(int i = 0; i < n; i++)
+    for (int i = 0; i < n; i++)
         nums[i] = s[i] - 'a' + 1;
 
     bitset<maxk> bs;
     int upperbound = 1 << n;
 
-    for(int i = 1; i < upperbound; i++) {
+    for (int i = 1; i < upperbound; i++) {
         bs = bitset<maxk>(i);
-        if(bs.count() > k)
+        if (bs.count() > k)
             continue;
-        
-        if(found[bs.count()])
+
+        if (found[bs.count()])
             continue;
 
         int sum = 0;
-        for(int j = 0; j < n; j++)
-            if(bs.test(j))
+        for (int j = 0; j < n; j++)
+            if (bs.test(j))
                 sum += nums[j];
-        if(sum == target) {
+        if (sum == target) {
             found[bs.count()] = true;
         }
     }
-    string res="";
-    for(int i = 1; i <= k; i++)
+    string res = "";
+    for (int i = 1; i <= k; i++)
         res = res + to_string(found[i]) + " ";
 
     return res;
 }
 
 int main() {
-  
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
 
     int targetSum, kmax;
     string st;
-     
-    cin>>st;
-    cin>>targetSum>>kmax;    
 
-    string res = solve(st,targetSum,kmax);
+    cin >> st;
+    cin >> targetSum >> kmax;
+
+    string res = solve(st, targetSum, kmax);
     cout << res;
 
-  return 0;
+    return 0;
 }
diff --git a/Qualification Round/Dining Coders/solution.cpp b/Qualification Round/Dining Coders/solution.cpp
@@ -1,69 +1,67 @@
+#include <algorithm>
 #include <iostream>
-#include <vector>
-#include <unordered_set>
-#include <unordered_map>
 #include <queue>
 #include <sstream>
-#include <algorithm>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
 
 using namespace std;
 
 class Table {
-    unordered_map<int, int> who_has_what;
+    unordered_map<int, int> whoHasWhat;
     priority_queue<pair<int, int>> biggest;
     priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> smallest;
     int center;
 
-public:
-    Table(int center, vector<int>& arr){
+   public:
+    Table(int center, vector<int>& arr) {
         this->center = center;
 
-        for (int i = 0; i < arr.size(); i++){
-            who_has_what[i] = arr[i];
+        for (int i = 0; i < arr.size(); i++) {
+            whoHasWhat[i] = arr[i];
             smallest.push({arr[i], i});
             biggest.push({arr[i], -i});
         }
     }
 
-    pair<int, int> push_to_center(int new_element){
-
-        while (who_has_what[smallest.top().second] != smallest.top().first){
+    pair<int, int> pushToCenter(int newElement) {
+        while (whoHasWhat[smallest.top().second] != smallest.top().first) {
             smallest.pop();
         }
 
-        auto top = smallest.top(); smallest.pop();
+        auto top = smallest.top();
+        smallest.pop();
 
-        who_has_what[top.second] = this->center;
+        whoHasWhat[top.second] = this->center;
         smallest.push({this->center, top.second});
-        biggest.push({this->center, -top.second}); // TODO: correct second element
+        biggest.push({this->center, -top.second});
 
-        this->center = new_element;
+        this->center = newElement;
 
         return {top.first, top.second + 1};
     }
 
-    int pop_from_center(int new_element){
-
-        while (who_has_what[-biggest.top().second] != biggest.top().first){
+    int pop_from_center(int newElement) {
+        while (whoHasWhat[-biggest.top().second] != biggest.top().first) {
             biggest.pop();
         }
 
-        auto top = biggest.top(); biggest.pop();
-        
-        int previous_center_val = this->center;
+        auto top = biggest.top();
+        biggest.pop();
+
+        int previousCenterValue = this->center;
         this->center = top.first;
 
-        who_has_what[-top.second] = new_element;
-        smallest.push({new_element, -top.second});
-        biggest.push({new_element, top.second});
-        
-        return previous_center_val;
-    }
+        whoHasWhat[-top.second] = newElement;
+        smallest.push({newElement, -top.second});
+        biggest.push({newElement, top.second});
 
+        return previousCenterValue;
+    }
 };
 
-int main(int argc, char** argv){
-
+int main() {
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
 
@@ -73,22 +71,18 @@ int main(int argc, char** argv){
     vector<int> arr(n);
     for (int i = 0; i < n; i++)
         cin >> arr[i];
-    
+
     Table table = Table(center, arr);
 
-    for (int i = 0; i < m; i++){
-        int q_type, new_element;
-        cin >> q_type >> new_element;
+    for (int i = 0; i < m; i++) {
+        int q_type, newElement;
+        cin >> q_type >> newElement;
 
-        if (q_type == 1){
-            auto ret_val = table.push_to_center(new_element);
+        if (q_type == 1) {
+            auto ret_val = table.pushToCenter(newElement);
             cout << ret_val.first << " " << ret_val.second << "\n";
-        } 
-        else if (q_type == 2){
-            cout << table.pop_from_center(new_element) << "\n";
-        } 
-        else {
-            cerr << "Hatali islem!\n";
+        } else {
+            cout << table.pop_from_center(newElement) << "\n";
         }
     }
 
diff --git a/Qualification Round/Equivalent Words/solution.cpp b/Qualification Round/Equivalent Words/solution.cpp
@@ -1,61 +1,60 @@
+#include <algorithm>
 #include <iostream>
-#include <unordered_map>
 #include <string>
+#include <unordered_map>
 #include <vector>
-#include <algorithm>
 
 using namespace std;
 
 #define ALPHABET_SIZE 26
 
-string calculateHashString(string word){ 
-
+string calculateHashString(string word) {
     vector<int> alphabet(ALPHABET_SIZE);
-    for (char ch: word){
+    for (char ch : word) {
         alphabet[tolower(ch) - 'a']++;
     }
 
     vector<int> letterCounts;
-    for (int i = 0; i < ALPHABET_SIZE; i++){
+    for (int i = 0; i < ALPHABET_SIZE; i++) {
         if (alphabet[i] > 0)
             letterCounts.push_back(alphabet[i]);
     }
+
     sort(letterCounts.begin(), letterCounts.end());
 
     string hashString;
-    for (int count: letterCounts){
+    for (int count : letterCounts) {
         hashString += to_string(count);
         hashString += ',';
     }
     return hashString;
 }
 
-void printVector(vector<int>& v){
-    for (int i = 0; i < v.size(); i++){
+void printVector(vector<int>& v) {
+    for (int i = 0; i < v.size(); i++) {
         cout << v[i] << " ";
-    } cout << endl;
+    }
+    cout << endl;
 }
 
-int main(){
-
+int main() {
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
 
-    int n, m; cin >> n >> m;
-    
+    int n, m;
+    cin >> n >> m;
+
     unordered_map<string, vector<int>> acronyms;
-    
-    for (int i = 0; i < n; i++){
-        string word; cin >> word;
-        acronyms[calculateHashString(word)].push_back(i);
-    }
 
-    for (auto itr = acronyms.begin(); itr != acronyms.end(); itr++){
-        sort(itr->second.begin(), itr->second.end());
+    for (int i = 0; i < n; i++) {
+        string word;
+        cin >> word;
+        acronyms[calculateHashString(word)].push_back(i);
     }
 
-    for (int i = 0; i < m; i++){
-        string query; cin >> query;
+    for (int i = 0; i < m; i++) {
+        string query;
+        cin >> query;
         printVector(acronyms[calculateHashString(query)]);
     }
 
diff --git a/Qualification Round/Kavraz Tree/solution.cpp b/Qualification Round/Kavraz Tree/solution.cpp
@@ -2,40 +2,38 @@
 
 using namespace std;
 
-
-int dfs(vector<vector<int>>& adjList, vector<int>& depths, int node, int parent ){
-
+int dfs(vector<vector<int>>& adjList, vector<int>& kavrazLevels, int node, int parent) {
     // leaves
-    if (adjList[node].size() == 1 && adjList[node][0] == parent){
-        return depths[node] = 0;
+    if (adjList[node].size() == 1 && adjList[node][0] == parent) {
+        return kavrazLevels[node] = 0;
     }
 
-    vector<int> child_depths;
-    for (int next_node: adjList[node]){
+    // for internal nodes, find the kavraz levels of all nodes in subtree
+    vector<int> childKavrazLevels;
+    for (int next_node : adjList[node]) {
         if (next_node != parent)
-            child_depths.push_back(dfs(adjList, depths, next_node, node));
+            childKavrazLevels.push_back(dfs(adjList, kavrazLevels, next_node, node));
     }
 
-    int max_depth = 0;
-    sort(child_depths.begin(), child_depths.end(), greater<int>());
-    for (int i = 0; i < child_depths.size(); i++){
-        max_depth = max(max_depth, child_depths[i] + i + 1);
+    sort(childKavrazLevels.begin(), childKavrazLevels.end(), greater<int>());
+    int maxDepth = 0;
+    for (int i = 0; i < childKavrazLevels.size(); i++) {
+        maxDepth = max(maxDepth, childKavrazLevels[i] + i + 1);
     }
 
-    return depths[node] = max_depth;
+    return kavrazLevels[node] = maxDepth;
 }
 
-int main(){
-
+int main() {
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
 
     int n;
     cin >> n;
 
-    vector<vector<int>> adjList(n+1);
+    vector<vector<int>> adjList(n);
 
-    for (int i = 0; i < n - 1; i++){
+    for (int i = 0; i < n - 1; i++) {
         int x, y;
         cin >> x >> y;
 
@@ -46,9 +44,9 @@ int main(){
     int root;
     cin >> root;
 
-    vector<int> depths(n+1);
+    vector<int> kavrazLevels(n + 1);
 
-    cout << dfs(adjList, depths, root, -1);
+    cout << dfs(adjList, kavrazLevels, root, -1);
 
     return 0;
 }
diff --git a/Qualification Round/Life/solution.cpp b/Qualification Round/Life/solution.cpp
diff --git a/Qualification Round/Verbum Profundum/solution.cpp b/Qualification Round/Verbum Profundum/solution.cpp
