Submission #639150

#	Time	Username	Problem	Language	Result	Execution time	Memory
639150		CaoHuuKhuongDuy	Bob (COCI14_bob)	C++14	0 / 120	121 ms	16120 KiB

bob

#include <bits/stdc++.h>
using namespace std;
#define int long long 
typedef pair <int,int> ii;
const int N = 1e3 + 9;
const int oo = 1e10;
int n,m,a[N][N],high[N][N],l[N],r[N],res = 0;
void solve(int a[],int h[],bool kt)
{
    stack <int> s;
    h[0] = -oo;
    s.push(0);
    for (int i = 1;i <= m;i++)
      {
        while (h[i] < h[s.top()] && a[i] == a[s.top()]) s.pop();
        l[i] = s.top() + 1;
        s.push(i);
      }
    while (s.size()) s.pop();
    s.push(m + 1);
    h[m + 1] = -oo;
    // ofstream debug("test.out");
    // if (kt) cout<<h[2]<<" "<</h[3]<<endl;
    for (int i = m;i >= 1;i--)
      {
        while (h[i] <= h[s.top()] && a[i] == a[s.top()]) s.pop();
        r[i] = s.top() - 1;
        s.push(i);
      }
    int lim_r;
    int tmp = res;
    for (int i = 1;i <= m;i++)
      {
        res += (i - l[i] + 1) * (r[i] - i + 1);
        if (a[r[i] + 1] != a[i] || r[i] == m) lim_r = 1;
        else lim_r = h[r[i] + 1] + 1;
        // if (kt) cout<<l[i]<<" "<<r[i]<<endl;
        res += (h[i] - lim_r) * (r[i] - i + 1);
      }  
    // debug<<res - tmp<<endl;
    // debug<<"sddsd";
    // debug.close();
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    // freopen("test.inp","r",stdin);
    cin>>n>>m;
    for (int i = 1;i <= n;i++)
      for (int j = 1;j <= m;j++)
        cin>>a[i][j];
    for (int i = 1;i <= n;i++)
      for (int j = 1;j <= m;j++)
        if (a[i][j] != a[i-1][j]) high[i][j] = 1;
        else high[i][j] = high[i-1][j] + 1;
    for (int i = 1;i <= n;i++)
      solve(a[i],high[i],(i == 3));
    cout<<res;
    return 0;
}

Compilation message (stderr)

bob.cpp: In function 'void solve(long long int*, long long int*, bool)':
bob.cpp:31:9: warning: unused variable 'tmp' [-Wunused-variable]
   31 |     int tmp = res;
      |         ^~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12