結果
| 問題 | No.1703 Much Matching |
| ユーザー |
 haruki_K
|
| 提出日時 | 2021-10-08 22:31:11 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 219 ms / 2,000 ms |
| コード長 | 5,716 bytes |
| コンパイル時間 | 2,434 ms |
| コンパイル使用メモリ | 208,280 KB |
| 実行使用メモリ | 18,944 KB |
| 最終ジャッジ日時 | 2024-07-23 05:27:23 |
| 合計ジャッジ時間 | 5,238 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,940 KB |
| testcase_02 | AC | 2 ms
6,940 KB |
| testcase_03 | AC | 6 ms
7,424 KB |
| testcase_04 | AC | 5 ms
6,944 KB |
| testcase_05 | AC | 10 ms
11,776 KB |
| testcase_06 | AC | 53 ms
9,344 KB |
| testcase_07 | AC | 4 ms
6,944 KB |
| testcase_08 | AC | 69 ms
14,720 KB |
| testcase_09 | AC | 71 ms
11,648 KB |
| testcase_10 | AC | 11 ms
6,940 KB |
| testcase_11 | AC | 19 ms
9,088 KB |
| testcase_12 | AC | 5 ms
6,948 KB |
| testcase_13 | AC | 28 ms
7,680 KB |
| testcase_14 | AC | 3 ms
6,940 KB |
| testcase_15 | AC | 22 ms
12,672 KB |
| testcase_16 | AC | 30 ms
6,940 KB |
| testcase_17 | AC | 35 ms
7,296 KB |
| testcase_18 | AC | 2 ms
6,940 KB |
| testcase_19 | AC | 81 ms
10,496 KB |
| testcase_20 | AC | 9 ms
6,944 KB |
| testcase_21 | AC | 105 ms
12,288 KB |
| testcase_22 | AC | 49 ms
13,184 KB |
| testcase_23 | AC | 32 ms
8,320 KB |
| testcase_24 | AC | 3 ms
6,940 KB |
| testcase_25 | AC | 8 ms
6,944 KB |
| testcase_26 | AC | 29 ms
13,056 KB |
| testcase_27 | AC | 39 ms
7,552 KB |
| testcase_28 | AC | 102 ms
16,512 KB |
| testcase_29 | AC | 21 ms
9,984 KB |
| testcase_30 | AC | 29 ms
9,472 KB |
| testcase_31 | AC | 6 ms
6,940 KB |
| testcase_32 | AC | 57 ms
11,392 KB |
| testcase_33 | AC | 43 ms
13,824 KB |
| testcase_34 | AC | 4 ms
6,944 KB |
| testcase_35 | AC | 11 ms
6,948 KB |
| testcase_36 | AC | 219 ms
18,944 KB |
| testcase_37 | AC | 18 ms
18,816 KB |
ソースコード
// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d-1>::type>;
template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
// <<<
int32_t main() {
int n, m, q; cin >> n >> m >> q;
auto ok = make_v<int, 2>(n, m);
rep (_, q) {
int a, b; cin >> a >> b; --a, --b;
ok[a][b] = true;
}
auto dp = make_v<int, 2>(n+1, m+1, -INF);
dp[0][0] = 0;
rep (i, n+1) rep (j, m+1) {
if (i+1 < n+1) chmax(dp[i+1][j], dp[i][j]);
if (j+1 < m+1) chmax(dp[i][j+1], dp[i][j]);
if (i < n and j < m and ok[i][j]) chmax(dp[i+1][j+1], dp[i][j] + 1);
}
cout << dp[n][m] << '\n';
}