結果
| 問題 | No.989 N×Mマス計算（K以上） |
| ユーザー |
 Oland
|
| 提出日時 | 2020-02-16 08:32:11 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 270 ms / 2,000 ms |
| コード長 | 6,911 bytes |
| コンパイル時間 | 2,107 ms |
| コンパイル使用メモリ | 78,968 KB |
| 実行使用メモリ | 42,012 KB |
| 最終ジャッジ日時 | 2024-10-06 14:21:20 |
| 合計ジャッジ時間 | 5,042 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 51 ms
37,092 KB |
| testcase_01 | AC | 52 ms
36,916 KB |
| testcase_02 | AC | 50 ms
37,152 KB |
| testcase_03 | AC | 51 ms
37,176 KB |
| testcase_04 | AC | 49 ms
37,028 KB |
| testcase_05 | AC | 49 ms
36,872 KB |
| testcase_06 | AC | 47 ms
37,008 KB |
| testcase_07 | AC | 48 ms
36,808 KB |
| testcase_08 | AC | 46 ms
36,892 KB |
| testcase_09 | AC | 47 ms
36,660 KB |
| testcase_10 | AC | 177 ms
41,312 KB |
| testcase_11 | AC | 170 ms
40,868 KB |
| testcase_12 | AC | 192 ms
41,004 KB |
| testcase_13 | AC | 140 ms
40,644 KB |
| testcase_14 | AC | 270 ms
42,012 KB |
| testcase_15 | AC | 127 ms
40,480 KB |
| testcase_16 | AC | 150 ms
40,848 KB |
| testcase_17 | AC | 138 ms
40,492 KB |
| testcase_18 | AC | 142 ms
40,388 KB |
| testcase_19 | AC | 174 ms
41,048 KB |
ソースコード
import java.util.*;
import java.io.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
long lcm(long a, long b){return a / gcd(a, b) * b;}
void solve(){
int N = in.nextInt(), M = in.nextInt(), K = in.nextInt();
char op = in.nextChar();
long[] B = in.nextLongArray(M), A = in.nextLongArray(N);
Arrays.sort(A);
Arrays.sort(B);
long sum = 0;
int idx = N-1;
for(int i = 0; i < M; i++){
while(idx >= 0){
long v = op == '+' ? A[idx] + B[i] : A[idx] * B[i];
if(v < K) break;
idx--;
}
sum += N - (idx + 1);
}
out.println(sum);
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}