結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー | yun_app |
提出日時 | 2017-03-28 17:15:24 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,227 bytes |
コンパイル時間 | 2,652 ms |
コンパイル使用メモリ | 78,600 KB |
実行使用メモリ | 78,112 KB |
最終ジャッジ日時 | 2024-07-06 13:24:48 |
合計ジャッジ時間 | 6,944 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
50,180 KB |
testcase_01 | AC | 54 ms
50,020 KB |
testcase_02 | AC | 50 ms
50,336 KB |
testcase_03 | AC | 54 ms
50,244 KB |
testcase_04 | AC | 53 ms
49,984 KB |
testcase_05 | AC | 273 ms
78,112 KB |
testcase_06 | AC | 49 ms
50,180 KB |
testcase_07 | AC | 49 ms
49,880 KB |
testcase_08 | TLE | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
ソースコード
/* package whatever; // don't place package name! */ import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class Main { public static void main (String[] args) throws java.lang.Exception { // your code goes here BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] lines = br.readLine().split(" "); int gx = Integer.parseInt(lines[0]); int gy = Integer.parseInt(lines[1]); int n = Integer.parseInt(lines[2]); int f = Integer.parseInt(lines[3]); Place start = new Place(0,0); Place goal = new Place(gx,gy); ArrayList<Crystal> crystals = new ArrayList<Crystal>(); for(int i=0;i<n;i++){ crystals.add(new Crystal(i,br.readLine())); } PriorityQueue<Place> queue = new PriorityQueue<Place>(1, new Comparator<Place>(){ public int compare(Place p1,Place p2){ if(p1.c!=p2.c){ return p1.c-p2.c; } return p1.x+p1.y - p2.x - p2.y; } }); queue.add(start); while(!queue.isEmpty()){ Place now = queue.poll(); if(now.x == goal.x && now.y == goal.y){ goal = now; break; } for(Crystal c:crystals){ if(now.canUseCrystal(c)){ Place newPlace = now.clone(); newPlace.useCrystal(c); if(newPlace.x <= goal.x && newPlace.y <= goal.y){ queue.add(newPlace); } } } Place newPlace = now.clone(); newPlace.move(goal,f); queue.add(newPlace); } System.out.println(goal.c); } private static class Place{ int x,y; int c; ArrayList<Integer> useCrystal = new ArrayList<Integer>(); public Place(int x,int y){ this.x = x; this.y = y; this.c = 0; } public Place clone(){ Place p = new Place(this.x,this.y); p.c = this.c; for(int n:this.useCrystal){ p.useCrystal.add(n); } return p; } public boolean canUseCrystal(Crystal c){ return useCrystal.indexOf(c.no)==-1; } public void useCrystal(Crystal c){ this.x += c.x; this.y += c.y; this.c += c.c; useCrystal.add(c.no); } public void move(Place g,int f){ int cost = f*(g.x-this.x); cost += f*(g.y-this.y); this.x = g.x; this.y = g.y; this.c += cost; } } private static class Crystal{ public int no; public int x,y,c; public Crystal(int no,String line){ this.no = no; String[] lines = line.split(" "); this.x = Integer.parseInt(lines[0]); this.y = Integer.parseInt(lines[1]); this.c = Integer.parseInt(lines[2]); } } }