제출 #344051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344051		koketsu	Red-blue table (IZhO19_stones)	C++17	0 / 100	41 ms	1388 KiB

stones

#include <bits/stdc++.h>
#define pb push_back
#define LL long long
#define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const LL Mxn = 1e6 + 7;
const LL Mod = 1e9 + 7;
const LL Inf = 1e14 + 7;

int main() {
    Kultivator;
    int tt;
    cin >> tt;
    while(tt--){
        int N, M;
        cin >> N >> M;
        if(min(N, M) == 1){
            cout << max(N, M) << '\n';
            for(int i = 1; i <= N; i++){
                for(int j = 1; j <= M; j++){
                    if(N == 1){
                        cout << '+';
                    } else {
                        cout << '-';
                    }
                }
                cout << '\n';
            }
            continue;
        } else if(N == 2 || M == 2){
            cout << max(N, M) << '\n';
            for(int i = 1; i <= N; i++){
                for(int j = 1; j <= M; j++){
                    if(N == 2){
                        cout << '+';
                    } else {
                        cout << '-';
                    }
                }
                cout << '\n';
            }
            continue;
        }
        cout << max(N, M) + 1 << '\n';
        if(N <= M){
            for(int i = 1; i <= N; i++){
                for(int j = 1; j <= M; j++){
                    if(i == N){
                        cout << '-';
                    } else {
                        cout << '+';
                    }
                }
                cout << '\n';
            }
        } else {
            for(int i = 1; i <= N; i++){
                for(int j = 1; j <= M; j++){
                    if(i == N){
                        cout << '+';
                    } else {
                        cout << '-';
                    }
                }
                cout << '\n';
            }
        }
        cout << '\n';
    }
}

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