| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 920169 |
2024-02-02T07:17:59 Z |
Whisper |
Bob (COCI14_bob) |
C++17 |
|
99 ms |
18256 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;
#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int N, M;
int a[MAX][MAX];
int l[MAX], r[MAX], h[MAX];
void Whisper(){
cin >> N >> M;
FOR(i, 1, N) FOR(j, 1, M) cin >> a[i][j];
int ans = 0;
for (int i = 1; i <= N; ++i){
stack<int> st;
for (int j = 1; j <= M; ++j){
h[j] = (a[i][j] == a[i - 1][j] ? h[j] + 1 : 1);
}
for (int j = 1; j <= M; ++j){
while (st.size() && a[i][st.top()] == a[i][j] && h[st.top()] >= h[j]) st.pop();
l[j] = (st.size() ? st.top() : 0);
st.push(j);
}
st = stack<int> {};
for (int j = M; j >= 1; --j){
while (st.size() && a[i][st.top()] == a[i][j] && h[st.top()] > h[j]) st.pop();
r[j] = (st.size() ? st.top() : M + 1);
st.push(j);
}
for (int j = 1; j <= M; ++j){
ans += (r[j] - j) * (j - l[j]) * h[j];
}
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
5208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
5464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
5720 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
5840 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
14784 KB |
Output is correct |
| 2 |
Correct |
49 ms |
10300 KB |
Output is correct |
| 3 |
Correct |
49 ms |
10064 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
99 ms |
18056 KB |
Output is correct |
| 2 |
Correct |
61 ms |
10440 KB |
Output is correct |
| 3 |
Correct |
48 ms |
10072 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
93 ms |
17884 KB |
Output is correct |
| 2 |
Correct |
47 ms |
10064 KB |
Output is correct |
| 3 |
Correct |
50 ms |
10060 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
97 ms |
18256 KB |
Output is correct |
| 2 |
Correct |
48 ms |
10072 KB |
Output is correct |
| 3 |
Correct |
49 ms |
10064 KB |
Output is correct |
