Submission #211209

# Submission time Handle Problem Language Result Execution time Memory
211209 2020-03-19T12:31:38 Z tleontest1 Bob (COCI14_bob) C++14
0 / 120
186 ms 8700 KB
#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("%d %d",&n,&m);
	FOR{
		for(int j=1;j<=m;j++){
			scanf("%d",&a[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i-1][j-1]!=a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=1;continue;}
			if(a[i-1][j-1]==a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=1;continue;}
			if(a[i-1][j-1]!=a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]+1;continue;}
			if(a[i-1][j-1]!=a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=dp[i][j-1]+1;continue;}
			if(a[i-1][j-1]==a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=dp[i][j-1]/dp[i-1][j-1];continue;}
			if(a[i-1][j-1]==a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]/dp[i-1][j-1];continue;}
			if(a[i-1][j-1]==a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]*dp[i][j-1]/dp[i-1][j-1];continue;}
			if(a[i-1][j-1]!=a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]+dp[i][j-1]+1;continue;}
		}
	}
	FOR{
		for(int j=1;j<=m;j++){
			cev+=dp[i][j];
			//~ cout<<dp[i][j]<<" ";
		}
		//~ cout<<"\n";
	}
	printf("%d\n",cev);
	return 0;
}

Compilation message

bob.cpp:35:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
bob.cpp: In function 'int main()':
bob.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
bob.cpp:39:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1024 KB Execution killed with signal 8 (could be triggered by violating memory limits)
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 768 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 4472 KB Execution killed with signal 8 (could be triggered by violating memory limits)
# Verdict Execution time Memory Grader output
1 Runtime error 38 ms 4576 KB Execution killed with signal 8 (could be triggered by violating memory limits)
# Verdict Execution time Memory Grader output
1 Runtime error 40 ms 4472 KB Execution killed with signal 8 (could be triggered by violating memory limits)
# Verdict Execution time Memory Grader output
1 Runtime error 41 ms 4480 KB Execution killed with signal 8 (could be triggered by violating memory limits)
# Verdict Execution time Memory Grader output
1 Runtime error 157 ms 8700 KB Execution killed with signal 8 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 183 ms 8408 KB Execution killed with signal 8 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 186 ms 8528 KB Execution killed with signal 8 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 181 ms 8568 KB Execution killed with signal 8 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -