{"id":92,"date":"2011-10-01T19:01:25","date_gmt":"2011-10-01T10:01:25","guid":{"rendered":"http:\/\/tech.fuqinho.net\/?p=92"},"modified":"2011-10-01T19:01:25","modified_gmt":"2011-10-01T10:01:25","slug":"google-code-jam-japan-2011-%e4%ba%88%e9%81%b8","status":"publish","type":"post","link":"https:\/\/tech.fuqinho.net\/?p=92","title":{"rendered":"Google Code Jam Japan 2011 \u4e88\u9078"},"content":{"rendered":"

\t\t\t\t\u3046\u307e\u3044\u3053\u3068\u5168\u90e8\u3042\u3063\u3066\u305f\uff01
\n\u524d\u3082\u4e88\u9078\u306f\u826f\u304b\u3063\u305f\u3093\u3067\u3059\u3001\u4e88\u9078\u306f\u3002<\/p>\n

A. \u30ab\u30fc\u30c9\u30b7\u30e3\u30c3\u30d5\u30eb<\/h3>\n

Large\u306e\u898f\u6a21\u304b\u3089\u3059\u308b\u3068\u5168\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u306f\u8a18\u61b6\u3067\u304d\u306a\u3044\u306e\u3067\u3001\u76ee\u7684\u306e\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u3060\u3051\u8ffd\u3046\u3002
\n\u6700\u5f8c\u306bW\u756a\u76ee\u306b\u3042\u308b\u30ab\u30fc\u30c9\u306b\u3064\u3044\u3066\u3060\u3051\u77e5\u308a\u305f\u3044\u306e\u3067\u3001\u305d\u3053\u304b\u3089\u9006\u306e\u64cd\u4f5c\u3092\u3057\u3066\u3044\u3063\u3066\u6700\u521d\u306b\u3069\u3053\u306b\u3044\u308b\u304b\u3092\u6c42\u3081\u308b\u3002<\/p>\n

[cpp]
\n#include <iostream>
\n#include <vector>
\nusing namespace std;<\/p>\n

int solve(int M, int C, int W, vector<int>& A, vector<int>& B) {
\n for (int i = C – 1; i >= 0; i–) {
\n if (W <= B[i]) {
\n W += A[i] – 1;
\n } else if (W <= A[i] + B[i] – 1) {
\n W -= B[i];
\n }
\n }
\n return W;
\n}<\/p>\n

int main() {
\n int T, M, C, W, tmpA, tmpB;
\n cin >> T;
\n for (int i = 1; i <= T; i++) {
\n cin >> M >> C >> W;
\n vector<int> A;
\n vector<int> B;
\n for (int j = 0; j < C; j++) {
\n cin >> tmpA >> tmpB;
\n A.push_back(tmpA);
\n B.push_back(tmpB);
\n }
\n int answer = solve(M, C, W, A, B);
\n cout << "Case #" << i << ": " << answer << endl;
\n }
\n}
\n[\/cpp]<\/p>\n

C. \u30d3\u30c3\u30c8\u6570<\/h3>\n

\u8caa\u6b32\u6cd5\u3002\u4e0e\u3048\u3089\u308c\u305f\u6570\u5b57\u306e\u4e0b\u4f4d\u30d3\u30c3\u30c8\u304b\u3089\u9806\u306b\u898b\u3066\u884c\u3063\u3066\u3001
\n\u30fb0\u3060\u3063\u305f\u30891\u30681\u306b\u5206\u5272\u3059\u308b\u3002\u5143\u306e\u6570\u5b57\u306f\u7e70\u308a\u4e0b\u3052(?)\u304c\u8d77\u3053\u308b(\u7b54\u3048\u306f2\u5897\u3048\u308b)
\n\u30fb1\u3060\u3063\u305f\u30890\u30681\u306b\u5206\u5272(\u7b54\u3048\u306f1\u5897\u3048\u308b)
\n\u3068\u3084\u308b\u624b\u9806\u304c\u7b54\u3048\u3092\u6700\u5927\u306b\u3059\u308b\u306f\u305a\u3002\u8a3c\u660e\u306f\u308f\u304b\u3089\u306a\u3044\u3002<\/p>\n

[cpp]
\n#include <iostream>
\n#include <vector>
\nusing namespace std;<\/p>\n

int solve(unsigned long long N) {
\n int result = 0;
\n while (N != 0) {
\n if (N & 1) {
\n result += 1;
\n } else {
\n result += 2;
\n N -= 2;
\n }
\n N = (N >> 1);
\n }
\n return result;
\n}<\/p>\n

int main() {
\n int T;
\n cin >> T;
\n for (int i = 1; i <= T; i++) {
\n unsigned long long N;
\n cin >> N;
\n int answer = solve(N);
\n cout << "Case #" << i << ": " << answer << endl;
\n }
\n}
\n[\/cpp]<\/p>\n

B. \u6700\u9ad8\u306e\u30b3\u30fc\u30d2\u30fc<\/h3>\n

\u3053\u308c\u3059\u3054\u3044\u82e6\u3057\u3093\u3060\u2026
\n\u307e\u305a\u89e3\u6cd5\u3092\u601d\u3044\u3064\u304f\u307e\u3067\u624b\u3053\u305a\u3063\u3066\u305f\u3002
\n\u521d\u65e5\u304b\u3089\u9806\u306b\u4f55\u3089\u304b\u306e\u57fa\u6e96\u3067\u30b3\u30fc\u30d2\u30fc\u9078\u3073\u305f\u3044\u3093\u3060\u3051\u3069\u3001\u30d1\u30e9\u30e1\u30fc\u30bf\u591a\u3059\u304e\u3066\u304c\u308f\u3051\u304c\u5206\u304b\u3089\u306a\u3044\u3002\u30ca\u30c3\u30d7\u30b5\u30c3\u30af\u554f\u984c\u7684\u306a\u611f\u3058\uff1f\u3068\u304b\u53f3\u5f80\u5de6\u5f80\u3002
\n\u3067\u3001\u304a\u3084\u3064\u98df\u3079\u3066\u30c8\u30a4\u30ec\u884c\u3063\u3066\u305f\u3089\u3001\u3042\u308c\u9006\u304b\u3089\u57cb\u3081\u308c\u3070\u3044\u3044\u3093\u3058\u3083\u306d\uff1f\u3063\u3066\u6c17\u4ed8\u3044\u305f\u3002\u3053\u308c\u3082\u8caa\u6b32\u6cd5\u304b\u3002
\n\u672a\u6765\u306b\u306a\u308c\u3070\u306a\u308b\u307b\u3069\u8cde\u5473\u671f\u9650\u306e\u95a2\u4fc2\u3067\u98f2\u3081\u308b\u30b3\u30fc\u30d2\u30fc\u304c\u72ed\u307e\u308b\u306e\u3067\u3001\u672a\u6765\u306e\u65b9\u304b\u3089\u9806\u306b\u3001\u305d\u306e\u65e5\u306b\u98f2\u3081\u308b\u30b3\u30fc\u30d2\u30fc\u306e\u4e2d\u304b\u3089\u4e00\u756a\u3044\u3044\u30b3\u30fc\u30d2\u30fc\u3092\u98f2\u3093\u3067\u884c\u3063\u305f\u3089\u30c8\u30fc\u30bf\u30eb\u3067MAX\u6e80\u8db3\u306b\u306a\u308b\u306f\u305a\u3002
\n\u8a3c\u660e\u306f\u308f\u304b\u3089\u306a\u3044\u3002
\n\u3067\u3001\u305d\u308c\u304c\u5206\u304b\u3063\u305f\u306f\u3044\u3044\u3051\u3069\u5b9f\u88c5\u304c\u91cd\u3044\u2026
\n\u30d0\u30b0\u308a\u307e\u304f\u3063\u305f\u3051\u3069\u306a\u3093\u3068\u304b\u901a\u3057\u305f\u3002<\/p>\n

[cpp]
\n#include <iostream>
\n#include <vector>
\nusing namespace std;<\/p>\n

struct Coffee {
\n long long c; \/\/ \u3053\u306e\u30b3\u30fc\u30d2\u30fc\u306e\u6b8b\u308a\u306e\u30ab\u30c3\u30d7\u6570
\n long long t; \/\/ \u8cde\u5473\u671f\u9650
\n int s; \/\/ \u6e80\u8db3\u5ea6
\n Coffee(long long c, long long t, int s) :
\n c(c), t(t), s(s) {}
\n};<\/p>\n

bool GreaterT(const Coffee& lhs, const Coffee& rhs) {
\n return lhs.t > rhs.t;
\n}<\/p>\n

\/\/ {days}\u65e5\u9593\u3067\u3001{coffee}\u914d\u5217\u306e\u5148\u982d{availableNum}\u500b\u306e\u7a2e\u985e\u306e\u4e2d\u304b\u3089\u3001
\n\/\/ \u6e80\u8db3\u5ea6\u304c\u9ad8\u3044\u9806\u306b\u98f2\u3093\u3067\u3044\u3063\u3066\u30c8\u30fc\u30bf\u30eb\u306e\u6e80\u8db3\u5ea6\u3092\u8fd4\u3059
\nlong long consume(int availableNum, vector<Coffee>& coffee, long long days) {
\n long long score = 0;
\n long long remainDays = days;
\n long long remainigCups = 0;
\n for (int i = 0; i < availableNum; i++) remainigCups += coffee[i].c;
\n \/\/ \u30b3\u30fc\u30d2\u30fc\u98f2\u3093\u3067\u306a\u3044\u65e5\u304c\u7121\u304f\u306a\u308b\u304b\u3001\u30b3\u30fc\u30d2\u30fc\u304c\u7121\u304f\u306a\u308b\u307e\u3067
\n \/\/ \u6e80\u8db3\u5ea6MAX\u306e\u30b3\u30fc\u30d2\u30fc\u63a2\u3057\u3066\u98f2\u3081\u308b\u3060\u3051\u98f2\u3080
\n while (remainDays != 0 && remainigCups != 0) {
\n int maxS = 0;
\n int indexForMaxS = 0;
\n for (int i = 0; i < availableNum; i++) {
\n if (coffee[i].c != 0 && coffee[i].s > maxS) {
\n maxS = coffee[i].s;
\n indexForMaxS = i;
\n }
\n }
\n long long cupsToDrink = min(remainDays, coffee[indexForMaxS].c);
\n remainDays -= cupsToDrink;
\n remainigCups -= cupsToDrink;
\n coffee[indexForMaxS].c -= cupsToDrink;
\n score += coffee[indexForMaxS].s * cupsToDrink;
\n }
\n return score;
\n}<\/p>\n

\/\/ \u8caa\u6b32\u6cd5\u3002\u671f\u9593\u5185\u306e\u304a\u3057\u308a\u306e\u65b9\u304b\u3089\u9806\u306b\u6e80\u8db3\u5ea6\u9ad8\u3044\u30b3\u30fc\u30d2\u30fc\u3092\u57cb\u3081\u3066\u3044\u304f\u3002
\nlong long solve(int N, long long K, vector<Coffee>& coffee) {
\n long long score = 0;
\n \/\/ \u671f\u9650\u304c\u9060\u3044\u9806\u306b\u30b3\u30fc\u30d2\u30fc\u306e\u30ea\u30b9\u30c8\u3092\u30bd\u30fc\u30c8
\n sort(coffee.begin(), coffee.end(), GreaterT);<\/p>\n

\/\/ \u672a\u6765\u306e\u65b9\u304b\u3089\u3001\u300cn\u65e5\u9593\u306fi\u7a2e\u985e\u306e\u30b3\u30fc\u30d2\u30fc\u304c\u98f2\u3081\u308b\u300d
\n \/\/ \u3068\u3044\u3046\u533a\u9593\u3092\u53d6\u308a\u51fa\u3057\u3066\u3001\u305d\u306e\u671f\u9593\u5185\u3067\u3069\u308c\u3060\u3051\u6e80\u8db3
\n \/\/ \u3067\u304d\u308b\u304b\u3092consume()\u95a2\u6570\u3067\u8a08\u7b97\u3059\u308b
\n long long curT = coffee[0].t;
\n int startIndex = 0;
\n int availableNum;
\n for (int i = 0; i < coffee.size(); i++) {
\n \/\/ i\u756a\u76ee\u306e\u30b3\u30fc\u30d2\u30fc\u306f\u671f\u9650\u304c\u9055\u3046\u5834\u5408\u3001
\n \/\/ i-1\u756a\u76ee\u307e\u3067\u306ei\u7a2e\u985e\u306e\u30b3\u30fc\u30d2\u30fc\u3092\u98f2\u3081\u305f\u671f\u9593\u3092\u8a08\u7b97\u3057\u3066\u3001
\n \/\/ \u305d\u306e\u671f\u9593\u5185\u3067\u3044\u3044\u3084\u3064\u304b\u3089\u98f2\u3093\u3060\u5834\u5408\u306e\u6e80\u8db3\u5ea6\u3092\u8db3\u3057\u3053\u3080
\n if (coffee[i].t != curT) {
\n curT = coffee[i].t;
\n long long days = coffee[startIndex].t – coffee[i].t;
\n score += consume(i, coffee, days);
\n startIndex = i;
\n }
\n \/\/ \u521d\u65e5\u3092\u542b\u3080\u671f\u9593\u3082\u540c\u3058\u8981\u9818
\n if (i == coffee.size() – 1) {
\n long long days = coffee[startIndex].t;
\n score += consume(coffee.size(), coffee, days);
\n }
\n }
\n return score;
\n}<\/p>\n

int main() {
\n int T;
\n cin >> T;
\n for (int i = 1; i <= T; i++) {
\n \/\/ read parameter from standard input
\n int N;
\n long long K;
\n cin >> N >> K;
\n vector<Coffee> coffee;
\n for (int j = 0; j < N; j++) {
\n long long c, t; int s;
\n cin >> c >> t >> s;
\n Coffee cof(c, t, s);
\n coffee.push_back(cof);
\n }
\n \/\/ solve and print answer to standard output
\n long long answer = solve(N, K, coffee);
\n cout << "Case #" << i << ": " << answer << endl;
\n }
\n}
\n[\/cpp]<\/p>\n

\u3044\u3064\u3082\u306e\u3053\u3068\u3060\u3051\u3069\u3001\u307b\u3093\u3068\u4e0a\u4f4d\u9663\u30cf\u30f3\u30d1\u306a\u3044\u3002
\n\u554f\u984cB\u304c10\u5206\u3068\u304b\u3001\u3069\u3046\u306a\u3063\u3066\u3093\u306e\u2026
\n10\u5206\u7d4c\u904e\u6642\u70b9\u306a\u3093\u3066\u3001\u3088\u3046\u3084\u304f\u554f\u984c\u6587\u8aad\u307f\u7d42\u308f\u3063\u3066\u30b3\u30fc\u30d2\u30fc\u30ab\u30c3\u30d7\u306e\u843d\u66f8\u304d\u3057\u3066\u308b\u9803\u3002
\n\u7b54\u3048\u77e5\u3063\u3066\u308b\u72b6\u614b\u3067\u3082\u3046\u4e00\u56de\u5b9f\u88c5\u3059\u308b\u3060\u3051\u3067\u3082\u500d\u306f\u304b\u304b\u308b\u81ea\u4fe1\u3042\u308b\u3002\u982d\u306e\u4e2d\u898b\u3066\u307f\u305f\u3044\u306a<\/p>\n","protected":false},"excerpt":{"rendered":"

\u3046\u307e\u3044\u3053\u3068\u5168\u90e8\u3042\u3063\u3066\u305f\uff01 \u524d\u3082\u4e88\u9078\u306f\u826f\u304b\u3063\u305f\u3093\u3067\u3059\u3001\u4e88\u9078\u306f\u3002 A. \u30ab\u30fc\u30c9\u30b7\u30e3\u30c3\u30d5\u30eb Large\u306e\u898f\u6a21\u304b\u3089\u3059\u308b\u3068\u5168\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u306f\u8a18\u61b6\u3067\u304d\u306a\u3044\u306e\u3067\u3001\u76ee\u7684\u306e\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u3060\u3051\u8ffd\u3046\u3002 \u6700\u5f8c\u306bW\u756a\u76ee\u306b\u3042\u308b\u30ab\u30fc\u30c9\u306b\u3064\u3044\u3066\u3060\u3051\u77e5\u308a\u305f\u3044 … \u7d9a\u304d\u3092\u8aad\u3080<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_mi_skip_tracking":false,"footnotes":""},"categories":[2],"tags":[],"class_list":["post-92","post","type-post","status-publish","format-standard","hentry","category-2"],"yoast_head":"\nGoogle Code Jam Japan 2011 \u4e88\u9078 - Happy Coder<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/tech.fuqinho.net\/?p=92\" \/>\n<meta property=\"og:locale\" content=\"ja_JP\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Google Code Jam Japan 2011 \u4e88\u9078 - Happy Coder\" \/>\n<meta property=\"og:description\" content=\"\u3046\u307e\u3044\u3053\u3068\u5168\u90e8\u3042\u3063\u3066\u305f\uff01 \u524d\u3082\u4e88\u9078\u306f\u826f\u304b\u3063\u305f\u3093\u3067\u3059\u3001\u4e88\u9078\u306f\u3002 A. \u30ab\u30fc\u30c9\u30b7\u30e3\u30c3\u30d5\u30eb Large\u306e\u898f\u6a21\u304b\u3089\u3059\u308b\u3068\u5168\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u306f\u8a18\u61b6\u3067\u304d\u306a\u3044\u306e\u3067\u3001\u76ee\u7684\u306e\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u3060\u3051\u8ffd\u3046\u3002 \u6700\u5f8c\u306bW\u756a\u76ee\u306b\u3042\u308b\u30ab\u30fc\u30c9\u306b\u3064\u3044\u3066\u3060\u3051\u77e5\u308a\u305f\u3044 ... \u7d9a\u304d\u3092\u8aad\u3080\" \/>\n<meta property=\"og:url\" content=\"https:\/\/tech.fuqinho.net\/?p=92\" \/>\n<meta property=\"og:site_name\" content=\"Happy Coder\" \/>\n<meta property=\"article:published_time\" content=\"2011-10-01T10:01:25+00:00\" \/>\n<meta name=\"author\" content=\"fuqinho\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u57f7\u7b46\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"fuqinho\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593\" \/>\n\t<meta name=\"twitter:data2\" content=\"3\u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92#article\",\"isPartOf\":{\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92\"},\"author\":{\"name\":\"fuqinho\",\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7\"},\"headline\":\"Google Code Jam Japan 2011 \u4e88\u9078\",\"datePublished\":\"2011-10-01T10:01:25+00:00\",\"dateModified\":\"2011-10-01T10:01:25+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92\"},\"wordCount\":593,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7\"},\"inLanguage\":\"ja\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/tech.fuqinho.net\/?p=92#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92\",\"url\":\"https:\/\/tech.fuqinho.net\/?p=92\",\"name\":\"Google Code Jam Japan 2011 \u4e88\u9078 - Happy Coder\",\"isPartOf\":{\"@id\":\"https:\/\/tech.fuqinho.net\/#website\"},\"datePublished\":\"2011-10-01T10:01:25+00:00\",\"dateModified\":\"2011-10-01T10:01:25+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92#breadcrumb\"},\"inLanguage\":\"ja\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/tech.fuqinho.net\/?p=92\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/tech.fuqinho.net\/?p=92#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u30db\u30fc\u30e0\",\"item\":\"https:\/\/tech.fuqinho.net\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Google Code Jam Japan 2011 \u4e88\u9078\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/tech.fuqinho.net\/#website\",\"url\":\"https:\/\/tech.fuqinho.net\/\",\"name\":\"Happy Coder\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/tech.fuqinho.net\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"ja\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7\",\"name\":\"fuqinho\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ja\",\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/tech.fuqinho.net\/wp-content\/uploads\/2023\/02\/hatena-block_400x400.png\",\"contentUrl\":\"https:\/\/tech.fuqinho.net\/wp-content\/uploads\/2023\/02\/hatena-block_400x400.png\",\"width\":400,\"height\":400,\"caption\":\"fuqinho\"},\"logo\":{\"@id\":\"https:\/\/tech.fuqinho.net\/#\/schema\/person\/image\/\"},\"sameAs\":[\"http:\/\/tech.fuqinho.net\"],\"url\":\"https:\/\/tech.fuqinho.net\/?author=1\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Google Code Jam Japan 2011 \u4e88\u9078 - Happy Coder","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/tech.fuqinho.net\/?p=92","og_locale":"ja_JP","og_type":"article","og_title":"Google Code Jam Japan 2011 \u4e88\u9078 - Happy Coder","og_description":"\u3046\u307e\u3044\u3053\u3068\u5168\u90e8\u3042\u3063\u3066\u305f\uff01 \u524d\u3082\u4e88\u9078\u306f\u826f\u304b\u3063\u305f\u3093\u3067\u3059\u3001\u4e88\u9078\u306f\u3002 A. \u30ab\u30fc\u30c9\u30b7\u30e3\u30c3\u30d5\u30eb Large\u306e\u898f\u6a21\u304b\u3089\u3059\u308b\u3068\u5168\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u306f\u8a18\u61b6\u3067\u304d\u306a\u3044\u306e\u3067\u3001\u76ee\u7684\u306e\u30ab\u30fc\u30c9\u306e\u72b6\u614b\u3060\u3051\u8ffd\u3046\u3002 \u6700\u5f8c\u306bW\u756a\u76ee\u306b\u3042\u308b\u30ab\u30fc\u30c9\u306b\u3064\u3044\u3066\u3060\u3051\u77e5\u308a\u305f\u3044 ... \u7d9a\u304d\u3092\u8aad\u3080","og_url":"https:\/\/tech.fuqinho.net\/?p=92","og_site_name":"Happy Coder","article_published_time":"2011-10-01T10:01:25+00:00","author":"fuqinho","twitter_card":"summary_large_image","twitter_misc":{"\u57f7\u7b46\u8005":"fuqinho","\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593":"3\u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/tech.fuqinho.net\/?p=92#article","isPartOf":{"@id":"https:\/\/tech.fuqinho.net\/?p=92"},"author":{"name":"fuqinho","@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7"},"headline":"Google Code Jam Japan 2011 \u4e88\u9078","datePublished":"2011-10-01T10:01:25+00:00","dateModified":"2011-10-01T10:01:25+00:00","mainEntityOfPage":{"@id":"https:\/\/tech.fuqinho.net\/?p=92"},"wordCount":593,"commentCount":0,"publisher":{"@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7"},"inLanguage":"ja","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/tech.fuqinho.net\/?p=92#respond"]}]},{"@type":"WebPage","@id":"https:\/\/tech.fuqinho.net\/?p=92","url":"https:\/\/tech.fuqinho.net\/?p=92","name":"Google Code Jam Japan 2011 \u4e88\u9078 - Happy Coder","isPartOf":{"@id":"https:\/\/tech.fuqinho.net\/#website"},"datePublished":"2011-10-01T10:01:25+00:00","dateModified":"2011-10-01T10:01:25+00:00","breadcrumb":{"@id":"https:\/\/tech.fuqinho.net\/?p=92#breadcrumb"},"inLanguage":"ja","potentialAction":[{"@type":"ReadAction","target":["https:\/\/tech.fuqinho.net\/?p=92"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/tech.fuqinho.net\/?p=92#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u30db\u30fc\u30e0","item":"https:\/\/tech.fuqinho.net\/"},{"@type":"ListItem","position":2,"name":"Google Code Jam Japan 2011 \u4e88\u9078"}]},{"@type":"WebSite","@id":"https:\/\/tech.fuqinho.net\/#website","url":"https:\/\/tech.fuqinho.net\/","name":"Happy Coder","description":"","publisher":{"@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/tech.fuqinho.net\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"ja"},{"@type":["Person","Organization"],"@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/3f5c2a20c9acba8360c501cb7038a4e7","name":"fuqinho","image":{"@type":"ImageObject","inLanguage":"ja","@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/image\/","url":"https:\/\/tech.fuqinho.net\/wp-content\/uploads\/2023\/02\/hatena-block_400x400.png","contentUrl":"https:\/\/tech.fuqinho.net\/wp-content\/uploads\/2023\/02\/hatena-block_400x400.png","width":400,"height":400,"caption":"fuqinho"},"logo":{"@id":"https:\/\/tech.fuqinho.net\/#\/schema\/person\/image\/"},"sameAs":["http:\/\/tech.fuqinho.net"],"url":"https:\/\/tech.fuqinho.net\/?author=1"}]}},"_links":{"self":[{"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=\/wp\/v2\/posts\/92","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=92"}],"version-history":[{"count":0,"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=\/wp\/v2\/posts\/92\/revisions"}],"wp:attachment":[{"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=92"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=92"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/tech.fuqinho.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=92"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}