結果

問題 No.322 Geometry Dash
ユーザー uwiuwi
提出日時 2015-12-15 00:08:11
言語 Java19
(openjdk 21)
結果
AC  
実行時間 353 ms / 2,000 ms
コード長 3,234 bytes
コンパイル時間 4,024 ms
コンパイル使用メモリ 89,292 KB
実行使用メモリ 63,092 KB
最終ジャッジ日時 2023-08-08 05:05:33
合計ジャッジ時間 16,518 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,072 KB
testcase_01 AC 44 ms
49,284 KB
testcase_02 AC 44 ms
49,316 KB
testcase_03 AC 44 ms
49,220 KB
testcase_04 AC 204 ms
61,416 KB
testcase_05 AC 249 ms
60,576 KB
testcase_06 AC 275 ms
61,056 KB
testcase_07 AC 307 ms
61,212 KB
testcase_08 AC 345 ms
62,256 KB
testcase_09 AC 250 ms
60,632 KB
testcase_10 AC 275 ms
61,968 KB
testcase_11 AC 321 ms
61,860 KB
testcase_12 AC 324 ms
61,448 KB
testcase_13 AC 339 ms
62,180 KB
testcase_14 AC 281 ms
60,484 KB
testcase_15 AC 302 ms
61,512 KB
testcase_16 AC 317 ms
59,856 KB
testcase_17 AC 333 ms
61,784 KB
testcase_18 AC 353 ms
63,092 KB
testcase_19 AC 307 ms
62,492 KB
testcase_20 AC 324 ms
59,296 KB
testcase_21 AC 337 ms
61,784 KB
testcase_22 AC 347 ms
62,236 KB
testcase_23 AC 351 ms
62,064 KB
testcase_24 AC 325 ms
62,088 KB
testcase_25 AC 322 ms
61,292 KB
testcase_26 AC 338 ms
61,896 KB
testcase_27 AC 347 ms
62,024 KB
testcase_28 AC 341 ms
61,788 KB
testcase_29 AC 302 ms
60,124 KB
testcase_30 AC 306 ms
60,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class Q884 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[][] td = new long[n][3];
		for(int i = 0;i < n;i++)td[i][0] = ni();
		for(int i = 0;i < n;i++)td[i][1] = ni();
		for(int i = 0;i < n;i++)td[i][2] = i+1;
		Arrays.sort(td, new Comparator<long[]>() {
			public int compare(long[] a, long[] b) {
				return -Long.compare(a[0]*b[1], a[1]*b[0]);
			}
		});
		for(int i = 0;i < n;i++){
			if(i > 0)out.print(" ");
			out.print(td[i][2]);
		}
		out.println();
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q884().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0