Submission #489685

#TimeUsernameProblemLanguageResultExecution timeMemory
489685JerryLiu06Bob (COCI14_bob)C++17
120 / 120
133 ms8224 KiB
// https://oj.uz/problem/view/COCI14_bob #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using db = double; using str = string; using pi = pair<int, int>; using pl = pair<ll, ll>; using pd = pair<db, db>; using vi = vector<int>; using vb = vector<bool>; using vl = vector<ll>; using vd = vector<db>; using vs = vector<str>; using vpi = vector<pi>; using vpl = vector<pl>; using vpd = vector<pd>; #define FASTIO ios_base::sync_with_stdio(false); cin.tie(0); #define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0); #define mp make_pair #define f first #define s second #define sz(x) (int)(x).size() #define bg(x) begin(x) #define all(x) bg(x), end(x) #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define ft front() #define bk back() #define pb push_back #define pf push_front #define lb lower_bound #define ub upper_bound #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define F0R(i, a) FOR(i, 0, a) #define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--) #define R0F(i, a) ROF(i, 0, a) #define EACH(a, x) for (auto& a : x) ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); } const int MOD = 1e9 + 7; const int MX = 1e3 + 10; const ll INF = 1e18; int N, M, G[MX][MX]; int up[MX][MX], lft[MX]; ll DP[MX], ans = 0; int main() { FASTIO; cin >> N >> M; FOR(i, 1, N + 1) { stack<int> stck; stck.push(0); FOR(j, 1, M + 1) { cin >> G[i][j]; DP[j] = 0; lft[j] = j; if (G[i][j] == G[i - 1][j]) { up[i][j] = up[i - 1][j] + 1; } else { up[i][j] = 1; } if (G[i][j] == G[i][j - 1]) { lft[j] = lft[j - 1]; } while (up[i][j] <= up[i][stck.top()]) { stck.pop(); } int curLft = stck.top(); stck.push(j); if (curLft < lft[j]) { ans += (DP[j] = (j - lft[j] + 1) * up[i][j]); } else { ans += (DP[j] = DP[curLft] + (j - curLft) * up[i][j]); } } } cout << ans; }
#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...
#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...