답안 #828123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828123	2023-08-17T05:32:38 Z	rahulverma	JJOOII 2 (JOI20_ho_t2)	Java 11	컴파일 오류	0 ms	0 KB

ho_t2

import java.io.*;
import java.util.*;

public class JOIString {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("ho_t2"));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		PrintWriter pw = new PrintWriter("ho_t2");
		String s = br.readLine();
		
		ArrayList<Integer> J = new ArrayList<Integer>();
		ArrayList<Integer> O = new ArrayList<Integer>();
		ArrayList<Integer> I = new ArrayList<Integer>();
		
		for(int i = 0; i < n; i++) {
			if(s.charAt(i) == 'J') J.add(i);
			else if(s.charAt(i) == 'O') O.add(i);
			else I.add(i);
		}
		if(J.size() < k || O.size() < k || I.size() < k) {
			pw.println(-1);
			pw.close();
			return;
		}
		
		int[] jPrefix = new int[J.size()];
		int[] oPrefix = new int[O.size()];
		int[] iPrefix = new int[I.size()];
		for(int i = 1; i < J.size(); i++) jPrefix[i] = jPrefix[i - 1] + J.get(i) - J.get(i - 1) - 1;
		for(int i = 1; i < O.size(); i++) oPrefix[i] = oPrefix[i - 1] + O.get(i) - O.get(i - 1) - 1;
		for(int i = 1; i < I.size(); i++) iPrefix[i] = iPrefix[i - 1] + I.get(i) - I.get(i - 1) - 1;

		
		int ans = n + 1;
		for(int i = 0; i < J.size() - k + 1; i++) {
			int cur = 0;
			int add = k - 1;
			int max = J.get(i + add);
			cur += jPrefix[i + add] - jPrefix[i];
			int left = 0;
			int right = O.size();
			while(left < right) {
				int mid = left + (right - left) / 2;
				if(O.get(mid) < max) {
					left = mid + 1;
				}
				else {
					right = mid;
				}
			}
			if(O.size() - left < k) {
				continue;
			}
			cur += O.get(left) - J.get(i + add) - 1;
			cur += oPrefix[left + add] - oPrefix[left];
			int val = O.get(left + add);
			int og = left;
			left = 0;
			right = O.size();
			while(left < right) {
				int mid = left + (right - left) / 2;
				if(I.get(mid) < val) {
					left = mid + 1;
				}
				else {
					right = mid;
				}
			}
			if(I.size() - left < k) {
				continue;
			}
			cur += I.get(left) - O.get(og + add) - 1;
			cur += iPrefix[left + add] - iPrefix[left];
			ans = Math.min(ans, cur);
		}
		if(ans == n + 1) {
			pw.println(-1);
		}
		else {
			pw.println(ans);
		}
		pw.close();
		return;
	}

}

Compilation message

ho_t2.java:4: error: class JOIString is public, should be declared in a file named JOIString.java
public class JOIString {
       ^
1 error