oj.uz

Submission #64527

# Submission time Handle Problem Language Result Execution time Memory
64527 2018-08-04T19:29:57 Z forestryks Bob (COCI14_bob) C++14
120 / 120
 280 ms 64212 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

namespace solver {
    const int MAXN = 1e3 + 5;
    vector<pair<int, int>> a;
    int pos;

    void clear() {
        a.clear();
        a.push_back({0, -1});
        pos = -1;
    }

    ll feed(int x) {
        pos++;
        while (!a.empty() && a.back().f >= x) {
            a.pop_back();
        }

        a.push_back({x, pos});

        ll res = 0;
        for (int i = 1; i < a.size(); ++i) {
            res += 1LL * (a[i].f - a[i - 1].f) * (pos - a[i - 1].s);
        }
        return res;
    }
};

const int MAXN = 1e3 + 5;
int n, m;
int a[MAXN][MAXN];
int eq[MAXN][MAXN];

int main() {
    FAST_IO;
    cin >> n >> m;
    rep(i, n) {
        rep(j, m) {
            cin >> a[i][j];
        }
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (i == 0) {
                eq[i][j] = 1;
                continue;
            }

            if (a[i][j] == a[i - 1][j]) {
                eq[i][j] = eq[i - 1][j] + 1;
            } else {
                eq[i][j] = 1;
            }
        }
    }

    ll res = 0;
    for (int i = 0; i < n; ++i) {
        solver::clear();
        for (int j = 0; j < m; ++j) {
            if (j != 0 && a[i][j] != a[i][j - 1]) {
                solver::feed(0);
            }
            res += solver::feed(eq[i][j]);
        }
    }

    cout << res << endl;
}

Compilation message

bob.cpp: In function 'll solver::feed(int)':
bob.cpp:56:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 1; i < a.size(); ++i) {
                         ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 19368 KB Output is correct
2 Correct 109 ms 21476 KB Output is correct
3 Correct 131 ms 23444 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 33064 KB Output is correct
2 Correct 122 ms 35132 KB Output is correct
3 Correct 143 ms 37048 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 46708 KB Output is correct
2 Correct 122 ms 48676 KB Output is correct
3 Correct 141 ms 50564 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 60436 KB Output is correct
2 Correct 152 ms 62324 KB Output is correct
3 Correct 117 ms 64212 KB Output is correct