#411329 (C++14) No.960 マンハッタン距離3

提出ソース

結果

問題	No.960 マンハッタン距離3
ユーザー	risujiroh
提出日時	2019-12-23 03:11:42
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	69 ms / 2,000 ms
コード長	6,066 bytes
コンパイル時間	1,938 ms
コンパイル使用メモリ	175,244 KB
実行使用メモリ	11,144 KB
最終ジャッジ日時	2023-10-13 04:10:13
合計ジャッジ時間	12,324 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,356 KB
testcase_01	AC	1 ms 4,348 KB
testcase_02	AC	1 ms 4,348 KB
testcase_03	AC	2 ms 4,352 KB
testcase_04	AC	2 ms 4,356 KB
testcase_05	AC	2 ms 4,348 KB
testcase_06	AC	2 ms 4,352 KB
testcase_07	AC	1 ms 4,352 KB
testcase_08	AC	1 ms 4,352 KB
testcase_09	AC	2 ms 4,352 KB
testcase_10	AC	2 ms 4,352 KB
testcase_11	AC	1 ms 4,352 KB
testcase_12	AC	1 ms 4,352 KB
testcase_13	AC	2 ms 4,372 KB
testcase_14	AC	1 ms 4,352 KB
testcase_15	AC	1 ms 4,352 KB
testcase_16	AC	1 ms 4,352 KB
testcase_17	AC	2 ms 4,352 KB
testcase_18	AC	1 ms 4,352 KB
testcase_19	AC	1 ms 4,348 KB
testcase_20	AC	2 ms 4,348 KB
testcase_21	AC	1 ms 4,348 KB
testcase_22	AC	2 ms 4,348 KB
testcase_23	AC	1 ms 4,348 KB
testcase_24	AC	1 ms 4,352 KB
testcase_25	AC	1 ms 4,352 KB
testcase_26	AC	2 ms 4,348 KB
testcase_27	AC	2 ms 4,348 KB
testcase_28	AC	2 ms 4,348 KB
testcase_29	AC	1 ms 4,348 KB
testcase_30	AC	2 ms 4,348 KB
testcase_31	AC	2 ms 4,352 KB
testcase_32	AC	2 ms 4,348 KB
testcase_33	AC	1 ms 4,352 KB
testcase_34	AC	2 ms 4,352 KB
testcase_35	AC	2 ms 4,352 KB
testcase_36	AC	1 ms 4,348 KB
testcase_37	AC	2 ms 4,352 KB
testcase_38	AC	2 ms 4,352 KB
testcase_39	AC	2 ms 4,348 KB
testcase_40	AC	2 ms 4,348 KB
testcase_41	AC	2 ms 4,348 KB
testcase_42	AC	1 ms 4,352 KB
testcase_43	AC	2 ms 4,352 KB
testcase_44	AC	1 ms 4,348 KB
testcase_45	AC	2 ms 4,348 KB
testcase_46	AC	1 ms 4,352 KB
testcase_47	AC	2 ms 4,348 KB
testcase_48	AC	2 ms 4,348 KB
testcase_49	AC	1 ms 4,352 KB
testcase_50	AC	2 ms 4,352 KB
testcase_51	AC	2 ms 4,356 KB
testcase_52	AC	2 ms 4,352 KB
testcase_53	AC	2 ms 4,352 KB
testcase_54	AC	1 ms 4,352 KB
testcase_55	AC	2 ms 4,348 KB
testcase_56	AC	1 ms 4,356 KB
testcase_57	AC	2 ms 4,368 KB
testcase_58	AC	1 ms 4,352 KB
testcase_59	AC	2 ms 4,348 KB
testcase_60	AC	1 ms 4,356 KB
testcase_61	AC	2 ms 4,352 KB
testcase_62	AC	1 ms 4,352 KB
testcase_63	AC	1 ms 4,348 KB
testcase_64	AC	1 ms 4,352 KB
testcase_65	AC	2 ms 4,356 KB
testcase_66	AC	1 ms 4,352 KB
testcase_67	AC	1 ms 4,352 KB
testcase_68	AC	1 ms 4,348 KB
testcase_69	AC	2 ms 4,348 KB
testcase_70	AC	1 ms 4,356 KB
testcase_71	AC	2 ms 4,352 KB
testcase_72	AC	2 ms 4,348 KB
testcase_73	AC	1 ms 4,348 KB
testcase_74	AC	1 ms 4,352 KB
testcase_75	AC	1 ms 4,356 KB
testcase_76	AC	2 ms 4,348 KB
testcase_77	AC	2 ms 4,352 KB
testcase_78	AC	1 ms 4,348 KB
testcase_79	AC	1 ms 4,352 KB
testcase_80	AC	2 ms 4,348 KB
testcase_81	AC	2 ms 4,348 KB
testcase_82	AC	2 ms 4,352 KB
testcase_83	AC	2 ms 4,352 KB
testcase_84	AC	2 ms 4,348 KB
testcase_85	AC	2 ms 4,352 KB
testcase_86	AC	2 ms 4,352 KB
testcase_87	AC	1 ms 4,348 KB
testcase_88	AC	1 ms 4,376 KB
testcase_89	AC	1 ms 4,348 KB
testcase_90	AC	2 ms 4,352 KB
testcase_91	AC	1 ms 4,352 KB
testcase_92	AC	2 ms 4,352 KB
testcase_93	AC	2 ms 4,356 KB
testcase_94	AC	2 ms 4,352 KB
testcase_95	AC	1 ms 4,352 KB
testcase_96	AC	2 ms 4,352 KB
testcase_97	AC	1 ms 4,356 KB
testcase_98	AC	1 ms 4,352 KB
testcase_99	AC	2 ms 4,356 KB
testcase_100	AC	2 ms 4,352 KB
testcase_101	AC	1 ms 4,352 KB
testcase_102	AC	2 ms 4,352 KB
testcase_103	AC	1 ms 4,348 KB
testcase_104	AC	2 ms 4,352 KB
testcase_105	AC	2 ms 4,352 KB
testcase_106	AC	1 ms 4,352 KB
testcase_107	AC	1 ms 4,352 KB
testcase_108	AC	2 ms 4,352 KB
testcase_109	AC	2 ms 4,352 KB
testcase_110	AC	2 ms 4,372 KB
testcase_111	AC	2 ms 4,348 KB
testcase_112	AC	2 ms 4,348 KB
testcase_113	AC	1 ms 4,348 KB
testcase_114	AC	2 ms 4,352 KB
testcase_115	AC	2 ms 4,352 KB
testcase_116	AC	2 ms 4,352 KB
testcase_117	AC	1 ms 4,352 KB
testcase_118	AC	1 ms 4,352 KB
testcase_119	AC	2 ms 4,352 KB
testcase_120	AC	1 ms 4,352 KB
testcase_121	AC	1 ms 4,352 KB
testcase_122	AC	1 ms 4,352 KB
testcase_123	AC	1 ms 4,352 KB
testcase_124	AC	1 ms 4,356 KB
testcase_125	AC	2 ms 4,352 KB
testcase_126	AC	2 ms 4,348 KB
testcase_127	AC	2 ms 4,348 KB
testcase_128	AC	15 ms 5,208 KB
testcase_129	AC	44 ms 8,768 KB
testcase_130	AC	30 ms 7,052 KB
testcase_131	AC	56 ms 10,204 KB
testcase_132	AC	63 ms 10,124 KB
testcase_133	AC	2 ms 4,348 KB
testcase_134	AC	3 ms 4,352 KB
testcase_135	AC	18 ms 5,476 KB
testcase_136	AC	17 ms 5,308 KB
testcase_137	AC	2 ms 4,576 KB
testcase_138	AC	37 ms 7,908 KB
testcase_139	AC	47 ms 8,580 KB
testcase_140	AC	4 ms 6,244 KB
testcase_141	AC	61 ms 10,148 KB
testcase_142	AC	24 ms 6,256 KB
testcase_143	AC	3 ms 4,844 KB
testcase_144	AC	53 ms 9,596 KB
testcase_145	AC	5 ms 4,356 KB
testcase_146	AC	12 ms 4,680 KB
testcase_147	AC	41 ms 8,040 KB
testcase_148	AC	22 ms 5,624 KB
testcase_149	AC	35 ms 7,264 KB
testcase_150	AC	53 ms 9,056 KB
testcase_151	AC	4 ms 4,348 KB
testcase_152	AC	4 ms 5,096 KB
testcase_153	AC	4 ms 6,160 KB
testcase_154	AC	3 ms 4,348 KB
testcase_155	AC	44 ms 8,572 KB
testcase_156	AC	14 ms 4,936 KB
testcase_157	AC	48 ms 8,632 KB
testcase_158	AC	62 ms 10,492 KB
testcase_159	AC	8 ms 4,524 KB
testcase_160	AC	4 ms 4,352 KB
testcase_161	AC	51 ms 9,432 KB
testcase_162	AC	4 ms 5,608 KB
testcase_163	AC	3 ms 4,736 KB
testcase_164	AC	61 ms 10,432 KB
testcase_165	AC	45 ms 8,792 KB
testcase_166	AC	8 ms 4,436 KB
testcase_167	AC	28 ms 6,644 KB
testcase_168	AC	18 ms 5,516 KB
testcase_169	AC	20 ms 5,628 KB
testcase_170	AC	16 ms 5,100 KB
testcase_171	AC	28 ms 6,652 KB
testcase_172	AC	22 ms 5,896 KB
testcase_173	AC	5 ms 4,348 KB
testcase_174	AC	53 ms 9,308 KB
testcase_175	AC	69 ms 11,144 KB
testcase_176	AC	41 ms 8,376 KB
testcase_177	AC	6 ms 4,348 KB
testcase_178	AC	46 ms 8,528 KB
testcase_179	AC	48 ms 8,840 KB
testcase_180	AC	4 ms 6,084 KB
testcase_181	AC	3 ms 4,348 KB
testcase_182	AC	2 ms 4,420 KB
testcase_183	AC	3 ms 4,952 KB
testcase_184	AC	2 ms 4,376 KB
testcase_185	AC	4 ms 5,092 KB
testcase_186	AC	3 ms 5,592 KB
testcase_187	AC	3 ms 4,888 KB
testcase_188	AC	1 ms 4,372 KB
testcase_189	AC	2 ms 4,352 KB
testcase_190	AC	2 ms 4,348 KB
testcase_191	AC	2 ms 4,372 KB
testcase_192	AC	2 ms 4,352 KB
testcase_193	AC	2 ms 4,352 KB
testcase_194	AC	1 ms 4,352 KB
testcase_195	AC	2 ms 4,352 KB
testcase_196	AC	36 ms 7,832 KB
testcase_197	AC	10 ms 4,628 KB
testcase_198	AC	26 ms 6,400 KB
testcase_199	AC	41 ms 8,252 KB
testcase_200	AC	9 ms 5,360 KB
testcase_201	AC	7 ms 4,348 KB
testcase_202	AC	46 ms 8,980 KB
testcase_203	AC	23 ms 6,208 KB
testcase_204	AC	62 ms 10,432 KB
testcase_205	AC	26 ms 6,504 KB
testcase_206	AC	4 ms 5,940 KB
testcase_207	AC	13 ms 5,096 KB
testcase_208	AC	43 ms 8,252 KB
testcase_209	AC	13 ms 4,756 KB
testcase_210	AC	6 ms 4,348 KB
testcase_211	AC	18 ms 5,488 KB
testcase_212	AC	3 ms 4,348 KB
testcase_213	AC	10 ms 4,500 KB
testcase_214	AC	63 ms 10,760 KB
testcase_215	AC	48 ms 9,168 KB
testcase_216	AC	64 ms 10,232 KB
testcase_217	AC	31 ms 6,932 KB
testcase_218	AC	8 ms 5,876 KB
testcase_219	AC	3 ms 4,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  auto ab2xy = [](long long a, long long b) {
    return make_pair((a + b) / 2, (b - a) / 2);
  };
  long long w, h;
  cin >> w >> h;
  int n;
  cin >> n;
  vector<long long> x(n), y(n), a(n), b(n);
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    --x[i], --y[i];
    a[i] = x[i] - y[i];
    b[i] = x[i] + y[i];
    if ((a[i] - a[0]) & 1) {
      cout << "0\n";
      return 0;
    }
  }
  if (n == 2) {
    if (x[0] > x[1]) {
      swap(x[0], x[1]);
      swap(y[0], y[1]);
    }
    if (y[0] > y[1]) {
      y[0] = h - y[0] - 1;
      y[1] = h - y[1] - 1;
    }
    long long res = 0;
    if (x[0] - y[0] == x[1] - y[1]) {
      res += x[1] - x[0] - 1;
      res += (w - x[1]) * (y[0] + 1);
      res += (x[0] + 1) * (h - y[1]);
    } else {
      if (x[1] - x[0] < y[1] - y[0]) {
        swap(w, h);
        swap(x[0], y[0]);
        swap(x[1], y[1]);
      }
      res += y[1] - y[0] - 1;
      res += y[0] + 1;
      res += h - y[1];
    }
    cout << res << '\n';
    return 0;
  }
  set<long long> sa(begin(a), end(a));
  set<long long> sb(begin(b), end(b));
  long long min_x = *min_element(begin(x), end(x));
  long long max_x = *max_element(begin(x), end(x));
  long long min_y = *min_element(begin(y), end(y));
  long long max_y = *max_element(begin(y), end(y));
  long long min_a = *begin(sa), max_a = *rbegin(sa);
  long long min_b = *begin(sb), max_b = *rbegin(sb);
  long long res = 0, add = 0;
  if (sa.size() == 1 or sb.size() == 1) {
    if (sa.size() == 1) {
      res += (w - max_x) * (min_y + 1);
      res += (min_x + 1) * (h - max_y);
    } else {
      res += (w - max_x) * (h - max_y);
      res += (min_x + 1) * (min_y + 1);
    }
  } else {
    for (int S = 0; S < 1 << 4; ++S) {
      bool ok = true;
      for (int i = 0; i < n; ++i) {
        if (a[i] == min_a and S >> 0 & 1) continue;
        if (a[i] == max_a and S >> 1 & 1) continue;
        if (b[i] == min_b and S >> 2 & 1) continue;
        if (b[i] == max_b and S >> 3 & 1) continue;
        ok = false;
        break;
      }
      if (ok) {
        int cnt = __builtin_popcount(S);
        if (cnt == 4) {
          res = max<long long>(res, max_a - min_a == max_b - min_b);
        } else if (cnt == 3) {
          if ((S & 3) != 3) {
            res = max<long long>(res, max_a - min_a <= max_b - min_b);
          } else {
            res = max<long long>(res, max_b - min_b <= max_a - min_a);
          }
        } else {
          assert(cnt == 2);
          long long da = max_a - min_a;
          assert(~da & 1);
          da /= 2;
          long long db = max_b - min_b;
          assert(~db & 1);
          db /= 2;
          long long len = max(da, db);
          if (S == 3) {
            // res = max<long long>(res, max(da - db + 1, 0LL));
            add += max(da - db, 0LL);
          } else if (S == 12) {
            // res = max<long long>(res, max(db - da + 1, 0LL));
            add += max(db - da, 0LL);
          } else if (S == 5) {
            res = max<long long>(res, w - ab2xy(min_a + len, min_b + len).first);
          } else if (S == 6) {
            res = max<long long>(res, h - ab2xy(max_a - len, min_b + len).second);
          } else if (S == 9) {
            res = max<long long>(res, ab2xy(min_a + len, max_b - len).second + 1);
          } else {
            res = max<long long>(res, ab2xy(max_a - len, max_b - len).first + 1);
          }
        }
        // cerr << S << ' ' << res << '\n';
      }
    }
  }
  res += add;
  cout << res << '\n';

  /*else if (sa.size() == 2 or sb.size() == 2) {
    assert(false);
    long long da = max_a - min_a;
    assert(~da & 1);
    da /= 2;
    long long db = max_b - min_b;
    assert(~db & 1);
    db /= 2;
    long long len = max(da, db);
    if (sa.size() == 2) {
      int cmin_a = count(begin(a), end(a), min_a);
      int cmax_a = count(begin(a), end(a), max_a);
      long long min_ab = b[min_element(begin(a), end(a)) - begin(a)];
      long long max_ab = b[max_element(begin(a), end(a)) - begin(a)];
      if (cmin_a == 1 and min_ab == min_b) {
        res += max(h - ab2xy(max_a - len, min_b + len).second, 0LL);
      } else if (cmin_a == 1 and min_ab == max_b) {
        res += min(ab2xy(max_a - len, max_b - len).first + 1, w);
      } else if (cmax_a == 1 and max_ab == min_b) {
        res += max(w - ab2xy(min_a + len, min_b + len).first, 0LL);
      } else if (cmax_a == 1 and max_ab == max_b) {
        res += min(ab2xy(min_a + len, max_b - len).second + 1, h);
      } else {
        res += max(da - db + 1, 0LL);
      }
    } else {
      int cmin_b = count(begin(b), end(b), min_b);
      int cmax_b = count(begin(b), end(b), max_b);
      long long min_ba = a[min_element(begin(b), end(b)) - begin(b)];
      long long max_ba = a[max_element(begin(b), end(b)) - begin(b)];
      if (cmin_b == 1 and min_ba == min_a) {
        res += min(ab2xy(min_a + len, max_b - len).second + 1, h);
      } else if (cmin_b == 1 and min_ba == max_a) {
        res += min(ab2xy(max_a - len, max_b - len).first + 1, w);
      } else if (cmax_b == 1 and max_ba == min_a) {
        res += max(w - ab2xy(min_a + len, min_b + len).first, 0LL);
      } else if (cmax_b == 1 and max_ba == max_a) {
        res += max(h - ab2xy(max_a - len, min_b + len).second, 0LL);
      } else {
        res += max(db - da + 1, 0LL);
      }
    }
  } else {
    for (int i = 0; i < n; ++i) {
      if (a[i] != min_a and a[i] != max_a and
          b[i] != min_b and b[i] != max_b) {
        cout << "0\n";
        return 0;
      }
    }
    set<long long> ta, tb;
    for (int i = 0; i < n; ++i) {
      if (a[i] != min_a and a[i] != max_a) {
        tb.insert(b[i]);
      }
      if (b[i] != min_b and b[i] != max_b) {
        ta.insert(a[i]);
      }
    }
    if (ta.size() == 2 and tb.size() == 2) {
      if (max_a - min_a != max_b - min_b) {
        res = 0;
      }
    } else if (ta.size() == 1 and tb.size() == 1) {

    }
    res = 1;
  }
  cout << res << '\n';*/
}

yukicoder

結果

テストケース

ソースコード