답안 #211275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
211275	2020-03-19T22:02:11 Z	tleontest1	Bob (COCI14_bob)	C++14	컴파일 오류	0 ms	0 KB

bob

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define int long long
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const int li = 1002;
const lo mod = 1000000007;
 
int n,m,a[li][li],k,flag,t,dp[li][li];
int cev;
string s;
vector<int> v;
 
main(void){
	scanf("%lld %lld",&n,&m);
	FOR{
		for(int j=1;j<=m;j++){
			scanf("%lld",&a[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			flag=0;
			dp[i][j]=1;
			if(a[i][j-1]==a[i][j]){
				flag=1;
				dp[i][j]+=dp[i][j-1];
			}
			if(a[i-1][j]==a[i][j]){
				flag=1;
				dp[i][j]+=dp[i-1][j];
			}
			if(flag && a[i][j]==a[i-1][j-1])dp[i][j]-=dp[i-1][j-1];
		}
		dp[i][j]=max(dp[i][j],1ll);
	}
	FOR{
		for(int j=1;j<=m;j++){
			cev+=dp[i][j];
			//~ cout<<dp[i][j]<<" ";
		}
		//~ cout<<"\n";
	}
	printf("%lld\n",cev);
	return 0;
}

Compilation message

bob.cpp:34:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
bob.cpp: In function 'int main()':
bob.cpp:55:9: error: 'j' was not declared in this scope
   dp[i][j]=max(dp[i][j],1ll);
         ^
bob.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
bob.cpp:38:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~