結果

問題 No.2644 Iro Iro-Iro
ユーザー tokusakuraitokusakurai
提出日時 2024-02-20 10:37:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 731 ms / 2,000 ms
コード長 7,353 bytes
コンパイル時間 4,058 ms
コンパイル使用メモリ 271,260 KB
実行使用メモリ 148,292 KB
最終ジャッジ日時 2024-09-29 03:26:29
合計ジャッジ時間 27,975 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 645 ms
148,152 KB
testcase_01 AC 630 ms
148,156 KB
testcase_02 AC 635 ms
148,028 KB
testcase_03 AC 640 ms
148,156 KB
testcase_04 AC 639 ms
148,156 KB
testcase_05 AC 646 ms
148,160 KB
testcase_06 AC 634 ms
148,032 KB
testcase_07 AC 640 ms
148,160 KB
testcase_08 AC 632 ms
148,156 KB
testcase_09 AC 637 ms
148,032 KB
testcase_10 AC 638 ms
148,028 KB
testcase_11 AC 632 ms
148,164 KB
testcase_12 AC 646 ms
148,028 KB
testcase_13 AC 683 ms
148,036 KB
testcase_14 AC 663 ms
148,288 KB
testcase_15 AC 665 ms
148,164 KB
testcase_16 AC 663 ms
148,036 KB
testcase_17 AC 669 ms
148,156 KB
testcase_18 AC 731 ms
148,160 KB
testcase_19 AC 660 ms
148,160 KB
testcase_20 AC 674 ms
148,160 KB
testcase_21 AC 676 ms
148,164 KB
testcase_22 AC 667 ms
148,156 KB
testcase_23 AC 688 ms
148,164 KB
testcase_24 AC 675 ms
148,292 KB
testcase_25 AC 672 ms
148,160 KB
testcase_26 AC 673 ms
148,036 KB
testcase_27 AC 666 ms
148,160 KB
testcase_28 AC 628 ms
148,156 KB
testcase_29 AC 670 ms
148,032 KB
testcase_30 AC 658 ms
148,164 KB
testcase_31 AC 653 ms
148,032 KB
testcase_32 AC 658 ms
148,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <typename T>
struct Fast_Fourier_Transform {
    using comp = complex<double>;
    static double pi;
    static vector<comp> r, ir;

    Fast_Fourier_Transform() {}

    static void init() {
        if (!r.empty()) return;
        r.resize(30), ir.resize(30);
        for (int i = 0; i < 30; i++) {
            r[i] = -polar(1.0, pi / (1 << (i + 1)));   // r[i] := 1 の 2^(i+2) 乗根
            ir[i] = -polar(1.0, -pi / (1 << (i + 1))); // ir[i] := 1/r[i]
        }
    }

    static vector<comp> to_comp(vector<T> a) {
        vector<comp> ret(a.size());
        for (int i = 0; i < (int)a.size(); i++) ret[i] = comp(a[i], 0.0);
        return ret;
    }

    static vector<T> to_T(vector<comp> a) {
        vector<T> ret(a.size(), 0);
        for (int i = 0; i < (int)a.size(); i++) ret[i] = a[i].real() + 0.1; // 整数の場合、誤差をケア
        // for(int i = 0; i < (int)a.size(); i++) ret[i] = a[i].real(); // 小数の場合
        return ret;
    }

    static void fft(vector<comp> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        for (int k = n; k >>= 1;) {
            comp w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    comp x = a[i], y = w * a[j];
                    a[i] = x + y, a[j] = x - y;
                }
                w *= r[__builtin_ctz(++t)];
            }
        }
    }

    static void ifft(vector<comp> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        a.resize(n);
        for (int k = 1; k < n; k <<= 1) {
            comp w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    comp x = a[i], y = a[j];
                    a[i] = x + y, a[j] = w * (x - y);
                }
                w *= ir[__builtin_ctz(++t)];
            }
        }
        for (auto &e : a) e /= n;
    }

    static vector<T> convolve(vector<T> a, vector<T> b) {
        int k = (int)a.size() + (int)b.size() - 1, n = 1;
        while (n < k) n <<= 1;
        vector<comp> A = to_comp(a), B = to_comp(b);
        A.resize(n), B.resize(n);
        fft(A), fft(B);
        for (int i = 0; i < n; i++) A[i] *= B[i];
        ifft(A);
        vector<T> c = to_T(A);
        c.resize(k);
        return c;
    }
};

template <typename T>
double Fast_Fourier_Transform<T>::pi = acos(-1.0);

template <typename T>
vector<complex<double>> Fast_Fourier_Transform<T>::r = vector<complex<double>>();

template <typename T>
vector<complex<double>> Fast_Fourier_Transform<T>::ir = vector<complex<double>>();

using FFT = Fast_Fourier_Transform<int>;

#include <atcoder/all>

void solve() {
    int N, M;
    cin >> N >> M;

    int D = 201;

    auto get_1 = [&](int a, int b, int c) {
        return D * D * c + D * b + a; //
    };

    auto get_2 = [&](int a, int b, int c) {
        return get_1(100 - a, 100 - b, 100 - c); //
    };

    int MAX = D * D * 100 + D * 100 + 100;

    vector<int> f(MAX + 1, 0), g(MAX + 1, 0);
    rep(i, N) {
        int a, b, c;
        cin >> a >> b >> c;
        f[get_1(a, b, c)]++;
        g[get_2(a, b, c)]++;
    }

    f = atcoder::convolution(f, g);

    int ans = 0;

    rep(i, M) {
        int a, b, c;
        cin >> a >> b >> c;
        chmax(ans, N + N - f[get_1(100 + a, 100 + b, 100 + c)]);
    }

    cout << ans << '\n';
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0