<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>mayokoex</author_name>
  <author_url>https://blog.hatena.ne.jp/mayokoex/</author_url>
  <blog_title>mayoko’s diary</blog_title>
  <blog_url>https://mayokoex.hatenablog.com/</blog_url>
  <categories>
    <anon>yukicoder</anon>
  </categories>
  <description>問題 No.282 おもりと天秤(2) - yukicoder 解法 奇偶転置ソートというアルゴリズムを利用します。 奇偶転置ソート - Wikipedia bool cmp[505][505]; int C[505]; bool comp(int a, int b) {return cmp[a][b];} int main() { int N; cin &gt;&gt; N; vector&lt;int&gt; ans(N); for (int i = 0; i &lt; N; i++) ans[i] = i; for (int t = 0; t &lt; 2*N; t++) { cout &lt;&lt; &quot;? &quot;; if (t%2==…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmayokoex.hatenablog.com%2Fentry%2F2015%2F09%2F23%2F103529&quot; title=&quot;yukicoder No.282 おもりと天秤(2) - mayoko’s diary&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>2015-09-23 10:35:29</published>
  <title>yukicoder No.282 おもりと天秤(2)</title>
  <type>rich</type>
  <url>https://mayokoex.hatenablog.com/entry/2015/09/23/103529</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
