Submission #1411302


Source Code Expand

import java.util.*;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n=sc.nextInt();
    sc.nextLine();
    String s=sc.nextLine();
    int[] dp=new int[n];
    for(int i=0;i<n;i++){
      dp[i]=0;
    }
    for(int k=0;k<3;k++){
      if(s.charAt(k)=='.'){
        dp[k]=0;
      }
      else{
        dp[k]=1;
      }
    }
    for(int j=3;j<n;j++){
      if(dp[j-1]>=dp[j-2] && dp[j-2]>=dp[j-3]){
        dp[j]=dp[j-3];
      }
      else if(dp[j-1]>=dp[j-2] && dp[j-2]<dp[j-3]){
        dp[j]=dp[j-2];
      }
      else if(dp[j-2]>dp[j-1] && dp[j-3]>dp[j-2]){
        dp[j]=dp[j-1];
      }
      else if(dp[j-2]>dp[j-1] && dp[j-3]<dp[j-2]){
        if(dp[j-1]>dp[j-3]){
          dp[j]=dp[j-3];
        }
        else{
          dp[j]=dp[j-1];
        }
      }
      if(s.charAt(j)=='X'){
        dp[j]++;
      }       
    }
    if(dp[n-1]>=dp[n-2] && dp[n-2]>=dp[n-3]){
      System.out.println(dp[n-3]);
    }
    else if(dp[n-1]>=dp[n-2] && dp[n-2]<dp[n-3]){
      System.out.println(dp[n-2]);
    }
    else if(dp[n-2]>dp[n-1] && dp[n-3]>dp[n-2]){
      System.out.println(dp[n-1]);
    }
    else if(dp[n-2]>dp[n-1] && dp[n-3]<dp[n-2]){
      if(dp[n-1]>dp[n-3]){
        System.out.println(dp[n-3]);
      }
      else{
        System.out.println(dp[n-1]);
      }
    }
  }
}

Submission Info

Submission Time
Task B - 雨上がり
User wilder0626
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 1411 Byte
Status WA
Exec Time 99 ms
Memory 23636 KB

Judge Result

Set Name All
Score / Max Score 0 / 50
Status
AC × 17
WA × 26
Set Name Test Cases
All case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt
Case Name Status Exec Time Memory
case_000.txt AC 95 ms 21844 KB
case_001.txt AC 92 ms 21844 KB
case_002.txt AC 92 ms 20560 KB
case_003.txt AC 92 ms 18644 KB
case_004.txt AC 92 ms 19668 KB
case_005.txt WA 93 ms 21716 KB
case_006.txt AC 95 ms 19924 KB
case_007.txt WA 94 ms 19540 KB
case_008.txt AC 92 ms 21588 KB
case_009.txt AC 90 ms 19796 KB
case_010.txt WA 93 ms 21588 KB
case_011.txt AC 92 ms 21204 KB
case_012.txt AC 91 ms 20692 KB
case_013.txt WA 92 ms 19796 KB
case_014.txt WA 92 ms 19412 KB
case_015.txt WA 92 ms 19540 KB
case_016.txt WA 91 ms 19664 KB
case_017.txt WA 91 ms 18644 KB
case_018.txt WA 91 ms 21844 KB
case_019.txt AC 91 ms 19924 KB
case_020.txt WA 93 ms 19156 KB
case_021.txt WA 93 ms 19668 KB
case_022.txt WA 92 ms 21844 KB
case_023.txt WA 91 ms 20564 KB
case_024.txt AC 91 ms 20564 KB
case_025.txt WA 93 ms 21076 KB
case_026.txt WA 92 ms 20556 KB
case_027.txt WA 99 ms 23636 KB
case_028.txt AC 92 ms 21588 KB
case_029.txt AC 92 ms 19792 KB
case_030.txt WA 92 ms 18896 KB
case_031.txt WA 91 ms 21844 KB
case_032.txt AC 92 ms 21844 KB
case_033.txt WA 92 ms 19792 KB
case_034.txt WA 92 ms 21716 KB
case_035.txt AC 91 ms 19924 KB
case_036.txt WA 92 ms 19412 KB
case_037.txt AC 91 ms 21716 KB
case_038.txt WA 90 ms 18640 KB
case_039.txt WA 92 ms 20820 KB
case_040.txt WA 92 ms 21716 KB
case_041.txt WA 91 ms 18640 KB
case_042.txt WA 92 ms 21844 KB