oj.uz

Submission #489684

# Submission time Handle Problem Language Result Execution time Memory
489684 2021-11-23T21:37:29 Z JerryLiu06 Bob (COCI14_bob) C++17
120 / 120
 120 ms 17860 KB 
// 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]; ll DP[MX], ans = 0;

int main() {
    FASTIO;

    cin >> N >> M; 

    FOR(i, 1, N + 1) {

        stack<pi> stck; 
        stck.push({0, 0});

        FOR(j, 1, M + 1) {
            cin >> G[i][j];

            DP[j] = 0; 

            if (G[i][j] == G[i - 1][j]) {
                up[i][j] = up[i - 1][j] + 1;
            }
            else {
                up[i][j] = 1;
            }
            while (stck.top().s == G[i][j] && up[i][j] <= up[i][stck.top().f]) {
                stck.pop();
            }
            pi lft = stck.top(); stck.push({j, G[i][j]});
            
            if (lft.s != G[i][j]) {
                ans += (DP[j] = (j - lft.f) * up[i][j]);
            }
            else {
                ans += (DP[j] = DP[lft.f] + (j - lft.f) * up[i][j]);
            }
        }
    }
    cout << ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 720 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4828 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 5124 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5436 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 5456 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 14872 KB Output is correct
2 Correct 68 ms 10140 KB Output is correct
3 Correct 56 ms 10148 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 17848 KB Output is correct
2 Correct 61 ms 10136 KB Output is correct
3 Correct 64 ms 10060 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 17684 KB Output is correct
2 Correct 56 ms 10052 KB Output is correct
3 Correct 64 ms 10116 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 17860 KB Output is correct
2 Correct 59 ms 10164 KB Output is correct
3 Correct 82 ms 10120 KB Output is correct