結果

問題 No.438 Cwwプログラミング入門
ユーザー 37zigen
提出日時 2020-04-15 05:13:40
言語 Java
(openjdk 23)
結果
AC  
実行時間 86 ms / 2,000 ms
コード長 4,341 bytes
コンパイル時間 2,713 ms
コンパイル使用メモリ 87,360 KB
実行使用メモリ 50,948 KB
最終ジャッジ日時 2024-10-01 18:37:11
合計ジャッジ時間 12,860 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 98
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Stack;
public class Main {
    void check(String str,long x,long y,long z) {
        assert str.length()<=10000:"size is invalid";
        ArrayDeque<Long> stack=new ArrayDeque<>();
        for (char c:str.toCharArray()) {
            if (c=='c') stack.addFirst(x);
            else if(c=='w') stack.addFirst(y);
            else if(c=='C') {
                long a=stack.pollFirst();
                long b=stack.pollFirst();
                stack.addFirst(a+b);
            } else if(c=='W') {
                long a=stack.pollFirst();
                long b=stack.pollFirst();
                stack.addFirst(a-b);
            }
        }
        assert stack.peekFirst()==z:stack.peekFirst()+"!="+z;
    }
    
    void run() {
        FastScanner sc=new FastScanner();
        PrintWriter pw=new PrintWriter(System.out);
        ArrayList<String> positive=new ArrayList<>();
        ArrayList<String> negative=new ArrayList<>();
        
        String c="c";
        String w="w";
        long x=sc.nextLong();//c
        long y=sc.nextLong();//w
        long z=sc.nextLong();
        if (y==0) {
            x^=y;y^=x;x^=y;
            c="w";w="c";
        }
        if (z==0) {
            System.out.println("ccW");
            return;
        }
        if (x==0&&y==0&&z!=0) {
            System.out.println("NO");
            return;
        }
//      StringBuilder sb=new StringBuilder();
        // x*a+y*b==z
        for (int a=-10000;a<=10000;++a) {
            long b=(z-x*a)/y;
            if (x*a+y*b!=z) continue;
            if (2*(Math.abs(a)+Math.abs(b))-1>10000||(a==0&&b==0)) continue;
            for (int i=0;i<Math.abs(a);++i) {
                if (a>0) positive.add(c);
                else negative.add(c);
            }
            for (int i=0;i<Math.abs(b);++i) {
                if (b>0) positive.add(w);
                else negative.add(w);
            }
            if (negative.size()>0) {
                for (String s:negative) {
                    pw.print(s);
//                  sb.append(s);
                }
                pw.print("C".repeat(negative.size()-1));
//              sb.append("C".repeat(negative.size()-1));
            }
            for (String s:positive) {
                pw.print(s);
//              sb.append(s);
            }
            pw.print("C".repeat(positive.size()-1));
//          sb.append("C".repeat(positive.size()-1));
            if (negative.size()>0) pw.print("W");
//          if (negative.size()>0) sb.append("W");
//          check(sb.toString(),x,y,z);
            pw.close();
            return;
        }
        pw.println("NO");
        pw.close();
    }
    
    void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
    
    public static void main(String[] args) {
        new Main().run();
    }
}
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;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); 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() {
        return (int)nextLong();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0