結果

問題 No.684 Prefix Parenthesis
ユーザー uwiuwi
提出日時 2018-05-11 22:37:07
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,004 bytes
コンパイル時間 5,592 ms
コンパイル使用メモリ 81,136 KB
実行使用メモリ 59,172 KB
最終ジャッジ日時 2024-06-28 08:45:06
合計ジャッジ時間 8,776 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,452 KB
testcase_01 AC 53 ms
50,044 KB
testcase_02 AC 54 ms
50,284 KB
testcase_03 AC 99 ms
52,028 KB
testcase_04 AC 109 ms
54,196 KB
testcase_05 AC 120 ms
54,584 KB
testcase_06 AC 98 ms
51,512 KB
testcase_07 WA -
testcase_08 AC 81 ms
50,868 KB
testcase_09 WA -
testcase_10 AC 138 ms
57,544 KB
testcase_11 WA -
testcase_12 AC 83 ms
51,256 KB
testcase_13 AC 128 ms
57,348 KB
testcase_14 AC 137 ms
57,600 KB
testcase_15 AC 102 ms
52,020 KB
testcase_16 AC 89 ms
53,112 KB
testcase_17 AC 90 ms
53,264 KB
testcase_18 AC 55 ms
50,400 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 135 ms
57,208 KB
testcase_22 AC 95 ms
56,048 KB
testcase_23 AC 97 ms
55,808 KB
testcase_24 AC 96 ms
55,628 KB
testcase_25 AC 137 ms
56,756 KB
testcase_26 AC 55 ms
50,112 KB
testcase_27 AC 55 ms
49,880 KB
testcase_28 AC 54 ms
49,840 KB
testcase_29 WA -
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180511;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int simulate(int a, int b, int c, int d, int e, int f)
	{
		int o = a;
		int ret = 0;
		ret += Math.min(o, b);
		o -= Math.min(o, b);
		o += c;
		ret += Math.min(o, d);
		o -= Math.min(o, d);
		o += e;
		ret += Math.min(o, f);
		return ret;
	}
	
	void solve()
	{
		// O+(c1,o1) +(c2,o2)+C
		// min(O,c1) max(O-c1,0)+o1 
		int n = ni();
		char[] s = ns(n);
		
		int[][] as = new int[n][];
		int o = 0, c = 0;
		int g = 0;
		int hh = 0;
		long ans = 0;
		for(int i = 0;i < n;i++){
			if(s[i] == '('){
				o++;
				hh++;
			}else{
				c++;
				hh--;
				if(hh >= 0){
					g++;
				}
			}
			ans += g;
			as[i] = new int[]{-1, o-g, c-g};
		}
		Arrays.sort(as, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return -(simulate(0, a[2], a[1], b[2], b[1], 0) - simulate(0, b[2], b[1], a[2], a[1], 0));
			}
		});
		long open = 0;
		for(int[] a : as){
			ans += Math.min(open, a[2]);
			open -= Math.min(open, a[2]);
			open += a[1];
		}
		out.println(ans*2);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0