Untitled

mail@pastecode.io avatar
unknown
plain_text
7 months ago
630 B
2
Indexable
Never
#include<iostream>
using namespace std;
int T, N, gate[3][3], visit[60]; 
int abs(int x){
	if(x < 0) return -x;
	return x;
}
void minRoad(int x){
	int road1 = 1000000;
	int road2 = 1000000;
	for(int i = x; i <= N; i++){
		if(visit[i] == 0){ 
			road1 = abs(i - x) + 1;
			break;
		}
	}
	for(int i = x - 1; i > 0; i--){
		if(visit[i] == 0){ 
			road2 = abs(i - x) + 1;
			break;
		}
	}
	
}
int main(){
	freopen("input.txt", "r", stdin);
	cin >> T; 
	for(int tc = 1; tc <= T; tc++){
		for(int i = 0; i < 3; i++){
			for(int j = 0; j < 3; j++){
				cin >> gate[i][j];
			}
		}



	}
	return 0;
}
Leave a Comment