<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>moistx</author_name>
  <author_url>https://blog.hatena.ne.jp/moistx/</author_url>
  <blog_title>Logfiles</blog_title>
  <blog_url>https://logfiles.hatenablog.com/</blog_url>
  <categories>
    <anon>UVa</anon>
  </categories>
  <description>解法 計算量が3*10^9くらいになるので嘘解法かもしれないが、いもす法で解いた。 #include &lt;bits/stdc++.h&gt; using namespace std; #define MAX (1000000) int main() { int N, M; while(cin &gt;&gt; N &gt;&gt; M &amp;&amp; (N|M)) { int arr[MAX+1] = {}; for(int i=0; i&lt;N; i++) { int s, t; cin &gt;&gt; s &gt;&gt; t; arr[s] ++; arr[t] --; } for(int i=0; i&lt;M; i++) { int s, t; cin &gt;…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140809%2F1407578739&quot; title=&quot;UVa11926 Multitasking - Logfiles&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2014-08-09 19:05:39</published>
  <title>UVa11926 Multitasking</title>
  <type>rich</type>
  <url>https://logfiles.hatenablog.com/entry/20140809/1407578739</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
