제출 #672219

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

stones

#include <bits/stdc++.h>

using namespace std;

int calc(vector<string> &v, int n, int m){
    int cnt = 0;
    for(int i = 0; i < n; i++){
        int a = 0, b= 0 ;
        for(int j = 0; j < m; j++){
            if(v[i][j] == '+') a++;
            else b++;
        }
        cnt += (a > b);
    }
    for(int j = 0; j < m; j++){
        int a = 0, b = 0;
        for(int i = 0; i < n; i++){
            if(v[i][j] == '-') a++;
            else  b++;
        }
        cnt += (a > b);
    }
    return cnt;
}

void printVec(vector<string> &v, int n, int m){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cout << v[i][j];
        }
        cout << endl;
    }
}

void solve(){
    int n, m; cin >> n >> m;
    vector<string> v(n);
    string s(m, '-');
    v[0] = s;
    string a(m / 2 + 1, '+'), b(m - (m / 2 + 1), '-');
    for(int i = 1; i < n; i++){
        if(i % 2) v[i] = a + b;
        else v[i] = b + a;
    }
    cout << calc(v, n, m) << endl;
    printVec(v, n, m);
}

int main(){
    int t; cin >> t; while(t--)
        solve();
}

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