제출 #200553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200553		Kalam	Bob (COCI14_bob)	C++11	0 / 120	1100 ms	888 KiB

bob

// KALAM
# include<bits/stdc++.h>

# define debug(x) cerr << #x << " = " << x << endl

using namespace std;

const int N = 1000 + 77;
int n , m , a[N][N] , up[N][N] , b[N] , c[N];
int cur , f[N] , L[N] , R[N];
long long A;
inline void Calc() {
   c[0] = 0;
   c[cur + 1] = 0;
   for(int i = 1;i <= cur;++ i) {
      L[i] = i - 1;
      while(c[L[i]] >= c[i])
         L[i] = L[L[i]];
   }
   for(int i = cur;i > 0;-- i) {
      R[i] = i + 1;
      while(c[R[i]] > c[i])
         R[i] = R[R[i]];
      A += 1ll * (i - L[i]) * (R[i] - i) * c[i];
   }
   cur = 0;
}
int main() {
   scanf("%d %d" , & n , & m);
   for(int i = 1;i <= n;++ i) {
      for(int j = 1;j <= m;++ j)
         scanf("%d" , & a[i][j]) , up[i][j] = (a[i][j] == a[i - 1][j] ? up[i - 1][j] : i - 1) , b[j] = a[i][j] , c[j] = i - up[i][j];
      int pv = 1;
      f[++ cur] = c[1];
      for(int j = 2;j <= m;++ j) {
         if(b[j] != b[j - 1])
            Calc();
         f[++ cur] = c[j];
      }
      Calc();
   }
   printf("%lld\n" , A);
	return 0;
}

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

bob.cpp: In function 'int main()':
bob.cpp:33:11: warning: unused variable 'pv' [-Wunused-variable]
       int pv = 1;
           ^~
bob.cpp:29:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d" , & n , & m);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~
bob.cpp:32:112: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
          scanf("%d" , & a[i][j]) , up[i][j] = (a[i][j] == a[i - 1][j] ? up[i - 1][j] : i - 1) , b[j] = a[i][j] , c[j] = i - up[i][j];
          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

• 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