結果

問題 No.910 素数部分列
ユーザー kitakitalilykitakitalily
提出日時 2019-10-18 23:04:14
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,131 bytes
コンパイル時間 3,272 ms
コンパイル使用メモリ 79,220 KB
実行使用メモリ 57,568 KB
最終ジャッジ日時 2024-06-25 18:50:04
合計ジャッジ時間 22,431 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
42,320 KB
testcase_01 AC 56 ms
36,600 KB
testcase_02 AC 57 ms
36,860 KB
testcase_03 AC 56 ms
36,900 KB
testcase_04 AC 59 ms
36,688 KB
testcase_05 AC 59 ms
36,736 KB
testcase_06 AC 55 ms
36,808 KB
testcase_07 AC 56 ms
36,708 KB
testcase_08 AC 56 ms
36,504 KB
testcase_09 AC 55 ms
36,752 KB
testcase_10 AC 56 ms
36,536 KB
testcase_11 AC 56 ms
36,784 KB
testcase_12 AC 56 ms
36,784 KB
testcase_13 WA -
testcase_14 AC 55 ms
36,888 KB
testcase_15 WA -
testcase_16 AC 58 ms
36,900 KB
testcase_17 WA -
testcase_18 AC 57 ms
36,816 KB
testcase_19 AC 58 ms
36,872 KB
testcase_20 WA -
testcase_21 AC 56 ms
36,772 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 TLE -
testcase_30 WA -
testcase_31 TLE -
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 TLE -
testcase_41 TLE -
testcase_42 TLE -
testcase_43 TLE -
testcase_44 TLE -
testcase_45 TLE -
testcase_46 TLE -
testcase_47 TLE -
testcase_48 AC 136 ms
56,544 KB
testcase_49 AC 139 ms
56,508 KB
testcase_50 AC 152 ms
57,072 KB
testcase_51 AC 130 ms
52,040 KB
testcase_52 AC 999 ms
57,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
	static long mod = 998244353;
	static int INF = 1000000000;
 	public static void main(String[] args){
		FastScanner scanner = new FastScanner();
		int n = scanner.nextInt();
		String s = scanner.next();
		int ans = 0;
		for(int i = 0; i < n; i++){
			if(s.charAt(i) == '3' ||s.charAt(i) == '5' || s.charAt(i) == '7'){
				ans++;
			}
		}
		ArrayList<Integer> one = new ArrayList<Integer>();
		ArrayList<Integer> nine = new ArrayList<Integer>();
		for(int i = 0; i < n; i++){
			if(s.charAt(i) == '1'){
				one.add(i);
			}else if(s.charAt(i) == '9'){
				nine.add(i);
			}
		}
		//System.out.println(one);
		//one.remove(1);
		//one.remove(0);
		//System.out.println(one);
		//System.out.println(one.isEmpty());
		//System.out.println(one.get(0));
		while(!one.isEmpty() && !nine.isEmpty()){
			int onetop = one.get(0);
			int ninetop = nine.get(0);
			if(ninetop < onetop){
				nine.remove(0);
			}else if(onetop < ninetop){
				one.remove(0);
				nine.remove(0);
				ans++;
			}
			//System.out.println(one);
		}
		ans += one.size()/2;
		System.out.println(ans);
	}
	static class BIT{
		int n;
		int[] bit;
		public BIT(int n){
			this.n = n;
			bit = new int[n+1];
		}
		void add(int idx, int val){
			for(int i = idx+1; i <= n; i += i&(-i)) bit[i-1] += val;
		}
		int sum(int idx){
			int res = 0;
			for(int i = idx+1; i > 0; i -= i&(-i)) res += bit[i-1];
			return res;
		}
		int sum(int begin, int end){
			if(begin == 0) return sum(end);
			return sum(end)-sum(begin-1);
		}
	}
	static class Pair implements Comparable<Pair>{
    int first, second;
    Pair(int a, int b){
        first = a;
        second = b;
    }
    @Override
    public boolean equals(Object o){
        if (this == o) return true;
        if (!(o instanceof Pair)) return false;
        Pair p = (Pair) o;
        return first == p.first && second == p.second;
    }
    @Override
    public int compareTo(Pair p){
        //return first == p.first ? second - p.second : first - p.first; //firstで昇順にソート
        //return (first == p.first ? second - p.second : first - p.first) * -1; //firstで降順にソート
        //return second == p.second ? first - p.first : second - p.second;//secondで昇順にソート
        //return (second == p.second ? first - p.first : second - p.second)*-1;//secondで降順にソート
		    //return first * 1.0 / second > p.first * 1.0 / p.second ? 1 : -1; // first/secondの昇順にソート
		    //return first * 1.0 / second < p.first * 1.0 / p.second ? 1 : -1; // first/secondの降順にソート
				//return second * 1.0 / first > p.second * 1.0 / p.first ? 1 : -1; // second/firstの昇順にソート
		    //return second * 1.0 / first < p.second * 1.0 / p.first ? 1 : -1; // second/firstの降順にソート
				//return Math.atan2(second, first) > Math.atan2(p.second, p.first) ? 1 : -1; // second/firstの昇順にソート
				//return first + second > p.first + p.second ? 1 : -1; //first+secondの昇順にソート
				//return first + second < p.first + p.second ? 1 : -1; //first+secondの降順にソート
				//return first - second < p.first - p.second ? 1 : -1; //first-secondの降順にソート
				return Math.atan2(second,first) > Math.atan2(p.second, p.first) ? 1 : -1;
		}
  }

	private 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;}
		public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() {
				long nl = nextLong();
				if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
				return (int) nl;
		}
		public double nextDouble() { return Double.parseDouble(next());}
	}
}
0