{"id":130,"date":"2010-08-08T08:36:34","date_gmt":"2010-08-08T00:36:34","guid":{"rendered":"http:\/\/www.shuizilong.com\/house\/?p=130"},"modified":"2012-03-03T08:37:48","modified_gmt":"2012-03-03T00:37:48","slug":"hoj-2839-i-love-sneakers","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/hoj-2839-i-love-sneakers\/","title":{"rendered":"HOJ 2839. I love sneakers!"},"content":{"rendered":"<h3>Brief description :<\/h3>\n<p>    \u8981\u6c42\u6bcf\u7c7b\u7269\u54c1\u81f3\u5c11\u9009\u62e9\u4e00\u4e2a\u76840\/1\u80cc\u5305\u3002<br \/>\n<!--more--><\/p>\n<h3>Analyse :<\/h3>\n<p>  &#8230; \u4eca\u5929\u96c6\u8bad\u961f\u653e\u5047\uff0c\u56e0\u6b64\u6bd4\u8f83\u6709\u65f6\u95f4\u590d\u4e60\u51e0\u9053\u4e4b\u524d\u6bd4\u8d5b\u65f6\u6ca1\u6709\u5199\u51fa\u7684\u9898\u76ee\uff0c\u9996\u5148\u662f\u8fd9\u9053\u80cc\u5305\u9898\uff0c\u56e0\u4e3a\u4e4b\u524d\u6709<a href=\"https:\/\/www.shuizilong.com\/house\/archives\/1300\">\u6536\u96c68\u59d0\u7684\u6e90\u7801<\/a>\u3002<\/p>\n<p><!--more--><\/p>\n<pre lang=\"cpp\" file=\"Solution_1.cpp\">\r\n#include <iostream>\r\n#include <cstring>\r\n#include <vector>\r\n\r\nusing namespace std;\r\nconst int N = 100, M = 10001, K = 10;\r\nconst int INF = 1e9;\r\nstruct snearker{\r\n    int price, value;\r\n};\r\nvector<snearker> s[K];\r\nint d[2][M], g[M];\r\nint n, m, k, p, q;\r\nint ans;\r\n\/\/ d: \u8003\u5bdf\u524di\u79cd\u5546\u54c1, \u5206\u914dj\u5757\u94b1\u65f6\u6240\u80fd\u53d6\u5f97\u7684\u6700\u5927\u503c\u3002(\u6bcf\u79cd\u5546\u54c1\u90fd\u8981\u9009\u5426\u5219\u8d4b\u503c\u4e3a-INF.)\r\n\/\/ g: \u53ea\u8003\u5bdf\u7b2ci\u7ec4\u5546\u54c1\uff0c \u5206\u914dj\u5757\u94b1\u65f6\u6240\u80fd\u53d6\u5f97\u7684\u6700\u5927\u503c\uff0c\u5982\u679c\u65e0\u6cd5\u8d2d\u4e70\u4efb\u4f55\u4e00\u4e2a\u5219\u8bb0\u4f5c0\u3002\u3002\r\n\r\n\r\n\r\nvoid init(){\r\n    int index; snearker x;\r\n    for (int i=0;i<k;i++)\r\n        s[i].clear();\r\n\r\n    for (int i=0;i<n;i++){\r\n        cin >> index >> x.price >> x.value;\r\n        s[index-1].push_back(x);\r\n    }\r\n}\r\n\r\nvoid solve(){\r\n\r\n    ans = -1;\r\n    for (int i=0;i<k;i++)\r\n        if (s[i].empty()) return;\r\n\r\n    memset(d[0], -1, sizeof(d[0])); d[0][0] = 0;\r\n\r\n    p = 0;\r\n\r\n    for (int i=0;i<k;i++){\r\n        memset(g, -1, sizeof(g)); g[0] = 0;\r\n\r\n        for (int j=0;j<s[i].size();j++)\r\n            for (int k=m;k>=s[i][j].price;k--){\r\n                if (g[k-s[i][j].price]==-1) continue;\r\n                g[k] = max(g[k], g[k-s[i][j].price] + s[i][j].value);\r\n            }\r\n        q = p; p = 1 - p;\r\n        memset(d[p], -1, sizeof(d[p]));\r\n\r\n        for (int k=1;k<=m;k++){\r\n            if (g[k]==-1) continue;\r\n            for (int j=k;j<=m;j++){\r\n                if (d[q][j-k]==-1) continue;\r\n                d[p][j] = max(d[p][j], d[q][j-k] + g[k]);\r\n            }\r\n        }\r\n    }\r\n\r\n    for (int i=1;i<=m;i++){\r\n        if (d[p][i]==-1) continue;\r\n        ans = max(ans, d[p][i]);\r\n    }\r\n\r\n\r\n}\r\n\r\nint main(){\r\n    while (cin >> n >> m >> k){\r\n        init(); solve();\r\n        if (ans==-1) printf(\"Impossible\\n\");\r\n        else printf(\"%d\\n\", ans);\r\n    }\r\n}\r\n<\/pre>\n<pre lang=\"cpp\" file=\"Solution_2.cpp\">\r\n#include <iostream>\r\n#include <cstring>\r\n#include <algorithm>\r\n\r\nusing namespace std;\r\nconst int N = 101, M = 10001, K = 11;\r\nstruct snearker{\r\n    int price, value;\r\n    int type;\r\n    friend bool operator <(snearker a, snearker b){\r\n        return a.type<b.type;\r\n    }\r\n} s[N];\r\n\r\nint d[2][M]; bool c[K];\r\nint n, m, k, p, q;\r\nint ans;\r\n\r\n\r\n\r\nvoid init(){\r\n    memset(c, false, sizeof(c));\r\n    for (int i=0;i<n;i++){\r\n        cin >> s[i].type >> s[i].price >> s[i].value;\r\n        c[s[i].type] = true;\r\n    }\r\n\r\n    sort(s, s+n);\r\n}\r\n\r\nvoid solve(){\r\n    ans = -1;\r\n    for (int i=1;i<=k;i++) if (!c[i]) return;\r\n\r\n    memset(d[0], -1, sizeof(d[0])); d[0][0] = 0;\r\n    \/\/memset(d[0], 0, sizeof(d[0]));\r\n    p = 0;\r\n\r\n    for (int i=0;i<n;i++){\r\n        if (i==0||s[i].type!=s[i-1].type){\r\n            q = p; p = 1 - p;\r\n            memset(d[p], -1, sizeof(d[p]));\r\n        }\r\n\r\n        for (int j=m;j>=s[i].price;j--){\r\n            if (d[p][j-s[i].price]!=-1)\r\n                d[p][j] = max(d[p][j], d[p][j-s[i].price] + s[i].value);\r\n            if (d[q][j-s[i].price]!=-1)\r\n                d[p][j] = max(d[p][j], d[q][j-s[i].price] + s[i].value);\r\n        }\r\n    }\r\n\r\n\r\n\r\n    for (int i=1;i<=m;i++){\r\n        if (d[p][i]==-1) continue;\r\n        ans = max(ans, d[p][i]);\r\n    }\r\n    \/\/ans = d[p][m];\r\n}\r\n\r\nint main(){\r\n    while (cin >> n >> m >> k){\r\n        init(); solve();\r\n        if (ans==-1) printf(\"Impossible\\n\");\r\n        else printf(\"%d\\n\", ans);\r\n    }\r\n}\r\n<\/pre>\n<p><bk><\/p>\n<p><bk><\/p>\n<p><bk><\/p>\n<h3>Note :<\/h3>\n<p>\u8fd9\u9898\u786e\u5b9e\u5b58\u5728\u8fd9\u4e24\u79cd\u65b9\u6cd5\uff0c\u7b2c\u4e00\u79cd\u662f\u5148\u5c06\u7269\u54c1\u8fdb\u884c\u5206\u7ec4\uff0c\u8fdb\u884c\u4e00\u6b210\/1\u80cc\u5305\uff0c\u518d\u5c06\u4e4b\u540e\u5f97\u5230\u7684 g \u6570\u7ec4\u53d6\u51fa\u505a\u4e3a\u7269\u54c1\u8fdb\u884c\u7b2c\u4e8c\u6b210\/1\u80cc\u5305\u3002\u3002\u3002<br \/>\n\u6bd4\u8d5b\u7684\u65f6\u4faf\u6ca1\u6709\u5199\u5b8c\u3002\u3002\u4e4b\u540e\u63d0\u4ea4\u7684\u65f6\u4faf\u5219\u4e00\u76f4 TLE \u3002\u3002\u3002\u3002<br \/>\n\u7b2c\u4e8c\u79cd\u4ee3\u7801\u5219\u662f\u9605\u8bfb8\u59d0\u7684\u65b9\u6cd5\u4ee5\u540e\u5199\u51fa\u7684\u3002\u3002\u3002\u662f\u4e00\u79cd\u66f4\u76f4\u63a5\u7684\u52a8\u6001\u89c4\u5212\uff0c\u53ef\u4ee5\u5728\u65f6\u9650\u5185 AC\u3002<\/p>\n<p>1. \u8fb9\u754c\u6761\u4ef6<\/p>\n<p>\u5728\u9605\u8bfb\u4e868\u59d0\u7684\u7801\u4e4b\u540e\u6211\u53d1\u73b0\u4e4b\u524d\u5728\u8fd9\u91cc\u7684\u5904\u7406\u5b9e\u9645\u4e0a\u662f\u6bd4\u8f83\u4e71\u7684\u3002\u3002\u800c\u4e14\u6211\u8ba4\u4e3a\u5fc5\u987b\u628a\u6570\u7ec4\u8d4b\u521d\u503c\uff0d1\uff0c\uff08\u8fd9\u6837\u624d\u80fd\u4fdd\u8bc1\u5f97\u5230\u5982\u679c\u4e00\u4e2a\u7c7b\u522b\u7684\u7269\u54c1\u6ca1\u6709\u53d6\u5219\u4e0d\u80fd\u5f97\u5230\u89e3\u3002\u3002\uff09\u5e76\u4e14\u518d\u7ed3\u675f\u52a8\u6001\u89c4\u5212\u4e4b\u540e\u8981\u5728\u6574\u4e2a\u6570\u7ec4\u91cc\u626b\u63cf\u4e00\u904d\u4ee5\u53d6\u51fa\u6700\u5927\u503c\u3002\u3002<br \/>\n\u4f46\u662f8\u59d0\u7684\u4ee3\u7801\u4e5f\u662f\u5bf9\u7684\uff0c\u5173\u4e8e\u8fd9\u9898\u91cc\u4ec0\u4e48\u65f6\u4faf\u8d4b\uff0d1\uff0c\u4ec0\u4e48\u65f6\u4faf\u8d4b 0 \u4e5f\u662f\u4e00\u4e2a\u5f88\u503c\u5f97\u601d\u7d22\u7684\u95ee\u9898\u3002<\/p>\n<p>2. \u98d8\u9038\u7684\u6392\u5e8f\u3002<br \/>\n8\u59d0\u7684\u7801\u91cc\u7684\u90a3\u4e2a\u6392\u5e8f\u5199\u7684\u5f88\u98d8\u9038\u3002\u3002\u3002<br \/>\n\u6211\u5728\u9605\u8bfb\u4e4b\u540e\u8fd8\u81ea\u5df1yy\u4e86\u4e00\u4e2a\u91cd\u8f7d\u5c0f\u4e8e\u53f7\u4e3a a.ty!=b.ty \u7684\u65b9\u6cd5\uff0c\u60f3\u6392\u51fa 1 1 3 2 2 2 \u8fd9\u79cd\u795e\u5947\u7684\u6548\u679c\uff0c\u4e0d\u8fc7\u5931\u8d25\u3002\uff5e<br \/>\n\u6211\u8fd8\u662f\u5199\u666e\u901a\u7684\u5427\uff5e<\/p>\n<p>3. \u8fdb\u4e00\u6b65\u7684\u4f18\u5316\u3002<br \/>\n\u5173\u4e8e\u7b2c\u4e00\u4e2a\u4ee3\u7801\u7684TLE\u6211\u662f\u6709\u5f88\u591a\u4e0d\u6ee1\u7684\u3002\u3002\u800c\u4e14\u5177\u4f53\u539f\u56e0\u4e5f\u6ca1\u6709\u529e\u6cd5\u627e\u5230\uff0c\u4f46\u662f\u503c\u5f97\u80af\u5b9a\u7684\u662f\u5206\u7ec4\u8fdb\u884c\u4e24\u6b21\u52a8\u6001\u89c4\u5212\u4e00\u5b9a\u6709\u5b83\u7684\u597d\u5904\u7684\u3002\u3002\u3002<br \/>\n\u3002\u3002\u3002\uff08\u6bd4\u5982\u6bcf\u5c42\u7684\u7269\u54c1\u6570\u4f1a\u51cf\u5c11\uff0c\u6709\u6548\u7684\u72b6\u6001\u4f1a\u6709\u9650\u3002\u3002\u4f46\u6211\u4e0d\u77e5\u9053\u5982\u4f55\u5e94\u7528\u8fd9\u4e2a\u7279\u6027\u8fdb\u884c\u4f18\u5316\uff0c\u662f\u5426\u8981\u7528\u53cc\u5411\u94fe\u8868\u4fdd\u5b58\u72b6\u6001\uff0c\u4f46\u6211\u4e0d\u80fd\u786e\u5b9a\u4f1a\u6709\u6548\u3002\u3002\u3002\u3002\uff09<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Brief description : \u8981\u6c42\u6bcf\u7c7b\u7269\u54c1\u81f3\u5c11\u9009\u62e9\u4e00\u4e2a\u76840\/1\u80cc\u5305\u3002<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-130","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-26","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/130","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=130"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/130\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=130"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=130"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=130"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}