-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.cpp
79 lines (77 loc) · 1.74 KB
/
main.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//
// main.cpp
// 마피아
//
// Created by 이준영 on 07/04/2020.
// Copyright © 2020 이준영. All rights reserved.
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <utility>
using namespace std;
int N,mafia;
int player[25];
int check_player[25];
int R[25][25];
int print = -99999999;
void go(int player_num, int num){
if(player_num == 1){
if(print < num){
print = num;
}
return;
}
if(check_player[mafia] == -1){
if(print < num){
print = num;
}
return;
}
if(player_num % 2 == 0){
num = num + 1;
for(int i = 0; i < N; i++){
if(check_player[i] != -1 and i != mafia){
for(int j = 0; j < N; j++){
player[j] = player[j] + R[i][j];
}
check_player[i] = -1;
go(player_num - 1, num);
check_player[i] = 0;
for(int j = 0; j < N; j++){
player[j] = player[j] - R[i][j];
}
}
}
}
else if(player_num % 2 != 0){
int max_num = -99999999,j = -1;
for(int i = 0; i < N; i++){
if(player[i] > max_num and check_player[i] != -1){
max_num = player[i];
j = i;
}
}
check_player[j] = -1;
go(player_num - 1, num);
check_player[j] = 0;
}
}
int main() {
cin.tie(NULL);
cout.tie(NULL);
cin >> N;
for(int i = 0; i < N; i++){
cin >> player[i];
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
cin >> R[i][j];
}
}
cin >> mafia;
go(N,0);
cout << print << "\n";
return 0;
}