Submission #906771

#TimeUsernameProblemLanguageResultExecution timeMemory
906771gaga999Sandcastle 2 (JOI22_ho_t5)C++17
15 / 100
5080 ms920 KiB
#include <cstdio> #include <stdio.h> #include <iostream> #include <math.h> #include <vector> #include <queue> #include <stack> #include <deque> #include <algorithm> #include <utility> #include <set> #include <map> #include <stdlib.h> #include <cstring> #include <string.h> #include <string> #include <sstream> #include <assert.h> #include <climits> #include <sstream> #include <numeric> #include <time.h> #include <limits.h> #include <list> #include <bitset> #include <unordered_map> #include <unordered_set> #include <random> #include <iomanip> #include <complex> #include <chrono> #include <fstream> #include <functional> #include <unistd.h> // #pragma GCC optimize("Ofast,no-stack-protector") // #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt") #define lowbit(x) ((x) & -(x)) #define ml(a, b) ((1ll * (a) * (b)) % M) #define tml(a, b) (a) = ((1ll * (a) * (b)) % M) #define ad(a, b) ((0ll + (a) + (b)) % M) #define tad(a, b) (a) = ((0ll + (a) + (b)) % M) #define mi(a, b) ((0ll + M + (a) - (b)) % M) #define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M) #define tmin(a, b) (a) = min((a), (b)) #define tmax(a, b) (a) = max((a), (b)) #define iter(a) (a).begin(), (a).end() #define riter(a) (a).rbegin(), (a).rend() #define init(a, b) memset((a), (b), sizeof(a)) #define cpy(a, b) memcpy((a), (b), sizeof(a)) #define uni(a) a.resize(unique(iter(a)) - a.begin()) #define pb emplace_back #define mpr make_pair #define ls(i) ((i) << 1) #define rs(i) ((i) << 1 | 1) #define INF 0x3f3f3f3f #define NIF 0xc0c0c0c0 #define eps 1e-9 #define F first #define S second #define AC cin.tie(0)->sync_with_stdio(0) using namespace std; typedef long long llt; typedef pair<int, int> pii; typedef pair<double, double> pdd; typedef pair<llt, llt> pll; typedef complex<double> cd; // const int M = 998244353; // random_device rm; // mt19937 rg(rm()); // default_random_engine rg(rm()); // uniform_int_distribution<int> rd(INT_MIN, INT_MAX); // uniform_real_distribution<double> rd(0, M_PI); void db() { cerr << "\n"; } template <class T, class... U> void db(T a, U... b) { cerr << a << " ", db(b...); } inline char gc() { const static int SZ = 1 << 16; static char buf[SZ], *p1, *p2; if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2)) return -1; return *p1++; } void rd() {} template <typename T, typename... U> void rd(T &x, U &...y) { x = 0; bool f = 0; char c = gc(); while (!isdigit(c)) f ^= !(c ^ 45), c = gc(); while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = gc(); f && (x = -x), rd(y...); } template <typename T> void prt(T x) { if (x < 0) putchar('-'), x = -x; if (x > 9) prt(x / 10); putchar((x % 10) ^ 48); } bool operator!=(const pii &p, int x) { return p.F != x && p.S != x; } vector<vector<int>> gd; int vv, ff; pii gv(const pii &p, int l, int r, int u, int d) { int mn = INF, mx = -INF, cr = gd[p.F][p.S], tp; pii res(0, 0); if (p.F != l) { tp = gd[p.F - 1][p.S]; if (tp < cr && tp > mx) mx = tp, res.F = 1; if (tp > cr && tp < mn) mn = tp, res.S = 1; } if (p.F != r) { tp = gd[p.F + 1][p.S]; if (tp < cr && tp > mx) mx = tp, res.F = 4; if (tp > cr && tp < mn) mn = tp, res.S = 4; } if (p.S != u) { tp = gd[p.F][p.S - 1]; if (tp < cr && tp > mx) mx = tp, res.F = 2; if (tp > cr && tp < mn) mn = tp, res.S = 2; } if (p.S != d) { tp = gd[p.F][p.S + 1]; if (tp < cr && tp > mx) mx = tp, res.F = 3; if (tp > cr && tp < mn) mn = tp, res.S = 3; } return res; } void slv(const pii &p, int l, int r, int u, int d) { int mn = INF, mx = -INF, cr = gd[p.F][p.S], tp; pii res(0, 0); if (p.F != l) { tp = gd[p.F - 1][p.S]; if (tp < cr && tp > mx) mx = tp, res.F = 1; if (tp > cr && tp < mn) mn = tp, res.S = 1; } if (p.F != r) { tp = gd[p.F + 1][p.S]; if (tp < cr && tp > mx) mx = tp, res.F = 4; if (tp > cr && tp < mn) mn = tp, res.S = 4; } if (p.S != u) { tp = gd[p.F][p.S - 1]; if (tp < cr && tp > mx) mx = tp, res.F = 2; if (tp > cr && tp < mn) mn = tp, res.S = 2; } if (p.S != d) { tp = gd[p.F][p.S + 1]; if (tp < cr && tp > mx) mx = tp, res.F = 3; if (tp > cr && tp < mn) mn = tp, res.S = 3; } ff += !res.F; } void q1(const pii &p, int l, int r, int u, int d) { pii r1 = gv(mpr(p.F - 1, p.S), l, r, u, d), r2 = gv(p, l, r, u, d); if ((r1.F == 4 && r2.S != 1) || (r1.S == 4 && r2.F != 1) || (r1.F != 4 && r2.S == 1) || (r1.S != 4 && r2.F == 1)) vv++; } void q2(const pii &p, int l, int r, int u, int d) { pii r1 = gv(mpr(p.F, p.S - 1), l, r, u, d), r2 = gv(p, l, r, u, d); if ((r1.F == 3 && r2.S != 2) || (r1.S == 3 && r2.F != 2) || (r1.F != 3 && r2.S == 2) || (r1.S != 3 && r2.F == 2)) vv++; } signed main() { int n, m; rd(n, m); if (n > m) { swap(n, m); gd = vector<vector<int>>(n, vector<int>(m)); for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) rd(gd[j][i]); } else { gd = vector<vector<int>>(n, vector<int>(m)); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) rd(gd[i][j]); } llt ans = 0; for (int l = 0; l < n; l++) { for (int r = l; r < n; r++) { for (int i = 0; i < m; i++) { vv = 0, ff = 0; for (int t = l + 1; t <= r; t++) q1(mpr(t, i), l, r, i, i); for (int t = l; t <= r; t++) slv(mpr(t, i), l, r, i, i); if (!vv && ff == 1) ans++; vv = 0, ff = 0; for (int j = i + 1; j < m; j++) { for (int t = l + 1; t <= r; t++) q1(mpr(t, j - 1), l, r, i, j); if (j != i + 1) for (int t = l; t <= r; t++) q2(mpr(t, j - 1), l, r, i, j); for (int t = l; t <= r; t++) slv(mpr(t, j - 1), l, r, i, j); if (vv || ff > 1) { vv = 0, ff = 0; break; } int pf = ff; for (int t = l + 1; t <= r; t++) q1(mpr(t, j), l, r, i, j); for (int t = l; t <= r; t++) q2(mpr(t, j), l, r, i, j), slv(mpr(t, j), l, r, i, j); if (!vv && ff == 1) ans++; vv = 0, ff = pf; } } } } prt(ans), putchar('\n'); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...