-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProm_06.java
More file actions
100 lines (87 loc) · 1.98 KB
/
Prom_06.java
File metadata and controls
100 lines (87 loc) · 1.98 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
package com.ad;
import java.util.*;
import java.io.FileInputStream;
public class Prom_06 {
/**
* @param args
* 신입사원 - 기출
*
*/
static int map[][];
static int P, S, K, N, M, Answer, max, min, tmp;
static int visit[];
public static void main(String[] args)throws Exception {
// TODO Auto-generated method stub
System.setIn(new FileInputStream("src/data/prom06_1"));
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
for (int tc = 0; tc < T; tc++) {
/////////////////////////////////////////////
max = 0;
N = sc.nextInt();
map = new int [N][N];
visit = new int[N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
map[i][j] = sc.nextInt();
}
}
// for (int[] is : map) {
// System.out.println(Arrays.toString(is));
// }
/* 신입 사원 */
// max = Integer.MIN_VALUE;
// dfs(0);
// System.out.println(max);
/* 외계인 */
min = Integer.MAX_VALUE;
dfs2(0);
System.out.println(min);
/////////////////////////////////////////////
} // end of testCase
} // end of main
public static void dfs(int v) { // 신입사원
// TODO Auto-generated method stub
tmp = 0;
if(v == N) {
for (int i = 0; i < N; i++) {
tmp += visit[i];
}
if(tmp > max) {
max = tmp;
}
return;
}
for (int i = 0; i < N; i++) {
if (visit[i] == 0) {
visit[i] = map[v][i];
dfs(v + 1);
visit[i] = 0;
}
}
}
public static void dfs2(int v) { // 외계인
// TODO Auto-generated method stub
if(v == N) {
if(tmp < min) {
min = tmp;
}
return;
} else {
for (int i = 0; i < N; i++) {
if(visit[i] == 0) {
tmp += map[v][i];
System.out.println(tmp + " : " + map[v][i]);
if(tmp > min) {
tmp -= map[v][i];
continue;
}
visit[i] = 1;
dfs2(v+1);
tmp -= map[v][i];
visit[i] = 0;
}
}
}
}
}