-
Notifications
You must be signed in to change notification settings - Fork 0
/
ccc_2020_s2.cpp
64 lines (58 loc) · 1.3 KB
/
ccc_2020_s2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <algorithm>
#include <numeric>
#include <iterator>
#include <iostream>
#include <cstring>
#include <bitset>
#include <deque>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
int M, N;
vector<int> factors[1000005];
int grid[1005][1005];
void getFac(int num) {
for(int i = 1; i * i <= num; i++) {
if((num % i == 0 && i <= max(M, N)) && (num / i <= max(M, N))) {
factors[num].push_back(i);
}
}
}
bool dfs(int x, int y) {
if(x == M - 1 && y == N - 1) {
return true;
}
if(x >= M || y >= N || !factors[grid[x][y]].empty()) {
return false;
}
int num = grid[x][y];
getFac(num);
for(int i : factors[num]) {
int x1 = i - 1, y1 = num / i - 1;
if (dfs(x1, y1) || dfs(y1, x1)) {
return true;
}
}
return false;
}
int main() {
scan(M); scan(N);
for(int i = 0; i < M; i++) {
for(int j = 0; j < N; j++) {
scan(grid[i][j]);
}
}
bool ans = dfs(0, 0);
if(ans == true){
cout << "yes" << "\n";
} else{
cout << "no" << "\n";
}
}