Submission #322960


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.Scanner;

/**
 * Created by hama_du
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        long answer = 0;
        char[] l = in.next().toCharArray();
        int n = l.length;
        for (int i = 0 ; i < n ; i++) {
            int to = i;
            boolean ni = true;
            while (to < n) {
                if (ni) {
                    if (l[to] != '2') {
                        break;
                    }
                } else {
                    if (l[to] != '5') {
                        break;
                    }
                }
                to++;
                ni = !ni;
            }
            long mt = (to - i) / 2;
            answer += (1L + mt) * mt / 2;
            if (i == to) {
                i = to;
            } else {
                i = to - 1;
            }
        }
        out.println(answer);
        out.flush();
    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream) {
              this.stream = stream;
        }

        public int next() {
              if (numChars == -1)
                    throw new InputMismatchException();
              if (curChar >= numChars) {
                    curChar = 0;
                    try {
                          numChars = stream.read(buf);
                    } catch (IOException e) {
                          throw new InputMismatchException();
                    }
                    if (numChars <= 0)
                          return -1;
              }
              return buf[curChar++];
        }

        public int nextInt() {
              int c = next();
              while (isSpaceChar(c))
                    c = next();
              int sgn = 1;
              if (c == '-') {
                    sgn = -1;
                    c = next();
              }
              int res = 0;
              do {
                    if (c < '0' || c > '9')
                          throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = next();
              } while (!isSpaceChar(c));
              return res * sgn;
        }

        public boolean isSpaceChar(int c) {
              if (filter != null)
                    return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
        }
    }
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User hamadu
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 3028 Byte
Status AC
Exec Time 613 ms
Memory 26280 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 18
AC × 30
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 527 ms 23216 KB
subtask0_sample_02.txt AC 527 ms 23116 KB
subtask0_sample_03.txt AC 522 ms 23116 KB
subtask0_sample_04.txt AC 534 ms 23128 KB
subtask0_sample_05.txt AC 523 ms 23172 KB
subtask1_01.txt AC 550 ms 24708 KB
subtask1_02.txt AC 565 ms 24520 KB
subtask1_03.txt AC 570 ms 23856 KB
subtask1_04.txt AC 562 ms 24588 KB
subtask1_05.txt AC 562 ms 24496 KB
subtask1_06.txt AC 567 ms 24352 KB
subtask1_07.txt AC 594 ms 24556 KB
subtask1_08.txt AC 613 ms 24452 KB
subtask1_09.txt AC 545 ms 24556 KB
subtask1_10.txt AC 509 ms 23148 KB
subtask1_11.txt AC 511 ms 23176 KB
subtask1_12.txt AC 568 ms 24664 KB
subtask1_13.txt AC 531 ms 23132 KB
subtask2_01.txt AC 605 ms 26204 KB
subtask2_02.txt AC 612 ms 25912 KB
subtask2_03.txt AC 613 ms 25984 KB
subtask2_04.txt AC 595 ms 26264 KB
subtask2_05.txt AC 583 ms 26280 KB
subtask2_06.txt AC 577 ms 26224 KB
subtask2_07.txt AC 595 ms 26216 KB
subtask2_08.txt AC 603 ms 26180 KB
subtask2_09.txt AC 573 ms 25096 KB
subtask2_10.txt AC 566 ms 24292 KB
subtask2_11.txt AC 563 ms 24584 KB
subtask2_12.txt AC 566 ms 24688 KB