Submission #3438155
Source Code Expand
import java.util.Arrays; import java.util.Scanner; class Main{ static char[][] map; static int H; static int W; public static void main(String[] args) { Scanner sc = new Scanner(System.in); //文字の入力 int N = sc.nextInt(); String string = sc.next(); int ans = 0; for(int i = 0;i <= (N+1)/2;i++){ int sub = 0; char[] mae = string.substring(0,i).toCharArray(); char[] ushiro = string.substring(i).toCharArray(); Arrays.sort(mae); Arrays.sort(ushiro); int j = 0; while(true){ if(j == mae.length){ break; } while(true){ if(j == mae.length-1){ break; } if(mae[j] != mae[j+1]){ //aab みたいな時二つ目に移動 break; } j++; } for(int k = 0;k < ushiro.length;k++){ //後ろにあるか判定 if(mae[j] == ushiro[k]){ sub++; break; } } j++; } ans = Math.max(ans, sub); } System.out.println(ans); } } class Pair implements Comparable{ String from; int end; @Override public int compareTo(Object other) { Pair otherpair = (Pair)other; return end - otherpair.end; } }
Submission Info
Submission Time | |
---|---|
Task | B - Cut and Count |
User | oyr |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 1224 Byte |
Status | WA |
Exec Time | 113 ms |
Memory | 22484 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 113 ms | 19284 KB |
sample_02.txt | AC | 95 ms | 21716 KB |
sample_03.txt | AC | 95 ms | 19796 KB |
subtask_1_01.txt | AC | 94 ms | 20820 KB |
subtask_1_02.txt | AC | 105 ms | 21972 KB |
subtask_1_03.txt | AC | 97 ms | 20948 KB |
subtask_1_04.txt | AC | 97 ms | 20948 KB |
subtask_1_05.txt | AC | 95 ms | 18772 KB |
subtask_1_06.txt | AC | 95 ms | 18900 KB |
subtask_1_07.txt | AC | 94 ms | 18768 KB |
subtask_1_08.txt | AC | 107 ms | 19668 KB |
subtask_1_09.txt | AC | 108 ms | 22228 KB |
subtask_1_10.txt | AC | 94 ms | 21844 KB |
subtask_1_11.txt | AC | 95 ms | 21204 KB |
subtask_1_12.txt | AC | 95 ms | 19156 KB |
subtask_1_13.txt | AC | 108 ms | 20564 KB |
subtask_1_14.txt | WA | 109 ms | 22356 KB |
subtask_1_15.txt | AC | 107 ms | 22484 KB |
subtask_1_16.txt | AC | 109 ms | 19412 KB |
subtask_1_17.txt | AC | 107 ms | 21844 KB |
subtask_1_18.txt | AC | 108 ms | 20308 KB |
subtask_1_19.txt | AC | 97 ms | 21716 KB |