oj.uz

답안 #318740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318740 2020-11-03T05:02:56 Z anishrajeev Cipele (COCI18_cipele) Java 11
45 / 90
 1000 ms 45116 KB 
import java.io.*;
import java.util.*;

public class cipele {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        //BufferedReader bf = new BufferedReader(new FileReader("tester.in"));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        StringTokenizer stk = new StringTokenizer(bf.readLine());
        int N = Integer.parseInt(stk.nextToken());
        int M = Integer.parseInt(stk.nextToken());
        ArrayList<Integer> less = new ArrayList<>();
        ArrayList<Integer> more = new ArrayList<>();
        if(N < M){
            stk = new StringTokenizer(bf.readLine());
            for(int i = 0; i < N; i++)less.add(Integer.parseInt(stk.nextToken()));
            stk = new StringTokenizer(bf.readLine());
            for(int i = 0; i < M; i++)more.add(Integer.parseInt(stk.nextToken()));
        }
        else{
            stk = new StringTokenizer(bf.readLine());
            for(int i = 0; i < N; i++)more.add(Integer.parseInt(stk.nextToken()));
            stk = new StringTokenizer(bf.readLine());
            for(int i = 0; i < M; i++)less.add(Integer.parseInt(stk.nextToken()));
        }
        Collections.sort(less);
        Collections.sort(more);
        int start = 0, end = Integer.MAX_VALUE;
        while(start!=end){
            int mid = (start+end)/2;
            if(verify(less,more, mid)) end = mid;
            else start = mid+1;
        }
        System.out.println(start);
    }
    public static boolean verify(ArrayList<Integer> less, ArrayList<Integer> more, int target){
        int l = 0;
        int m = 0;
        while(l < less.size()){
            boolean matched = false;
            int matchnum = 0;
            for(int i = m; i < more.size(); i++){
                if(Math.abs(more.get(i)-less.get(l)) <= target){
                    matched = true;
                    matchnum = i;
                    break;
                }
            }
            if(matched)m = matchnum+1;
            else return false;
            l++;
        }
        return true;
    }
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 604 ms 39580 KB Output is correct
2 Execution timed out 1097 ms 45116 KB Time limit exceeded

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1062 ms 43876 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 12432 KB Output is correct
2 Correct 300 ms 16652 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 13124 KB Output is correct
2 Correct 309 ms 16044 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 13708 KB Output is correct
2 Correct 299 ms 15872 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 13868 KB Output is correct
2 Correct 283 ms 16388 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 14004 KB Output is correct
2 Correct 276 ms 16528 KB Output is correct

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1084 ms 40720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1110 ms 42304 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1022 ms 38892 KB Time limit exceeded
2 Halted 0 ms 0 KB -