#456954 (Java) No.322 Geometry Dash

• 問題: No.322 Geometry Dash
• ユーザー: 37zigen
• 提出日時: 2020-04-03 05:14:38
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 773 ms / 2,000 ms
• コード長: 2,942 bytes
• コンパイル時間: 2,182 ms
• コンパイル使用メモリ: 81,128 KB
• 実行使用メモリ: 69,724 KB
• 最終ジャッジ日時: 2024-06-28 17:42:26
• 合計ジャッジ時間: 26,057 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 27

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;import java.util.Comparator;
import java.util.List;
import java.util.NoSuchElementException;
class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    // i != j => A_i != A_j
    
    void run() {
        FastScanner sc=new FastScanner();
        int N=sc.nextInt();
        int[] T=new int[N];
        int[] D=new int[N];
        double[][] a=new double[N][2];
        for(int i=0;i<N;++i)T[i]=sc.nextInt();
        for(int i=0;i<N;++i)D[i]=sc.nextInt();
        for(int i=0;i<N;++i) {
            a[i][0]=1.*D[i]/T[i];
            a[i][1]=i+1;
        }
        Arrays.sort(a, Comparator.comparing(v->v[0]));
        for(int i=0;i<N;++i) {
            System.out.print((int)Math.round(a[i][1])+(i==N-1?"\n":" "));
        }
    }
    static void tr(Object... objects) {
        System.out.println(Arrays.deepToString(objects));
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX