結果
| 問題 | No.949 飲酒プログラミングコンテスト |
| ユーザー |
 Oland
|
| 提出日時 | 2019-12-12 18:57:01 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,458 bytes |
| コンパイル時間 | 2,868 ms |
| コンパイル使用メモリ | 78,616 KB |
| 実行使用メモリ | 55,640 KB |
| 最終ジャッジ日時 | 2023-09-07 18:50:53 |
| 合計ジャッジ時間 | 7,191 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 43 ms
49,632 KB |
| testcase_01 | AC | 43 ms
49,700 KB |
| testcase_02 | AC | 43 ms
49,728 KB |
| testcase_03 | AC | 43 ms
49,608 KB |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | AC | 47 ms
49,772 KB |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | AC | 51 ms
49,840 KB |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | AC | 83 ms
51,848 KB |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | AC | 81 ms
52,424 KB |
| testcase_18 | AC | 97 ms
53,636 KB |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | AC | 53 ms
49,764 KB |
| testcase_24 | AC | 78 ms
52,220 KB |
| testcase_25 | WA | - |
| testcase_26 | AC | 97 ms
53,188 KB |
| testcase_27 | WA | - |
| testcase_28 | AC | 96 ms
53,184 KB |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | AC | 91 ms
53,028 KB |
| testcase_32 | WA | - |
ソースコード
import java.io.*;
import java.util.*;
@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();
int[] A = in.nextIntArray(N+1);
int[] B = in.nextIntArray(N+1);
ArrayList<Integer> S = new ArrayList<>();
int idxA = 0, idxB = 0;
for(int i = 0; i < N; i++){
int s1 = A[idxA+1] + B[idxB];
int s2 = A[idxA] + B[idxB+1];
if(s1 > s2){
S.add(s1);
idxA++;
}else{
S.add(s2);
idxB++;
}
}
ArrayList<Integer> D = new ArrayList<>();
for(int i = 0; i < N; i++) D.add(in.nextInt());
Collections.sort(D, Collections.reverseOrder());
int ok = N, ng = -1;
while(Math.abs(ok - ng) > 1){
int mid = (ok + ng) / 2;
boolean isOk = true;
for(int i = mid; i < N; i++){
if(S.get(i-mid) < D.get(i)){
isOk = false;
break;
}
}
if(isOk) ok = mid;
else ng = mid;
}
out.println(N-ok);
}
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 = "output.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;
}
}
}