oj.uz

답안 #211207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211207 2020-03-19T12:26:27 Z tleontest1 Bob (COCI14_bob) C++14
0 / 120
 77 ms 2560 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 lo li = 505;
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]*2;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]);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 768 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB Output isn't correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 30 ms 2432 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 34 ms 2432 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 34 ms 2432 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #6
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 34 ms 2560 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 71 ms 1272 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 73 ms 1272 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 74 ms 1272 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 77 ms 1272 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -