#705567 (C++17) No.1703 Much Matching

提出ソース

結果

問題	No.1703 Much Matching
ユーザー	rniya
提出日時	2021-10-08 22:14:48
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	268 ms / 2,000 ms
コード長	8,364 bytes
コンパイル時間	2,189 ms
コンパイル使用メモリ	211,044 KB
実行使用メモリ	7,680 KB
最終ジャッジ日時	2024-07-23 04:42:26
合計ジャッジ時間	5,050 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	74 ms 6,944 KB
testcase_07	AC	5 ms 6,940 KB
testcase_08	AC	77 ms 6,944 KB
testcase_09	AC	86 ms 6,944 KB
testcase_10	AC	13 ms 6,944 KB
testcase_11	AC	19 ms 6,940 KB
testcase_12	AC	5 ms 6,940 KB
testcase_13	AC	34 ms 6,944 KB
testcase_14	AC	3 ms 6,940 KB
testcase_15	AC	16 ms 6,944 KB
testcase_16	AC	48 ms 6,940 KB
testcase_17	AC	52 ms 6,940 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	119 ms 6,944 KB
testcase_20	AC	15 ms 6,940 KB
testcase_21	AC	138 ms 7,552 KB
testcase_22	AC	54 ms 6,940 KB
testcase_23	AC	39 ms 6,940 KB
testcase_24	AC	3 ms 6,940 KB
testcase_25	AC	6 ms 6,940 KB
testcase_26	AC	27 ms 6,944 KB
testcase_27	AC	55 ms 6,940 KB
testcase_28	AC	112 ms 6,940 KB
testcase_29	AC	21 ms 6,944 KB
testcase_30	AC	32 ms 6,944 KB
testcase_31	AC	4 ms 6,940 KB
testcase_32	AC	61 ms 6,940 KB
testcase_33	AC	39 ms 6,940 KB
testcase_34	AC	5 ms 6,944 KB
testcase_35	AC	11 ms 6,940 KB
testcase_36	AC	268 ms 7,680 KB
testcase_37	AC	2 ms 6,944 KB

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

ソースコード

raw source code

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
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> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

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

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

#include <cassert>
#include <vector>

template <typename Monoid, typename F> struct SegmentTree {
    SegmentTree(int n, const F f, const Monoid& e) : n(n), f(f), e(e) {
        size = 1;
        while (size < n) size <<= 1;
        data.assign(size << 1, e);
    }

    void set(int k, Monoid x) {
        assert(0 <= k && k < n);
        data[k + size] = x;
    }

    void build() {
        for (int k = size - 1; k > 0; k--) {
            data[k] = f(data[k << 1 | 0], data[k << 1 | 1]);
        }
    }

    void update(int k, Monoid x) {
        assert(0 <= k && k < n);
        k += size;
        data[k] = x;
        while (k >>= 1) data[k] = f(data[k << 1 | 0], data[k << 1 | 1]);
    }

    void add(int k, Monoid x) {
        assert(0 <= k && k < n);
        k += size;
        data[k] += x;
        while (k >>= 1) data[k] = f(data[k << 1 | 0], data[k << 1 | 1]);
    }

    Monoid query(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        Monoid L = e, R = e;
        for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = f(L, data[l++]);
            if (r & 1) R = f(data[--r], R);
        }
        return f(L, R);
    }

    Monoid all_prod() const { return data[1]; }

    Monoid operator[](const int& k) const { return data[k + size]; }

    template <typename C> int find_first(int l, const C& check) {
        assert(0 <= l && l <= n);
        assert(!check(e));
        if (l == n) return n;
        Monoid L = e;
        if (l == 0) {
            if (check(f(L, data[1]))) return find_subtree(1, check, L, false);
            return n;
        }
        int r = size;
        for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
            if (l & 1) {
                Monoid nxt = f(L, data[l]);
                if (check(nxt)) return find_subtree(l, check, L, false);
                L = nxt;
                l++;
            }
        }
        return n;
    }

    template <typename C> int find_last(int r, const C& check) {
        assert(0 <= r && r <= n);
        assert(!check(e));
        if (r == 0) return 0;
        Monoid R = e;
        if (r == n) {
            if (check(f(data[1], R))) return find_subtree(1, check, R, true);
            return -1;
        }
        int l = size;
        for (r += size; l < r; l >>= 1, r >>= 1) {
            if (r & 1) {
                Monoid nxt = f(data[--r], R);
                if (check(nxt)) return find_subtree(r, check, R, false);
                R = nxt;
            }
        }
        return -1;
    }

private:
    int n, size;
    std::vector<Monoid> data;
    const F f;
    const Monoid e;

    template <typename C> int find_subtree(int a, const C& check, Monoid& M, bool type) {
        while (a < size) {
            Monoid nxt = type ? f(data[a << 1 | type], M) : f(M, data[a << 1 | type]);
            if (check(nxt))
                a = a << 1 | type;
            else
                M = nxt, a = (a << 1 | 1) - type;
        }
        return a - size;
    }
};

/**
 * @brief Segment Tree
 * @docs docs/datastructure/SegmentTree.md
 */

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M, Q;
    cin >> N >> M >> Q;
    vector<vector<int>> right(N);
    for (; Q--;) {
        int a, b;
        cin >> a >> b;
        right[--a].emplace_back(--b);
    }

    auto f = [](int a, int b) { return max(a, b); };
    SegmentTree<int, decltype(f)> seg(M, f, 0);
    for (int i = 0; i < N; i++) {
        sort(right[i].rbegin(), right[i].rend());
        for (int& r : right[i]) {
            int val = seg.query(0, r);
            seg.update(r, max(seg[r], val + 1));
        }
    }

    int ans = seg.all_prod();
    cout << ans << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード