結果

問題 No.648 　お　や　す　み　
ユーザー touchan4692touchan4692
提出日時 2019-05-11 00:56:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 56 ms / 2,000 ms
コード長 6,230 bytes
コンパイル時間 2,525 ms
コンパイル使用メモリ 92,796 KB
実行使用メモリ 37,280 KB
最終ジャッジ日時 2024-07-02 01:05:43
合計ジャッジ時間 9,423 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,024 KB
testcase_01 AC 54 ms
37,132 KB
testcase_02 AC 54 ms
37,124 KB
testcase_03 AC 54 ms
36,716 KB
testcase_04 AC 54 ms
36,720 KB
testcase_05 AC 53 ms
36,892 KB
testcase_06 AC 54 ms
36,948 KB
testcase_07 AC 53 ms
37,136 KB
testcase_08 AC 54 ms
36,992 KB
testcase_09 AC 54 ms
37,108 KB
testcase_10 AC 55 ms
36,720 KB
testcase_11 AC 55 ms
36,700 KB
testcase_12 AC 54 ms
37,120 KB
testcase_13 AC 54 ms
37,144 KB
testcase_14 AC 53 ms
36,568 KB
testcase_15 AC 53 ms
36,884 KB
testcase_16 AC 53 ms
37,172 KB
testcase_17 AC 53 ms
37,212 KB
testcase_18 AC 53 ms
37,136 KB
testcase_19 AC 54 ms
36,992 KB
testcase_20 AC 55 ms
37,172 KB
testcase_21 AC 53 ms
36,712 KB
testcase_22 AC 53 ms
36,684 KB
testcase_23 AC 53 ms
36,780 KB
testcase_24 AC 53 ms
37,136 KB
testcase_25 AC 53 ms
37,280 KB
testcase_26 AC 54 ms
37,108 KB
testcase_27 AC 53 ms
36,680 KB
testcase_28 AC 53 ms
36,848 KB
testcase_29 AC 54 ms
36,560 KB
testcase_30 AC 52 ms
36,796 KB
testcase_31 AC 53 ms
36,948 KB
testcase_32 AC 54 ms
36,916 KB
testcase_33 AC 55 ms
36,924 KB
testcase_34 AC 53 ms
36,808 KB
testcase_35 AC 53 ms
37,208 KB
testcase_36 AC 53 ms
37,060 KB
testcase_37 AC 52 ms
36,884 KB
testcase_38 AC 54 ms
37,132 KB
testcase_39 AC 55 ms
36,708 KB
testcase_40 AC 53 ms
36,736 KB
testcase_41 AC 54 ms
36,592 KB
testcase_42 AC 54 ms
37,168 KB
testcase_43 AC 54 ms
37,280 KB
testcase_44 AC 54 ms
37,132 KB
testcase_45 AC 54 ms
36,716 KB
testcase_46 AC 55 ms
36,988 KB
testcase_47 AC 54 ms
36,948 KB
testcase_48 AC 54 ms
36,984 KB
testcase_49 AC 56 ms
37,108 KB
testcase_50 AC 55 ms
36,768 KB
testcase_51 AC 54 ms
36,904 KB
testcase_52 AC 54 ms
37,028 KB
testcase_53 AC 53 ms
37,188 KB
testcase_54 AC 54 ms
37,152 KB
testcase_55 AC 52 ms
36,720 KB
testcase_56 AC 53 ms
36,808 KB
testcase_57 AC 54 ms
36,704 KB
testcase_58 AC 54 ms
36,916 KB
testcase_59 AC 53 ms
36,904 KB
testcase_60 AC 54 ms
37,204 KB
testcase_61 AC 54 ms
36,684 KB
testcase_62 AC 54 ms
36,808 KB
testcase_63 AC 54 ms
37,132 KB
testcase_64 AC 56 ms
37,220 KB
testcase_65 AC 53 ms
36,808 KB
testcase_66 AC 54 ms
36,720 KB
testcase_67 AC 54 ms
37,080 KB
testcase_68 AC 53 ms
36,592 KB
testcase_69 AC 52 ms
37,000 KB
testcase_70 AC 54 ms
37,100 KB
testcase_71 AC 53 ms
36,880 KB
testcase_72 AC 53 ms
37,112 KB
testcase_73 AC 55 ms
36,980 KB
testcase_74 AC 56 ms
36,936 KB
testcase_75 AC 53 ms
36,892 KB
testcase_76 AC 55 ms
37,076 KB
testcase_77 AC 53 ms
36,948 KB
testcase_78 AC 55 ms
36,676 KB
testcase_79 AC 53 ms
36,652 KB
testcase_80 AC 54 ms
36,928 KB
testcase_81 AC 54 ms
36,764 KB
testcase_82 AC 54 ms
36,768 KB
testcase_83 AC 53 ms
36,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.AbstractMap;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.TreeSet;
import static java.util.Comparator.*;				

public class Main {
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
    //
    static class Solver {
    	
    	// index が条件を満たすかどうか	
    	boolean isOK(long N, long mid, PrintWriter out) {
    	    long wk = (mid * (mid + 1))/ 2;
    	    out.println("mid = " + mid + "  (wk = " + wk + ")  == " + N + " ?");
    		if(N <= wk) 	return true;
    		else			return false;
    	}
    	// 汎用的な二分探索のテンプレ
    	long calc(long N, PrintWriter out) {
    	    long ng = -1; 			// 「index = 0」が条件を満たすこともあるので、初期値は -1	
    	    long ok = 10000000000L; 	// 「index = a.length-1」が条件を満たさないこともあるので、初期値は a.length()	
    	    long mid, wk;
    	    
    	    while (Math.abs(ok - ng) > 1) {	
    	        mid = (ok + ng) / 2;	
        	    wk = (mid * (mid + 1))/ 2;
 //       	    out.println("mid = " + mid + "  (wk = " + wk + ")  == " + N + " ?");
    	    	if(N == wk)         return mid;
    	    	else if(N < wk)     ok = mid;
    		    else			    ng = mid;
    	    }
    	    return -1;
    	}
    	
    	public void solve(int testNumber, MyInput in, PrintWriter out) {
    		long N = in.nextLong();
    		long ans = calc(N, out);
    		if(ans == -1) {
    			out.println("NO");
    		} else {
    			out.println("YES");
       		    out.println(ans);
    		}
        }
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
       public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}
0