#include<cstdio>#include<iostream>using namespace std;#define MAX_LEN 101#define is_valid(x, y) ((x)>=0 && (x)<N && (y)>=0 && (y)<M)int N, M;char image[MAX_LEN][MAX_LEN];int visited[MAX_LEN][MAX_LEN];int flag;void mark(int i, int j, int dx, int dy, char ch){ while(is_valid(i+dx, j+dy) && image[i+dx][j+dy]==ch) { visited[i+dx][j+dy] = 1; i += dx; j += dy; }}void solve(){ int i, j; char ch; for(i=0; i<N; i++) { for(j=0; j<M; j++) { ch = image[i][j]; if(ch!='.' && !visited[i][j]) { visited[i][j] = 1; switch(ch) { case '-': ++flag; mark(i, j, 0, 1, ch); break; case '|': ++flag; mark(i, j, 1, 0, ch); break; case '\': ++flag; mark(i, j, 1, 1, ch); break; case '/': ++flag; mark(i, j, 1, -1, ch); break; } } } }}int main(){ int i, tests; scanf("%d", &tests); while(tests--) { scanf("%d %d", &N, &M); for(i=0; i<N; i++) scanf("%s", image[i]); memset(visited, 0, sizeof(visited)); flag = 0; solve(); if(flag == 1) printf("CORRECTn"); else printf("INCORRECTn"); }}
