Time: 1414 ms (5.17%), Space: 17.4 MB (26.55%) - LeetHub

Author: deepankarvarma

1799-maximize-score-after-n-operations/1799-maximize-score-after-n-operations.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    map<int,int>m;
+    int c(int t,int mask,vector<int>&nums){
+        if(t==0)return 0;
+        if(m[mask])return m[mask];
+        int ans=0;
+        for(int i=0;i<nums.size();i++){
+            for(int j=0;j<nums.size();j++){
+                if((mask & (1<<i)) && (mask & (1<<j)) && (i!=j)){
+                    ans=max(ans,t*__gcd(nums[i],nums[j]) + c(t-1,mask^(1<<i)^(1<<j),nums));
+                }
+            }
+        }
+        m[mask]=ans;
+        return ans;
+    }
+    int maxScore(vector<int>& nums) {
+        int n=nums.size();
+        int mask=(1<<n)-1;
+        return c(n/2,mask,nums);
+    }
+};