提出 #13976003
ソースコード 拡げる
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Main implements Runnable {
public static void main(String[] args) {
Thread tt = new Thread(null, new Main(), "", 256 * 1024 * 1024);
tt.start();
}
public void run() {
FastScanner sc = new FastScanner(System.in);
//int[] ar = new int[3];
//ar[0]=Integer.parseInt(sc.next());
//Arrays.parallelSort(ar);
//int n = Integer.parseInt(sc.next());
//int q = Integer.parseInt(sc.next());
//long a = Long.parseLong(sc.next());
String s = sc.next();
//String str = sc.next();
//char s[] = str.toCharArray();
//char a[][] = new char[n];
//ArrayList<Str_4> lists = new ArrayList<Str_4>();
//lists = new ArrayList;
ArrayList<ArrayList<Integer>> tmp = new ArrayList<>();
PrintWriter out = new PrintWriter(System.out);
int n = s.length();
int l = 0;
int r = 1;
ArrayList<String> a = new ArrayList<String>();
while(r < n)
{
if(s.charAt(r)>='A' && s.charAt(r)<='Z')
{
a.add(s.substring(l,r+1));
l=r+1;
r=r+2;
}
else {
r=r+1;
}
}
Collections.sort(a, new Comparator<String>() {
@Override
public int compare(String name1, String name2) {
return name1.compareToIgnoreCase(name2);
}
});
for (int i = 0; i < a.size(); i++) {
out.print(a.get(i));
}
out.println();
out.flush();
}
static class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(String in) {
StringReader sr = new StringReader(in);
reader = new BufferedReader(new BufferedReader(sr));
tokenizer = null;
}
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public long nextInt() {
return Integer.parseInt(next());
}
}
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | F - DoubleCamelCase Sort |
| ユーザ | hkyk |
| 言語 | Java8 (OpenJDK 1.8.0) |
| 得点 | 7 |
| コード長 | 3113 Byte |
| 結果 | AC |
| 実行時間 | 184 ms |
| メモリ | 31668 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 7 / 7 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | example_01.txt, example_02.txt |
| All | example_01.txt, example_02.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt, subtask_01_19.txt, subtask_01_20.txt, subtask_01_21.txt, subtask_01_22.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| example_01.txt | AC | 73 ms | 25044 KiB |
| example_02.txt | AC | 72 ms | 21204 KiB |
| subtask_01_01.txt | AC | 72 ms | 22740 KiB |
| subtask_01_02.txt | AC | 105 ms | 23252 KiB |
| subtask_01_03.txt | AC | 106 ms | 26708 KiB |
| subtask_01_04.txt | AC | 105 ms | 25044 KiB |
| subtask_01_05.txt | AC | 106 ms | 24660 KiB |
| subtask_01_06.txt | AC | 108 ms | 24916 KiB |
| subtask_01_07.txt | AC | 184 ms | 28864 KiB |
| subtask_01_08.txt | AC | 156 ms | 27712 KiB |
| subtask_01_09.txt | AC | 153 ms | 28396 KiB |
| subtask_01_10.txt | AC | 76 ms | 25428 KiB |
| subtask_01_11.txt | AC | 132 ms | 27540 KiB |
| subtask_01_12.txt | AC | 170 ms | 25536 KiB |
| subtask_01_13.txt | AC | 179 ms | 31668 KiB |
| subtask_01_14.txt | AC | 113 ms | 22080 KiB |
| subtask_01_15.txt | AC | 126 ms | 26428 KiB |
| subtask_01_16.txt | AC | 160 ms | 27712 KiB |
| subtask_01_17.txt | AC | 117 ms | 24776 KiB |
| subtask_01_18.txt | AC | 154 ms | 27716 KiB |
| subtask_01_19.txt | AC | 164 ms | 24512 KiB |
| subtask_01_20.txt | AC | 168 ms | 25524 KiB |
| subtask_01_21.txt | AC | 159 ms | 29276 KiB |
| subtask_01_22.txt | AC | 125 ms | 28372 KiB |