結果
問題 | No.346 チワワ数え上げ問題 |
ユーザー |
![]() |
提出日時 | 2016-07-12 03:05:45 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 230 ms / 2,000 ms |
コード長 | 3,516 bytes |
コンパイル時間 | 2,321 ms |
コンパイル使用メモリ | 77,884 KB |
実行使用メモリ | 45,692 KB |
最終ジャッジ日時 | 2024-10-14 14:11:05 |
合計ジャッジ時間 | 5,317 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
import java.io.*;import java.math.*;import java.util.*;import java.util.Map.Entry;class Main {static int[] vy = {1,0,-1,0};static int[] vx = {0,1,0,-1};static long mod = 1000000007;static HashMap<String,Boolean> map = new HashMap<String,Boolean>();public static void main(String[] args) {FastScanner sc = new FastScanner();//Scanner sc = new Scanner(System.in);char[] s = sc.next().toCharArray();int[] sum = new int[s.length];for(int i = s.length-1; i > 0; i--) {if(s[i] == 'w') sum[i]++;sum[i-1] = sum[i];}BigInteger bi = new BigInteger("0");for(int i = 0; i < s.length; i++) {if(s[i] == 'c') {bi = bi.add(new BigInteger(String.valueOf(sum[i])).multiply(new BigInteger(String.valueOf(sum[i]-1))).divide(new BigInteger("2")));}}System.out.println(bi.toString(10));}static class FastScanner {private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}public boolean hasNext() { skipUnprintable(); return hasNextByte();}public String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {if (!hasNext()) throw new NoSuchElementException();int n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}}}