提出 #73375859


ソースコード 拡げる

import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.NoSuchElementException;

class Main{
   public static void main(String[]args){
//	 Scanner sc = new Scanner(System.in);
     ArrayList<Integer> List = new ArrayList<Integer>();
     ArrayList<String> SList = new ArrayList<String>();
     int N = nextInt();
     int L = nextInt();
     int W = nextInt();
     int ans = 0;
     for(int i = 0;i < N;i++){
       int a = nextInt();
       if(a >= L - W && a <= L + W){
    	 ans++;
       }
     }
     System.out.println(ans);
   }
   // <Fast Scanner> START -------------------------------------------------
   static InputStream in = System.in;static byte[] buffer = new byte[1024];static int length = 0, p = 0;public static boolean hasNextByte(){
   if(p < length)return true;else{p = 0;try{length = in.read(buffer);}catch (Exception e) {e.printStackTrace();}if (length == 0) return false;}
   return true;}public static int readByte(){if(hasNextByte() == true)return buffer[p++];return -1;}public static boolean isPrintable(int n){return 33<=n&&n<=126;}
   public static void skip(){while(hasNextByte() && !isPrintable(buffer[p])) p++;}public static boolean hasNext () {skip(); return hasNextByte();}
   public static String next(){if(!hasNext())throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int temp = readByte();while(isPrintable(temp)){
   sb.appendCodePoint(temp);temp = readByte();}return sb.toString();}public static int nextInt(){return Math.toIntExact(nextLong());}public static int[] 
   nextInts(int n){int[] ar = new int[n];for(int i=0; i<n; i++)ar[i] = nextInt();return ar;}public static long nextLong(){if(!hasNext())throw new NoSuchElementException();
   boolean minus = false;int temp = readByte();if(temp == '-'){minus = true;temp = readByte();}if (temp<'0' || '9'<temp) throw new NumberFormatException();long n = 0;
   while(isPrintable(temp)){if('0'<=temp && temp<='9'){n *= 10;n += temp - '0';}temp = readByte();}return minus? -n : n;
   }// Fast Scannerここまで
   static void exit(String s){System.out.println(s);System.exit(0);}
   // 値の二部探索 それ未満の数を返す(重複ありだと使えない)
   static int BS(ArrayList<Integer>l,int a){int i=Collections.binarySearch(l,a);if(i<0){i++;}i=Math.abs(i);return i;}
}










提出情報

提出日時
問題 A - 的当てゲーム
ユーザ asdf12
言語 Java24 (OpenJDK 24.0.2)
得点 200
コード長 2401 Byte
結果 AC
実行時間 79 ms
メモリ 40120 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 200 / 200
結果
AC × 5
AC × 68
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 42 ms 38008 KiB
in02.txt AC 39 ms 38192 KiB
in03.txt AC 38 ms 37808 KiB
in04.txt AC 38 ms 37992 KiB
in05.txt AC 38 ms 37968 KiB
in06.txt AC 38 ms 37820 KiB
in07.txt AC 38 ms 37800 KiB
in08.txt AC 69 ms 39616 KiB
in09.txt AC 61 ms 39588 KiB
in10.txt AC 74 ms 39720 KiB
in11.txt AC 62 ms 39388 KiB
in12.txt AC 62 ms 39600 KiB
in13.txt AC 76 ms 40080 KiB
in14.txt AC 78 ms 39620 KiB
in15.txt AC 78 ms 40092 KiB
in16.txt AC 39 ms 37660 KiB
in17.txt AC 75 ms 40016 KiB
in18.txt AC 61 ms 39588 KiB
in19.txt AC 59 ms 39876 KiB
in20.txt AC 69 ms 39552 KiB
in21.txt AC 73 ms 39816 KiB
in22.txt AC 79 ms 40120 KiB
in23.txt AC 77 ms 39996 KiB
in24.txt AC 69 ms 39832 KiB
in25.txt AC 39 ms 37984 KiB
in26.txt AC 39 ms 37868 KiB
in27.txt AC 39 ms 37788 KiB
in28.txt AC 39 ms 38048 KiB
in29.txt AC 39 ms 37940 KiB
in30.txt AC 38 ms 37684 KiB
in31.txt AC 38 ms 37780 KiB
in32.txt AC 38 ms 37808 KiB
in33.txt AC 38 ms 37964 KiB
in34.txt AC 38 ms 38024 KiB
in35.txt AC 37 ms 38008 KiB
in36.txt AC 37 ms 37924 KiB
in37.txt AC 74 ms 39380 KiB
in38.txt AC 76 ms 39852 KiB
in39.txt AC 72 ms 39652 KiB
in40.txt AC 71 ms 39888 KiB
in41.txt AC 74 ms 39576 KiB
in42.txt AC 69 ms 39556 KiB
in43.txt AC 38 ms 38080 KiB
in44.txt AC 70 ms 39736 KiB
in45.txt AC 72 ms 39468 KiB
in46.txt AC 72 ms 39372 KiB
in47.txt AC 71 ms 39688 KiB
in48.txt AC 61 ms 39616 KiB
in49.txt AC 38 ms 37912 KiB
in50.txt AC 37 ms 38004 KiB
in51.txt AC 38 ms 37984 KiB
in52.txt AC 37 ms 38068 KiB
in53.txt AC 38 ms 37636 KiB
in54.txt AC 38 ms 37564 KiB
in55.txt AC 37 ms 37776 KiB
in56.txt AC 37 ms 38044 KiB
in57.txt AC 39 ms 37808 KiB
in58.txt AC 39 ms 38220 KiB
in59.txt AC 38 ms 37980 KiB
in60.txt AC 38 ms 37988 KiB
in61.txt AC 39 ms 38000 KiB
in62.txt AC 39 ms 37804 KiB
in63.txt AC 40 ms 38152 KiB
sample01.txt AC 38 ms 38020 KiB
sample02.txt AC 38 ms 37932 KiB
sample03.txt AC 38 ms 37964 KiB
sample04.txt AC 38 ms 38000 KiB
sample05.txt AC 37 ms 37652 KiB