01 2021 档案

LC 1735. Count Ways to Make Array With Product
摘要：link class Solution { public: #define LL long long const int mod=1E9+7; int c[10015][15]; vector<int> waysToFillArray(vector<vector<int>>& queries) { 阅读全文
posted @ 2021-01-25 21:37 feibilun 阅读(80) 评论(0) 推荐(0)
LC 5529. Cat and Mouse II (gaming/bfs/topo)
摘要：link class Solution { public: struct State{ int mpos; int cpos; int turn; int win; State(int m, int c, int t, int w){ mpos=m; cpos=c; turn=t; win=w; } 阅读全文
posted @ 2021-01-18 12:16 feibilun 阅读(81) 评论(0) 推荐(0)
LC 1723. Find Minimum Time to Finish All Jobs (dp+二分)
摘要：link 普通dp: class Solution { public: int n; int minimumTimeRequired(vector<int>& jobs, int k) { n=jobs.size(); vector<int> sum(1<<n); for(int i=1;i<(1< 阅读全文
posted @ 2021-01-11 18:44 feibilun 阅读(90) 评论(0) 推荐(0)