-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path11553_GridGame.cpp
More file actions
75 lines (73 loc) · 1.22 KB
/
Copy path11553_GridGame.cpp
File metadata and controls
75 lines (73 loc) · 1.22 KB
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
65
66
67
68
69
70
71
72
73
74
75
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
using namespace std;
#define size 10
int Grid[size][size];
int used[size];
int N,T,Ans1,Ans2,A[size];
int col[size];
int Min,F_Min;
void initcol(){
for (int i = 0; i < N; i++)
col[i] = 0;
}
void initused(){
for (int i = 0; i < N; i++)
used[i] = 0;
}
void print(){
int val=9999,c;
for (int k = 0; k < N; k++){
val = 9999;
for (int l = 0; l < N; l++)if(col[l]==0){
if (Grid[A[k]][l] < val){
val = Grid[A[k]][l];
c = l;
}
}
col[c] = 1;
Min += Grid[A[k]][c];
val = 9999;
}
if (Min < F_Min)
F_Min = Min;
initcol();
Min = 0;
}
void solve(int i){
if (i == N){
print();
return;
}
for (int j = 0; j < N; j++)if (used[j] == 0){
used[j] = 1;
A[i] = j;
solve(i + 1);
used[j] = 0;
}
}
void solvecase(){
F_Min = 99999;
Min = 0;
initused();
initcol();
solve(0);
}
int main(){
int t;
/*freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);*/
cin >> t;
int i, j, k;
for (T = 1; T <= t; T++){
cin >> N;
for (i = 0; i < N; i++){
for (j = 0; j < N; j++){
cin >> Grid[i][j];
}
}
solvecase();
printf("%d\n", F_Min);
}
}