結果

問題 No.318 学学学学学
コンテスト
ユーザー threepipes_s
提出日時 2015-12-11 18:58:54
言語 Java
(openjdk 23)
結果
AC  
実行時間 604 ms / 2,000 ms
コード長 3,309 bytes
コンパイル時間 2,716 ms
コンパイル使用メモリ 92,596 KB
実行使用メモリ 77,340 KB
最終ジャッジ日時 2024-06-22 15:34:00
合計ジャッジ時間 13,292 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.BitSet;
import java.util.HashMap;
import java.util.TreeSet;
 
public class Main{
	public static void main(String[] args){
		try {(new Solve()).solve();}
		catch (NumberFormatException | IOException e) {e.printStackTrace();}
	}
}
 
class Solve{
	void solve() throws NumberFormatException, IOException{
		final ContestScanner in = new ContestScanner();
		ContestWriter out = new ContestWriter();
		int n = in.nextInt();
		int[] a = new int[n];
		int[] b = new int[n];
		HashMap<Integer, Integer> first = new HashMap<>();
		for(int i=0; i<n; i++){
			a[i] = in.nextInt();
			b[i] = a[i];
			if(first.containsKey(a[i])) continue;
			first.put(a[i], i);
		}
		HashMap<Integer, Integer> second = new HashMap<>();
		for(int i=n-1; i>=0; i--){
			if(second.containsKey(a[i])){
				if(first.get(a[i])!=i)
					a[i] = 0;
			}else if(first.get(a[i])==i){
				a[i] = -a[i];
			}else{
				second.put(a[i], i);
			}
		}
		TreeSet<Integer> set = new TreeSet<>((e1,e2)->e2-e1);
		for(int i=0; i<n; i++){
			if(a[i]>0){
				if(set.contains(a[i])){
					final int t = set.first();
					set.remove(a[i]);
					a[i] = t;
					continue;
				}
				else set.add(a[i]);
			}else if(a[i]<0){
				a[i] = Math.max(-a[i], set.isEmpty()?0:set.first());
				continue;
			}
			if(!set.isEmpty()) a[i] = set.first();
		}
		StringBuilder sb = new StringBuilder();
		for(int i=0; i<n; i++){
			if(a[i]==0) a[i] = b[i];
			sb.append(a[i]+" ");
		}
		out.println(sb.toString().trim());
		out.close();
    }
}

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);}
}
 
class ContestWriter{
	private PrintWriter out;
	public ContestWriter(String filename) throws IOException
	{out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));}
	public ContestWriter() throws IOException{out = new PrintWriter(System.out);}
	public void println(String str){out.println(str);}
	public void println(Object str){out.println(str);}
	public void print(String str){out.print(str);}
	public void close(){out.close();}
}
 
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner()throws FileNotFoundException 
	{reader=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws FileNotFoundException
	{reader=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException{if(line==null||line.length<=idx){
	line=reader.readLine().trim().split(" ");idx=0;}return line[idx++];}
	public String readLine()throws IOException{return reader.readLine();}
	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());}
}
0