結果

問題 No.239 にゃんぱすー
ユーザー threepipes_s
提出日時 2015-07-10 22:25:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 96 ms / 2,000 ms
コード長 3,499 bytes
コンパイル時間 2,002 ms
コンパイル使用メモリ 79,364 KB
実行使用メモリ 51,820 KB
最終ジャッジ日時 2024-07-08 01:56:42
合計ジャッジ時間 5,202 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

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.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
public class Main {
    static HashSet<String> set = new HashSet<String>();
    public static void main(String[] args) throws NumberFormatException,
    IOException {
        Solve solve = new Solve();
        solve.solve();
    }
}
class Solve{
    ContestScanner in;
    Solve() throws FileNotFoundException{
        in = new ContestScanner();
    }
    void solve() throws IOException{
        int n = in.nextInt();
        String[][] str = new String[n][n];
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                str[i][j] = in.nextToken();
            }
        }
        int res = -1;
        for(int j=0; j<n; j++){
            boolean flag = true;
            for(int i=0; i<n; i++){
                if(!str[i][j].equals("nyanpass") && !str[i][j].equals("-")){
                    flag = false;
                    break;
                }
            }
            if(flag){
                if(res > 0){
                    System.out.println(-1);
                    return;
                }
                res = j+1;
            }
        }
        System.out.println(res);
    }
}
class Timer{
    long time;
    public void set(){
        time = System.currentTimeMillis();
    }
    
    public long stop(){
        return System.currentTimeMillis()-time;
    }
}
class Node{
    int id;
    ArrayList<Node> edge = new ArrayList<Node>();
    ArrayList<Integer> sp = new ArrayList<Integer>();
    public Node(int id) {
        this.id = id;
    }
    public void createEdge(Node node, int sp) {
        edge.add(node);
        this.sp.add(sp);
    }
}
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 println(Object obj) {
        out.println(obj);
    }
    public void print(String str) {
        out.print(str);
    }
    
    public void print(Object obj) {
        out.print(obj);
    }
    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());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0