【题目链接】
【思路要点】
- 注意到一步使得两维坐标均增大 2 2 2 或以上的走法一定是不优的,我们只需要考虑每一步某一维增量为 1 1 1 的情况。
- 预处理 L i , j , U i , j L_{i,j},U_{i,j} Li,j,Ui,j 分别表示最左侧的可以转移到 ( i , j ) (i,j) (i,j) 的位置和最上方的可以转移到 ( i , j ) (i,j) (i,j) 的位置,可以发现, L i , j L_{i,j} Li,j 在一行中是单调的, U i , j U_{i,j} Ui,j 在一列中是单调的。
- 用单调队列优化 d p dp dp 即可。
- 时间复杂度 O ( N × M + Q L o g Q ) O(N\times M+QLogQ) O(N×M+QLogQ) 。
【代码】
#include<bits/stdc++.h> using namespace std; const int MAXN = 2005; const int P = 1e9 + 7; typedef long long ll; typedef long double ld; typedef unsigned long long ull; template <typename T> void chkmax(T &x, T y) {x = max(x, y); } template <typename T> void chkmin(T &x, T y) {x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - '0'; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar('-'); if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template <typename T> void writeln(T x) { write(x); puts(""); } struct Heap { int n; priority_queue <int, vector <int>, greater <int>> Heap, Delt; void clear(int x) { n = x; while (!Heap.empty()) Heap.pop(); while (!Delt.empty()) Delt.pop(); } void ins(int x) { Heap.push(x); } void del(int x) { Delt.push(x); } int query() { while (!Heap.empty() && !Delt.empty() && Heap.top() == Delt.top()) { Heap.pop(); Delt.pop(); } if (Heap.empty()) return n; else return Heap.top(); } }; struct info { int pos, cnt[MAXN]; deque <pair <int, int>> q; void ins(int x, int y) { while (!q.empty() && q.back().first < x) q.pop_back(); q.push_back(make_pair(x, y)); } } in[MAXN], im[MAXN]; int n, m, q; int Max[MAXN][MAXN], ways[MAXN][MAXN]; int Maxl[MAXN][MAXN], Maxu[MAXN][MAXN]; vector <int> eu[MAXN][MAXN], el[MAXN][MAXN]; void update(int &x, int y) { x += y; if (x >= P) x -= P; } pair <int, int> operator + (pair <int, int> a, pair <int, int> b) { if (a.first > b.first) return a; if (a.first < b.first) return b; return make_pair(a.first, (a.second + b.second) % P); } int main() { int T; read(T); while (T--) { read(n), read(m), read(q); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { eu[i][j].clear(); el[i][j].clear(); } for (int i = 1; i <= q; i++) { int xl, yl, xr, yr; read(xl), read(yl), read(xr), read(yr); eu[xr][yr].push_back(xl); eu[xr][yl].push_back(-xl); el[xr][yr].push_back(yl); el[xl][yr].push_back(-yl); } for (int i = 1; i <= n; i++) { Heap tmp; tmp.clear(i); for (int j = m; j >= 1; j--) { for (auto x : eu[i][j]) if (x >= 0) tmp.ins(x); else tmp.del(-x); Maxu[i][j] = tmp.query(); } } for (int j = 1; j <= m; j++) { Heap tmp; tmp.clear(j); for (int i = n; i >= 1; i--) { for (auto x : el[i][j]) if (x >= 0) tmp.ins(x); else tmp.del(-x); Maxl[i][j] = tmp.query(); } } for (int i = n; i >= 1; i--) for (int j = m; j >= 1; j--) { if (i != n) chkmin(Maxu[i][j], Maxu[i + 1][j]); if (j != m) chkmin(Maxl[i][j], Maxl[i][j + 1]); } for (int i = 1; i <= max(n, m); i++) { in[i].pos = im[i].pos = 1; in[i].q.clear(); im[i].q.clear(); for (int j = 1; j <= min(n, m); j++) in[i].cnt[j] = im[i].cnt[j] = 0; } pair <int, int> ans = make_pair(0, 0); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (Maxu[i][j] != i) { Max[i][j] = ways[i][j] = 0; while (in[i - 1].pos < Maxl[i][j]) { update(in[i - 1].cnt[Max[i - 1][in[i - 1].pos]], P - ways[i - 1][in[i - 1].pos]); if (++in[i - 1].pos > in[i - 1].q.front().second) in[i - 1].q.pop_front(); } while (im[j - 1].pos < Maxu[i][j]) { update(im[j - 1].cnt[Max[im[j - 1].pos][j - 1]], P - ways[im[j - 1].pos][j - 1]); if (++im[j - 1].pos > im[j - 1].q.front().second) im[j - 1].q.pop_front(); } Max[i][j] = max(in[i - 1].q.front().first, im[j - 1].q.front().first) + 1; update(ways[i][j], in[i - 1].cnt[Max[i][j] - 1]); update(ways[i][j], im[j - 1].cnt[Max[i][j] - 1]); if (Max[i - 1][j - 1] + 1 == Max[i][j]) update(ways[i][j], P - ways[i - 1][j - 1]); } else Max[i][j] = ways[i][j] = 1; if (i != 1) { update(in[i - 1].cnt[Max[i - 1][j]], ways[i - 1][j]); in[i - 1].ins(Max[i - 1][j], j); } if (j != 1) { update(im[j - 1].cnt[Max[i][j - 1]], ways[i][j - 1]); im[j - 1].ins(Max[i][j - 1], i); } ans = ans + make_pair(Max[i][j], ways[i][j]); } printf("%d %d\n", ans.first, ans.second); } return 0; }