제출 #683693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683693		Temkabat	Red-blue table (IZhO19_stones)	C++14	17 / 100	54 ms	1292 KiB

stones

#include <iostream>
using namespace std;
int main() {
    int T;
    cin>>T;
    for (int i = 0; i < T; i++){
        int N, M;
        bool rotated=false;
        cin>>N>>M;
        char table[N][M];
        if(N>M){
            int t;
            t=N;
            N=M;
            M=t;
            rotated=true;
        }
        int a=M/2+1, b;
        int c=N/2;
        int d=N%2;
        if(N==1 and M==1){
            cout<<"1\n+\n";
        }else{
			b=min( N, (c - !(d)) * M / a );
            cout<<M+b<<"\n";
            for(int k=0;k<N;k++){
                for(int l=0;l<M;l++){
                    if(rotated==true){
                        table[k][l]='+';
                    }
                    else{
                        table[k][l]='-';
                    }
                }
            }
            for(int k=0, l=0; k<b; k++){
                for(int n=0; n<a; n++,l++){
                    if(l>M){
                        l=1;
                    }
                    if(rotated==true){
                        table[k][l]='-';
                    }
                    else{
                        table[k][l]='+';
                    }
                }
            }
            if(rotated==false){
                for(int k=0;k<N;k++){
                    for(int l=0;l<M;l++){
                        cout<<table[k][l];
                    }
                    cout<<endl;
                }
            }
            else{
                for(int k=0;k<M;k++){
                    for(int l=0;l<N;l++){
                        cout<<table[l][k];
                    }
                    cout<<endl;
                }
            }
		}
    }
}

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