#139229 (Java21) No.455 冬の大三角

• 問題: No.455 冬の大三角
• ユーザー: threepipes_s
• 提出日時: 2016-12-16 23:29:03
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 93 ms / 2,000 ms
• コード長: 7,541 bytes
• コンパイル時間: 4,081 ms
• コンパイル使用メモリ: 95,528 KB
• 実行使用メモリ: 53,708 KB
• 最終ジャッジ日時: 2024-06-29 21:42:52
• 合計ジャッジ時間: 8,799 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	54 ms; 50,720 KB
testcase_01	AC	56 ms; 52,328 KB
testcase_02	AC	74 ms; 50,920 KB
testcase_03	AC	54 ms; 50,852 KB
testcase_04	AC	56 ms; 50,564 KB
testcase_05	AC	56 ms; 50,444 KB
testcase_06	AC	55 ms; 52,524 KB
testcase_07	AC	55 ms; 50,740 KB
testcase_08	AC	83 ms; 53,708 KB
testcase_09	AC	55 ms; 50,616 KB
testcase_10	AC	55 ms; 50,804 KB
testcase_11	AC	57 ms; 52,284 KB
testcase_12	AC	56 ms; 50,564 KB
testcase_13	AC	55 ms; 50,384 KB
testcase_14	AC	55 ms; 50,600 KB
testcase_15	AC	55 ms; 52,144 KB
testcase_16	AC	55 ms; 50,564 KB
testcase_17	AC	55 ms; 50,560 KB
testcase_18	AC	54 ms; 50,636 KB
testcase_19	AC	55 ms; 50,640 KB
testcase_20	AC	56 ms; 50,632 KB
testcase_21	AC	57 ms; 50,616 KB
testcase_22	AC	56 ms; 50,408 KB
testcase_23	AC	56 ms; 50,780 KB
testcase_24	AC	54 ms; 52,280 KB
testcase_25	AC	55 ms; 50,532 KB
testcase_26	AC	55 ms; 50,616 KB
testcase_27	AC	54 ms; 50,704 KB
testcase_28	AC	55 ms; 50,512 KB
testcase_29	AC	87 ms; 51,896 KB
testcase_30	AC	68 ms; 51,236 KB
testcase_31	AC	68 ms; 51,268 KB
testcase_32	AC	67 ms; 53,072 KB
testcase_33	AC	93 ms; 52,136 KB
testcase_34	AC	62 ms; 50,504 KB
testcase_35	AC	75 ms; 51,656 KB
testcase_36	AC	70 ms; 53,328 KB
testcase_37	AC	66 ms; 53,104 KB
testcase_38	AC	76 ms; 50,868 KB
testcase_39	AC	88 ms; 52,248 KB
testcase_40	AC	71 ms; 51,172 KB
testcase_41	AC	70 ms; 51,248 KB
testcase_42	AC	72 ms; 51,732 KB
testcase_43	AC	67 ms; 51,204 KB
testcase_44	AC	67 ms; 50,988 KB
testcase_45	AC	87 ms; 51,920 KB
testcase_46	AC	69 ms; 51,316 KB
testcase_47	AC	69 ms; 51,264 KB
testcase_48	AC	67 ms; 53,164 KB
testcase_49	AC	57 ms; 50,516 KB
testcase_50	AC	55 ms; 52,332 KB
testcase_51	AC	62 ms; 50,892 KB
testcase_52	AC	73 ms; 50,556 KB
testcase_53	AC	75 ms; 51,016 KB
testcase_54	AC	63 ms; 50,788 KB
testcase_55	AC	67 ms; 53,056 KB
testcase_56	AC	65 ms; 50,788 KB

ソースコード

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Queue;
import java.util.TreeMap;

public class Main implements Runnable{
	static ContestScanner in;static Writer out;
	public static void main(String[] args) {
		new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
	}
	public void run() {
		try {
			in = new ContestScanner();
			out = new Writer();
			Main solve = new Main();
			solve.solve();
			in.close();
			out.flush();
			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	static void dump(int[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)
	s.append(a[i]).append(" ");out.println(s.toString().trim());}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)
	s.append(a[i]).append(" ");out.println(s.toString().trim());}
	static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	@SuppressWarnings("unchecked")
	static List<Integer>[]createGraph(int n)
    {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
	void solve() throws IOException{
		int h = in.nextInt();
		int w = in.nextInt();
		char[][] map = new char[h][w];
		Point[] pos = new Point[2];
		int p = 0;
		for(int i=0; i<h; i++){
			map[i] = in.nextToken().toCharArray();
			for(int j=0; j<w; j++){
				if(map[i][j] == '*'){
					pos[p++] = new Point(j, i);
				}
			}
		}
		out:for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				if(map[i][j] == '*') continue;
				int area = triarea(pos[0], pos[1], new Point(j, i));
				if(area != 0){
					map[i][j] = '*';
					break out;
				}
			}
		}
		for(int i=0; i<h; i++){
			dump(map[i]);
		}
	}
	
	static int triarea(Point a, Point b, Point c){
		int dx1 = b.x - a.x;
		int dy1 = b.y - a.y;
		int dx2 = c.x - a.x;
		int dy2 = c.y - a.y;
		return dx1*dy2 - dx2*dy1;
	}
}

class Point{
	int x, y;
	Point(int x, int y){
		this.x = x;
		this.y = y;
	}
}

@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
@SuppressWarnings("serial")
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}