結果
問題 | No.1951 消えたAGCT(2) |
ユーザー | tenten |
提出日時 | 2023-06-29 17:37:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 678 ms / 3,000 ms |
コード長 | 3,543 bytes |
コンパイル時間 | 2,836 ms |
コンパイル使用メモリ | 102,988 KB |
実行使用メモリ | 56,276 KB |
最終ジャッジ日時 | 2023-09-20 12:53:07 |
合計ジャッジ時間 | 12,251 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,576 KB |
testcase_01 | AC | 43 ms
49,788 KB |
testcase_02 | AC | 42 ms
49,616 KB |
testcase_03 | AC | 43 ms
49,400 KB |
testcase_04 | AC | 43 ms
49,612 KB |
testcase_05 | AC | 43 ms
49,696 KB |
testcase_06 | AC | 43 ms
49,564 KB |
testcase_07 | AC | 43 ms
49,360 KB |
testcase_08 | AC | 200 ms
55,680 KB |
testcase_09 | AC | 195 ms
55,552 KB |
testcase_10 | AC | 193 ms
55,708 KB |
testcase_11 | AC | 202 ms
55,516 KB |
testcase_12 | AC | 174 ms
55,992 KB |
testcase_13 | AC | 84 ms
50,804 KB |
testcase_14 | AC | 640 ms
55,676 KB |
testcase_15 | AC | 506 ms
55,576 KB |
testcase_16 | AC | 520 ms
55,700 KB |
testcase_17 | AC | 654 ms
55,644 KB |
testcase_18 | AC | 628 ms
55,696 KB |
testcase_19 | AC | 635 ms
55,876 KB |
testcase_20 | AC | 656 ms
56,276 KB |
testcase_21 | AC | 191 ms
55,588 KB |
testcase_22 | AC | 200 ms
55,216 KB |
testcase_23 | AC | 195 ms
56,056 KB |
testcase_24 | AC | 202 ms
55,412 KB |
testcase_25 | AC | 198 ms
55,852 KB |
testcase_26 | AC | 678 ms
55,728 KB |
testcase_27 | AC | 666 ms
55,808 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); char[] inputs = sc.next().toCharArray(); BinaryIndexedTree bit = new BinaryIndexedTree(n + 1); for (int i = 1; i <= n; i++) { bit.add(i, 1); } ArrayList<Character> list = new ArrayList<>(); int[] counts = new int[26]; for (char c : inputs) { counts[c - 'A']++; } String agct = "AGCT"; int[] idxes = new int[4]; for (int i = 0; i < 4; i++) { idxes[i] = agct.charAt(i) - 'A'; } int ans = 0; int plus = 0; while (true) { int current = 0; for (int x : idxes) { current += counts[(x + plus) % 26]; } if (current == 0) { break; } int left = 0; int right = n; while (right - left > 1) { int m = (left + right) / 2; if (bit.getSum(m) < current) { left = m; } else { right = m; } } char c = inputs[right - 1]; counts[c - 'A']--; bit.add(right, -1); plus += 26 - counts[c - 'A'] % 26; plus %= 26; ans++; } System.out.println(ans); } } class BinaryIndexedTree { int size; int[] tree; public BinaryIndexedTree(int size) { this.size = size; tree = new int[size]; } public void add(int idx, int value) { int mask = 1; while (idx < size) { if ((idx & mask) != 0) { tree[idx] += value; idx += mask; } mask <<= 1; } } public int getSum(int from, int to) { return getSum(to) - getSum(from - 1); } public int getSum(int x) { int mask = 1; int ans = 0; while (x > 0) { if ((x & mask) != 0) { ans += tree[x]; x -= mask; } mask <<= 1; } return ans; } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }