結果

問題 No.197 手品
ユーザー Tsukasa_Type
提出日時 2018-03-10 22:50:53
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 2,995 bytes
コンパイル時間 2,127 ms
コンパイル使用メモリ 77,464 KB
実行使用メモリ 36,852 KB
最終ジャッジ日時 2024-06-27 13:54:27
合計ジャッジ時間 5,642 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 2
other AC * 13 WA * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import static java.lang.System.*;

public class Main {
	static FastScanner sc = new FastScanner(System.in);
	public static void main(String[] args) {
		String before = sc.next();
		int before_num = 0;
		for (int i=0; i<3; i++) {
			if (before.charAt(i)=='o') {before_num++;}
		}
		int times = sc.nextInt();
		String after = sc.next();
		int after_num = 0;
		for (int i=0; i<3; i++) {
			if (after.charAt(i)=='o') {after_num--;}
		}
		
		if (before_num != after_num) {out.println("SUCCESS");}
		else {
			if (times == 0) {
				if (!before.equals(after)) {out.println("SUCCESS");}
				else {out.println("FAILURE");}
			}
			else if (times == 1) {
				if (before_num >= 2) {
					before = before.replace("o","-");
					before = before.replace("x","o");
					before = before.replace("-","x");
				}
				if (after_num >=2) {
					after = after.replace("o","-");
					after = after.replace("x","o");
					after = after.replace("-","x");
				}
				if (before.equals("oxx")&&after.equals("xxo") || before.equals("xxo")&&after.equals("oxx") || before.equals("xox")&&after.equals("xox")) {
					out.println("SUCCESS");
				}
				else {out.println("FAILURE");}
			}
			else {
				out.println("FAILURE");
			}
		}
	}
}



class FastScanner implements Closeable {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	public FastScanner(InputStream in) {this.in = in;}
	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());}
	public void close() {
		try {in.close();}
		catch (IOException e) {}
	}
}
0