제출 #407010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407010		LptN21	Bob (COCI14_bob)	C++14	120 / 120	175 ms	10124 KiB

bob

#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1000+7, M=1000+7;
const int MOD = 1e9+7;

int n, m, k, t;

int f[N], a[N], h[N];

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d%d", &n, &m);
    ll ans=0;a[0]=h[0]=f[0]=0;
    for(int i=1;i<=n;i++) {
        stack<int> st;
        for(int l=0, j=1;j<=m;j++) {
            scanf("%d", &k);
            h[j]=(a[j]==k?h[j]:0)+1, a[j]=k;
            if(a[j]!=a[j-1]) {
                f[l=j-1]=0;
                while(sz(st)) st.pop();
            }
            while(sz(st)&&h[j]<=h[st.top()]) st.pop();
            t=sz(st)?st.top():l;
            f[j]=f[t]+h[j]*(j-t);
            st.push(j), ans+=f[j];
        }
    }
    printf("%lld", ans);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

컴파일 시 표준 에러 (stderr) 메시지

bob.cpp: In function 'int main()':
bob.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
bob.cpp:32:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |             scanf("%d", &k);
      |             ~~~~~^~~~~~~~~~

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