#516714 (C++17) No.1125 Without Parallelogram

提出ソース
結果

問題	No.1125 Without Parallelogram
コンテスト
ユーザー	NyaanNyaan
提出日時	2020-07-22 23:22:11
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	RE
実行時間	-
コード長	7,356 bytes
コンパイル時間	3,781 ms
コンパイル使用メモリ	206,200 KB
最終ジャッジ日時	2025-01-12 03:52:16
ジャッジサーバーID （参考情報）	judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	RE * 3
other	WA * 22 RE * 6
権限があれば一括ダウンロードができます
ソースコード

raw source code
#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define die(...)      \
  do {                \
    out(__VA_ARGS__); \
    return;           \
  } while (0)

using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
T ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}

void solve();
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}
template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}
template <typename T = int>
vector<T> mkinv(vector<T> &v) {
  vector<T> inv(v.size());
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}
struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;
#pragma endregion

constexpr int MOD = /** 998244353;  //*/ 1000000007;

void solve() {
  auto ispararell = [](P a, P b, P c, P d) {
    P x = {a.fi - b.fi, a.se - b.se};
    P y = {c.fi - d.fi, c.se - d.se};
    if (x == y) return true;
    x.fi *= -1, x.se *= -1;
    return x == y;
  };
  auto dame = [&](P a, P b, P c, P d) {
    if (ispararell(a, b, c, d)) return true;
    if (ispararell(a, c, b, d)) return true;
    if (ispararell(a, d, b, c)) return true;
    return false;
  };

  auto guchoku = [&](int M, int SZ) -> vp {
    mt19937_64 rng(58);
    vp v(M);
    trc(M, SZ);
    while (1) {
      rep(i, M) v[i] = {i, rng() % (SZ + 1)};
      int ok = 1;
      vi ord(M);
      rep(i, 4) ord[i] = 1;
      sort(all(ord));
      do {
        int a, b, c, d, i = 0;
        while (ord[i] != 1) i++;
        a = i++;
        while (ord[i] != 1) i++;
        b = i++;
        while (ord[i] != 1) i++;
        c = i++;
        while (ord[i] != 1) i++;
        d = i++;
        if (dame(v[a], v[b], v[c], v[d])) ok = 0;
      } while (ok and next_permutation(all(ord)));
      if (ok) break;
    }
    return v;
  };

  // SZ ... maxのやつ
  auto DandC = [&](auto rec, int SZ, int N) -> vp {
    // 奇偶で区切る
    trc(SZ, N);
    if (N <= 12) return guchoku(N, SZ);
    int NN = (N + 1) / 2;
    int SZN = SZ / 2;
    // ookiihou
    vp even = rec(rec, SZN, NN);
    vp ret;
    ret.reserve(N + 1);
    rep(i, NN) {
      if (i & 1) {
        ret.eb(i * 2, even[i].second + SZN);
        ret.eb(i * 2 + 1, even[i].second);
      } else {
        ret.eb(i * 2, even[i].second);
        ret.eb(i * 2 + 1, even[i].second + SZN);
      }
    }
    if (sz(ret) > N) ret.pop_back();
    return ret;
  };

  ini(N);
  if(N <= 12) exit(1);
  if (N < 3) {
    rep(i, N) out(i, i);
    return;
  }
  auto ans = DandC(DandC, N + 40, N);
  each(x, ans) out(x);
}
yukicoder

結果

ソースコード
