oj.uz

Submission #344208

# Submission time Handle Problem Language Result Execution time Memory
344208 2021-01-05T09:20:19 Z koketsu Red-blue table (IZhO19_stones) C++14
0 / 100
 1 ms 364 KB 
#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 N, M;

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

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB in the table A+B is not equal to 4

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong answer

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB in the table A+B is not equal to 4

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB in the table A+B is not equal to 4