Skip to content

문제 풀이 못한거 마무리 #213

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Dec 21, 2024
Merged

문제 풀이 못한거 마무리 #213

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 25 additions & 12 deletions CodeTree/2019-2020년/DH_윷놀이_사기단.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,14 +8,11 @@ public class DH_윷놀이_사기단 {
static class Horse {
int r, c;
public Horse() {}
@Override
public String toString() {
return "Horse [r=" + r + ", c=" + c + "]";
}
}
static int maxResult;
static boolean[] v;
static Horse[] horses;
static Set<Integer> moreOne;

public static void main(String[] args) throws Exception {
horses = new Horse[5];
Expand All @@ -28,6 +25,14 @@ public static void main(String[] args) throws Exception {
{20, 22, 24, 25, 30, 35, 40, 41},
{30, 28, 27, 26, 25, 30, 35, 40, 41}};

moreOne = new HashSet<Integer>();
moreOne.add(16);
moreOne.add(22);
moreOne.add(24);
moreOne.add(26);
moreOne.add(28);
moreOne.add(30);

initInput();
solution();
System.out.println(maxResult);
Expand Down Expand Up @@ -55,6 +60,7 @@ static void func(int depth, int result) {
int nr = currentR;
int nc = currentC + arr[depth];

boolean canGo = true;
if(nc >= map[nr].length) {
nc = map[nr].length - 1;
v[i] = true;
Expand All @@ -65,22 +71,29 @@ static void func(int depth, int result) {
nc = 0;
}

boolean canGo = true;

for(int j = 1; j < 5; j++) {
if(j == i) continue;
if(map[horses[i].r][horses[i].c] == 0 || map[horses[j].r][horses[j].c] == 0) continue;
if(map[horses[i].r][horses[i].c] == 41 || map[horses[j].r][horses[j].c] == 41) continue;

if(nr == horses[j].r && nc == horses[j].c) {
canGo = false;
break;
if(map[nr][nc] == 0 || map[horses[j].r][horses[j].c] == 0) continue;
if(map[nr][nc] == 41 || map[horses[j].r][horses[j].c] == 41) continue;

if(moreOne.contains(map[nr][nc])) {
if(horses[j].r == nr && horses[j].c == nc) {
canGo = false;
break;
}
} else {
if(map[nr][nc] == map[horses[j].r][horses[j].c]) {
canGo = false;
break;
}
}
}

if(!canGo) continue;
}

if(!canGo) continue;

horses[i].r = nr;
horses[i].c = nc;

Expand Down