제출 #329903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329903		KWang31	Red-blue table (IZhO19_stones)	Java	11 / 100	252 ms	16196 KiB

stones

import java.io.*; import java.util.*;
public class stones{
  static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        
    } 
    static int MOD=998244353;
    static int[] rk, p;
    public static void main(String[] args){
        FastReader br=new FastReader();
        int T=br.nextInt(); 
        StringBuilder sb;
        while(T>0){
            T--; sb=new StringBuilder();
            int N=br.nextInt(); int M=br.nextInt();
            if(N==1){
                System.out.println(M);
                for (int i = 0; i < M; i++) {
                    sb.append('-');
                }
                
            }else if(M==1){
                System.out.println(N);
                for (int i = 0; i < N; i++) {
                    sb.append('+').append("\n");
                }
                
            }else if(N==2){
                System.out.println(M);
                for (int i = 0; i < M; i++) {
                    sb.append('-');
                }
                sb.append("\n");
                for (int i = 0; i < M; i++) {
                    sb.append('-');
                }
                
            }else if(M==2){
                System.out.println(N);
                for (int i = 0; i < N; i++) {
                    sb.append('+').append('+').append("\n");
                }
            }else{//M,N>2
                System.out.println(N+M-4+(N&1)+(M&1));
                for (int i = 0; i < M; i++) {
                    sb.append('-');
                }
                sb.append("\n");
                if(N%2==0){
                    for (int i = 0; i < M; i++) {
                        sb.append('-');
                    }
                    sb.append("\n");
                }
                for (int i = 2-(N&1); i < N; i++) {
                    sb.append('+');
                    if(N%2==0){
                        sb.append('+');
                    }
                    boolean prev=((i-N)%2==0);
                    for (int j = 2-(M&1); j < M; j++) {
                        if(prev){
                            sb.append('+');
                        }else{
                            sb.append('-');
                        }
                        prev=!prev;
                    }
                    sb.append("\n");
                }
            }
            System.out.println(sb.toString());
        }
    }
   
}
//Debugging:
//Are you sure your algorithm is correct?
//Bounds: long
//Special cases: n=0,1?
//Make sure you remove your debugging code before you submit!

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 11 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31