제출 #638809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638809		murad_2005	Red-blue table (IZhO19_stones)	C++14	0 / 100	36 ms	1316 KiB

stones

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ui unsigned int
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pil pair<int, ll>
#define plli pair<long long, int>
#define pdi pair<double, int>
#define pldldi pair<ld, pair<ld, int>>
#define pdd pair<double, double>
#define pid pair<int, double>
#define piii pair<int, pair<int, int>>
#define pllll pair<long long, long long>
#define pllllll pair<ll, pllll>
#define INF 2e9 + 5
#define size(v) v.size()
#define f first
#define s second
#define Pi 3.14159265359

using namespace std;

void solve(){
    int n, m;
    cin >> n >> m;
    int Res1 = n + (m / 2), Res2 = m + (n / 2);
    vector<vector<char>>a(n + 1, vector<char>(m + 1, '-'));
    if(Res1 >= Res2){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m; j++){
                if(j <= (m + 1) / 2){
                    a[i][j] = '+';
                }
            }
        }
    }else{
        for(int i = 1; i <= n / 2; i++){
            for(int j = 1; j <= m; j++){
                a[i][j] = '+';
            }
        }
    }
    cout << max(Res1, Res2) << "\n";
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cout << a[i][j];
        }
        cout << "\n";
    }
}

int main(){

    int t;
    // t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

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