結果
| 問題 | 
                            No.305 鍵(2)
                             | 
                    
| コンテスト | |
| ユーザー | 
                             yuya178
                         | 
                    
| 提出日時 | 2017-11-21 20:15:55 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                AC
                                 
                             
                            
                         | 
                    
| 実行時間 | 101 ms / 2,000 ms | 
| コード長 | 4,587 bytes | 
| コンパイル時間 | 2,294 ms | 
| コンパイル使用メモリ | 86,540 KB | 
| 実行使用メモリ | 67,700 KB | 
| 平均クエリ数 | 86.69 | 
| 最終ジャッジ日時 | 2024-07-17 01:32:19 | 
| 合計ジャッジ時間 | 4,432 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge3 / judge1 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | AC * 13 | 
ソースコード
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int[] c = new int[10];
        int min = 0;
        int flag = 0;
        int t = 0;
        while(true){
            String s = go(c,0).split(" ")[0];
            int a = Integer.parseInt(s);
            if(a==10) return;
            if(a >= min){
                min = a;
                flag = c[t]; 
            }
            c[t]++;
            if(c[t]==10){
                c[t] = flag;
                t++;
            }
        }
    }
    String go(int[] c, int flag){
        for(int i = 0; i < c.length; i++){
            out.print(c[i]);
        }
        out.println();
        out.flush();
        if(flag==0){
            String s = ns();
            return s;
        }
        return test(c);
    }
    String test(int[] c){
        int ans = 0;
        for(int i = 0; i < 10; i++){
            if(c[i] == 0) ans++;
        }
        String s = "";
        if(ans<10) s = ans + " locked";
        else s = ans + " unlocked";
        return s;
    }
   
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
            
            
            
        
            
yuya178