結果
問題 | No.1703 Much Matching |
ユーザー |
![]() |
提出日時 | 2023-10-19 11:30:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 199 ms / 2,000 ms |
コード長 | 3,206 bytes |
コンパイル時間 | 1,164 ms |
コンパイル使用メモリ | 127,284 KB |
最終ジャッジ日時 | 2025-02-17 08:21:11 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};using mint = modint<998244353>;//using mint = modint<1000000007>;int N,M,Q;vector<int> G[1000];int dp[2][1001];void solve(){cin >> N >> M >> Q;for(int i = 0;i < Q;i++){int a,b;cin >> a >> b;a--;G[a].push_back(b);}int cur = 0;for(int i = 0;i < N;i++){sort(G[i].begin(),G[i].end());int nxt = 1-cur;for(int j = 0;j <= M;j++) dp[nxt][j] = 0;int id = 0;for(int j = 0;j <= M;j++){dp[nxt][j] = max(dp[nxt][j],dp[cur][j]);while(id < (int)G[i].size() && G[i][id] <= j) id++;if(id == (int)G[i].size()) continue;int k = G[i][id];dp[nxt][k] = max(dp[nxt][k],dp[cur][j]+1);}swap(cur,nxt);}int ans = 0;for(int j = 0;j <= M;j++) ans = max(ans,dp[cur][j]);cout << ans << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;//cin >> tt;while(tt--) solve();}