{"id":8249,"date":"2022-10-20T23:00:00","date_gmt":"2022-10-20T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=8249"},"modified":"2022-11-26T18:05:47","modified_gmt":"2022-11-26T12:35:47","slug":"gridland-metro-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/gridland-metro-hackerrank-solution\/","title":{"rendered":"Gridland Metro &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Gridland Metro HackerRank Solution<\/strong>. This problem <strong>(Gridland Metro)<\/strong> is a part of <strong>HackerRank Problem Solving<\/strong> series.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662ed42cd6839\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662ed42cd6839\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/gridland-metro-hackerrank-solution\/#Solution_%E2%80%93_Gridland_Metro_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Gridland Metro &#8211; HackerRank Solution\">Solution &#8211; Gridland Metro &#8211; HackerRank Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/gridland-metro-hackerrank-solution\/#C\" title=\"C++\">C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/gridland-metro-hackerrank-solution\/#Python\" title=\"Python\">Python<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/gridland-metro-hackerrank-solution\/#Java\" title=\"Java\">Java<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Gridland_Metro_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Gridland Metro &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">#include &lt;iostream>\n#include &lt;set>\n#include &lt;map>\n#include&lt;vector>\n#include &lt;algorithm>\n\nusing namespace std;\n\nint row, col, k;\nmap&lt;int, vector&lt;pair&lt;int, int>>> in;\n\n\nlong long len(vector&lt;pair&lt;int, int>> &amp; v) {\n    sort(v.begin(), v.end());\n    auto it = v.begin();\n\n    int a = it->first;\n    int b = it->second;\n    long long r = 0;\n    it++;\n\n    for (; it != v.end(); it++) {\n        if (it->first &lt;= b) {\n            b = max(b, it->second);\n        }\n        else {\n            r += (b - a + 1);\n            a = it->first;\n            b = it->second;\n        }\n    }\n    r += (b - a + 1);\n\n    return r;\n}\n\nint main() {\n    cin >> row >> col >> k;\n    while (k--) {\n        int r, a, b; cin >> r >> a >> b;\n        in[r].push_back(make_pair(a, b));\n    }\n\n    long long res = (long long)row * col;\n\n    for (auto &amp;it : in) {\n        res -= len(it.second);\n    }\n    cout &lt;&lt; res &lt;&lt; endl;\n    return 0;\n}<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Python\"><\/span><strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">from collections import defaultdict\n\nn, m, k = map(int, input().split())\n\ntracks = defaultdict(list)\nfor _ in range(k):\n    row, c1, c2 = map(int, input().split())\n    tracks[row].append((c1, -1))\n    tracks[row].append((c2 + 1, 1))\n    \nans = 0\nfor row in tracks:\n    tracks[row].sort()\n\n    prev = tracks[row][0][0]\n    depth = 1\n    for event in tracks[row][1:]:\n        if depth > 0:\n            ans += (event[0] - prev)\n\n        depth -= event[1]\n        prev = event[0]\n        \nprint(n * m - ans)\n       <\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Java\"><\/span><strong>Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.*;\nimport java.awt.*;\n\npublic class Solution {\n    ArrayList&lt;Point> locs;\n    \n    public Solution(){\n        locs = new ArrayList&lt;>();\n    }\n    \n    public static void main(String[] args) {\n        Scanner in = new Scanner(System.in);\n        long rows = in.nextInt(), cols = in.nextInt();\n        int tracks = in.nextInt();\n        ArrayList&lt;Integer> check = new ArrayList&lt;>();\n        HashMap&lt;Integer, Solution> found = new HashMap&lt;>();\n        \n        for(int i = 0; i&lt;tracks; i++){\n            int curRow = in.nextInt(), start = in.nextInt(), end = in.nextInt();\n            if(!found.containsKey(curRow)){\n                Solution sol = new Solution();\n                sol.locs.add(new Point(start,end));\n                check.add(curRow);\n                found.put(curRow,sol);\n            }else{\n                Solution sol = found.get(curRow);\n                sol.locs.add(new Point(start, end));\n            }\n        }\n        \n        \/\/Computing the total # of tracks - those of train tracks\n        long total = rows * cols;\n        for(int r : check){\n          \/\/  System.out.println(r);\n            Solution sol = found.get(r);\n            ArrayList&lt;Point> myPoints = sol.locs;\n            Collections.sort(myPoints, new myComparator());\n            Point first = myPoints.get(0);\n            total -= (first.y - first.x+1);\n            int lastEnd = first.y+1;\n            for(int i = 1; i&lt;myPoints.size(); i++){\n                Point curPoint = myPoints.get(i);\n                if(curPoint.y&lt; lastEnd) continue;\n                int begin = Math.max(curPoint.x, lastEnd);\n                total -=(curPoint.y - begin + 1);\n                lastEnd = curPoint.y+1;\n            }\n        }\n        \n        System.out.println(total);        \n    }\n}\nclass myComparator implements Comparator&lt;Point>{\n    public int compare(Point p1, Point p2){\n        return p1.x - p2.x;\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/gridland-metro\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Gridland Metro<\/a>)<\/strong> is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">HackerRank<\/a><\/strong> but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve Gridland Metro HackerRank Solution. This problem (Gridland Metro) is a part of HackerRank Problem Solving series.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[9,190],"tags":[191],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8249"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=8249"}],"version-history":[{"count":5,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8249\/revisions"}],"predecessor-version":[{"id":8339,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/8249\/revisions\/8339"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=8249"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=8249"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=8249"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}