結果

問題 No.197 手品
コンテスト
ユーザー threepipes_s
提出日時 2015-05-11 10:43:40
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,504 bytes
コンパイル時間 2,446 ms
コンパイル使用メモリ 78,744 KB
実行使用メモリ 50,296 KB
最終ジャッジ日時 2024-06-27 09:36:55
合計ジャッジ時間 5,794 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40 WA * 3
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;

public class Main {
	public static char[] s2;
	public static char[] s1;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		char[] bef = in.nextToken().toCharArray();
		int n = in.nextInt();
		char[] fin = in.nextToken().toCharArray();
		int b = 0;
		int f = 0;
		String success = "SUCCESS";
		String fail = "FAILURE";
		for(int i=0; i<3; i++){
			b <<= 1;
			f <<= 1;
			b |= bef[i]=='o'?1:0;
			f |= fin[i]=='o'?1:0;
		}
		if(Integer.bitCount(b) != Integer.bitCount(f)){
			System.out.println(success);
			return;
		}
		if(Integer.bitCount(b) == 3){
			System.out.println(fail);
			return;
		}
		if(Integer.bitCount(b) == 2){
			b = ~b;
			f = ~f;
		}
		if(b == f){
			// 留まるパターン
			if(b == 2){
				if(n >= 2) System.out.println(fail);
				else System.out.println(success);
			}else{
				System.out.println(fail);
			}
		}else if((b|f) == 5){
			// 端から端へ
			if(n >= 2) System.out.println(fail);
			else System.out.println(success);
		}else if(b == 2){
			// 中から端へ
			if(n >= 1) System.out.println(fail);
			else System.out.println(success);
		}else{
			// 端から中へ
			if(n >= 1) System.out.println(fail);
			else System.out.println(success);
		}
	}
	
}

class Node{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0