#778269 (Java) No.2008 Super Worker

• 問題: No.2008 Super Worker
• ユーザー: 37zigen
• 提出日時: 2022-07-15 21:35:33
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 578 ms / 2,000 ms
• コード長: 3,410 bytes
• コンパイル時間: 2,752 ms
• コンパイル使用メモリ: 82,896 KB
• 実行使用メモリ: 54,080 KB
• 最終ジャッジ日時: 2024-06-27 17:05:18
• 合計ジャッジ時間: 12,075 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 33

ソースコード

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
108
109
110
111
112
113
114
115
116
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main implements Runnable { //Runnableを実装する
        public static void main(String[] args) {
            new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); //16MBスタックを確保して実行
        }
        
        long pow(long a, long n, long m) {
            if (n==0) return 1;
            return pow(a*a%m,n/2,m)*(n%2==1?a:1)%m;
        }
        
        long mod=(long)1e9+7;
        
        void solve() {
            FastScanner sc=new FastScanner();
            PrintWriter pw=new PrintWriter(System.out);
            int N=sc.nextInt();
            long[] A=new long[N];
            long[] B=new long[N];
            for (int i=0;i<N;++i) {
                A[i]=sc.nextLong();
            }
            for (int i=0;i<N;++i) {
                B[i]=sc.nextLong();
            }
            Integer[] ord=new Integer[N];
            Arrays.setAll(ord, i->i);
            Arrays.sort(ord, (x, y) -> -Long.compare((1-B[y])*A[x], (1-B[x])*A[y]));
            long ans=0;
            long level=1;
            for (int i : ord) {
                ans+=A[i]*level%mod;
                ans%=mod;
                level=level*B[i]%mod;
            }
            System.out.println(ans);
            pw.close();
        }
        
        
        public void run() {
            solve();
        }
        
        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;}
        private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
        public boolean hasNext() { skipUnprintable(); 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() {
            return (int)nextLong();
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX