글 읽기 - 중복체크를 해쉬맵으로 시도해보았는데 테케랑 게시판의 반례는 다 맞는데...

gtkim4617 4년 전 0

게시판 반례랑 문제 테케는 다 맞는데 제출했을때 그냥 틀렸다고 나오네요 ㅠㅠ 이유가 뭘까요??

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Main {

	private static int R;
	private static int C;
	private static int M;
	static ArrayList<Shark> shark;
	static int[] dx = {-1,1,0,0};
	static int[] dy = {0,0,1,-1};
	private static int sum;

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		StringTokenizer st = new StringTokenizer(br.readLine(), " ");
		R = Integer.parseInt(st.nextToken());
		C = Integer.parseInt(st.nextToken());
		M = Integer.parseInt(st.nextToken());
		shark = new ArrayList<>();
		for (int i = 0; i < M; i++) {
			st = new StringTokenizer(br.readLine(), " ");
			int r = Integer.parseInt(st.nextToken());
			int c = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int d = Integer.parseInt(st.nextToken());
			int z = Integer.parseInt(st.nextToken());
			shark.add(new Shark(r, c, s, d, z));
		}
		sum = 0;
		
		fishing();
		
		System.out.println(sum);
	}
	
	public static void fishing() {
		int t = 0;
		while(t < C) {
			eat(t);
			move();
			t++;
		}
	}
	
	private static void move() {
		HashMap<String, Shark> hm = new HashMap<>();
		int size = shark.size();
		for (int i = 0; i < size; i++) {
			Shark alive_shark = shark.get(i);
			if(alive_shark.d == 1) {
				int r = alive_shark.r;
				int c = alive_shark.c;
				int d = alive_shark.d-1;
				int s = alive_shark.s;
				int z = alive_shark.z;
				int len = 0;
				while(len<s) {
					r = r+dx[d];
					if(r <= 0) {
						d = 1;
						r = r + 2*dx[d];
					}else if(r > R) {
						d = 0;
						r = r + 2*dx[d];
					}
					len++;
				}
				if(!hm.containsKey(r+""+c)) {
					hm.put(r+""+c, new Shark(r, c, s, d+1, z));
				}else {
					if(hm.get(r+""+c).z < alive_shark.z) {
						hm.put(r+""+c, new Shark(r, c, s, d+1, z));
					}
				}
			}else if(alive_shark.d == 2) {
				int r = alive_shark.r;
				int c = alive_shark.c;
				int d = alive_shark.d-1;
				int s = alive_shark.s;
				int z = alive_shark.z;
				int len = 0;
				while(len<s) {
					r = r+dx[d];
					if(r <= 0) {
						d = 1;
						r = r + 2*dx[d];
					}else if(r > R) {
						d = 0;
						r = r + 2*dx[d];
					}
					len++;
				}
				if(!hm.containsKey(r+""+c)) {
					hm.put(r+""+c, new Shark(r, c, s, d+1, z));
				}else {
					if(hm.get(r+""+c).z < alive_shark.z) {
						hm.put(r+""+c, new Shark(r, c, s, d+1, z));
					}
				}
			}else if(alive_shark.d == 3) {
				int r = alive_shark.r;
				int c = alive_shark.c;
				int d = alive_shark.d-1;
				int s = alive_shark.s;
				int z = alive_shark.z;
				int len = 0;
				while(len<s) {
					c = c+dy[d];
					if(c <= 0) {
						d = 2;
						c = c + 2*dy[d];
					}else if(c > C) {
						d = 3;
						c = c + 2*dy[d];
					}
					len++;
				}
				if(!hm.containsKey(r+""+c)) {
					hm.put(r+""+c, new Shark(r, c, s, d+1, z));
				}else {
					if(hm.get(r+""+c).z < alive_shark.z) {
						hm.put(r+""+c, new Shark(r, c, s, d+1, z));
					}
				}
			}else if(alive_shark.d == 4) {
				int r = alive_shark.r;
				int c = alive_shark.c;
				int d = alive_shark.d-1;
				int s = alive_shark.s;
				int z = alive_shark.z;
				int len = 0;
				while(len<s) {
					c = c+dy[d];
					if(c <= 0) {
						d = 2;
						c = c + 2*dy[d];
					}else if(c > C) {
						d = 3;
						c = c + 2*dy[d];
					}
					len++;
				}
				if(!hm.containsKey(r+""+c)) {
					hm.put(r+""+c, new Shark(r, c, s, d+1, z));
				}else {
					if(hm.get(r+""+c).z < alive_shark.z) {
						hm.put(r+""+c, new Shark(r, c, s, d+1, z));
					}
				}
			}
		}
		shark.clear();
		for(String p : hm.keySet()) {
			shark.add(hm.get(p));
		}
	}
    
	private static void eat(int state) {
		ArrayList<Shark> list = new ArrayList<>();
		int min = Integer.MAX_VALUE;
		for (int i = 0; i < shark.size(); i++) {
			if(shark.get(i).c == state+1) {
				list.add(shark.get(i));
				min = Math.min(min, shark.get(i).r);
			}
		}
		
		for (int i = 0; i < shark.size(); i++) {
			if(shark.get(i).c == state+1 && shark.get(i).r == min) {
				sum+=shark.get(i).z;
				shark.remove(i);
				break;
			}
		}
	}
	
	public static class Shark{
		int r, c, s, d, z;

		public Shark(int r, int c, int s, int d, int z) {
			super();
			this.r = r;
			this.c = c;
			this.s = s;
			this.d = d;
			this.z = z;
		}
	}

}

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

중복체크를 해쉬맵으로 시도해보았는데 테케랑 게시판의 반례는 다 맞는데...

gtkim4617 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말