#12883 (Java21) No.22 括弧の対応

• 問題: No.22 括弧の対応
• ユーザー: threepipes_s
• 提出日時: 2015-02-17 00:10:44
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 47 ms / 5,000 ms
• コード長: 2,238 bytes
• コンパイル時間: 2,290 ms
• コンパイル使用メモリ: 74,928 KB
• 実行使用メモリ: 49,700 KB
• 最終ジャッジ日時: 2023-09-27 12:49:29
• 合計ジャッジ時間: 4,130 ms
• ジャッジサーバーID （参考情報）: judge13 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	44 ms; 49,324 KB
testcase_01	AC	45 ms; 49,700 KB
testcase_02	AC	45 ms; 49,452 KB
testcase_03	AC	47 ms; 49,440 KB
testcase_04	AC	46 ms; 49,320 KB
testcase_05	AC	45 ms; 49,504 KB
testcase_06	AC	45 ms; 49,476 KB
testcase_07	AC	45 ms; 49,256 KB
testcase_08	AC	45 ms; 49,472 KB
testcase_09	AC	44 ms; 49,288 KB
testcase_10	AC	45 ms; 49,268 KB
testcase_11	AC	44 ms; 49,404 KB
testcase_12	AC	45 ms; 49,152 KB
testcase_13	AC	45 ms; 49,688 KB
testcase_14	AC	44 ms; 49,348 KB
testcase_15	AC	46 ms; 49,656 KB
testcase_16	AC	46 ms; 49,428 KB
testcase_17	AC	45 ms; 49,516 KB
testcase_18	AC	45 ms; 49,548 KB

ソースコード

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.TreeSet;
public class Main {
	public static boolean result[];
	public static int dp[][];
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		int k = in.nextInt()-1;
		String s = in.nextToken();
		int count = 0;
		int res = 0;
		if(s.charAt(k) == ')'){
			for(int i=k; i>=0; i--){
				if(s.charAt(i) == ')') count++;
				else count--;
				if(count == 0){
					res = i;
					break;
				}
			}
		}else{
			for(int i=k; i<n; i++){
				if(s.charAt(i) == '(') count++;
				else count--;
				if(count == 0){
					res = i;
					break;
				}
			}
		}
		System.out.println(res+1);
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}

class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}