제출 #672234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672234		YENGOYAN	Red-blue table (IZhO19_stones)	C++17	100 / 100	121 ms	3552 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;
    }
}

vector<string> rev(vector<string> v, int n, int m){
    vector<string> a(m);
    for(int i = 0; i < n; ++i){
        for(int j = m - 1; j >= 0; --j){
            if(v[i][j]  == '+') a[m - j - 1].push_back('-');
            else a[m - j - 1].push_back('+');
        }
    }
    return a;
}

void solve(){
    int n, m; cin >> n >> m;
    set<pair<int, int>> st;
    bool r = 0;
    if(n > m){
        swap(n, m);
        r = 1;
    }
    string s(m, '-');
    vector<string> v(n, s);
    for(int i = 0; i < m; i++) st.insert({0, i});
    int tuylatreli = (n + 1) / 2 - 1;
    for(int i = 0; i < n; i++){
        int petq = m / 2 + 1;
        while(petq--){
            auto it = st.begin();
            pair<int, int> p = *it;
            if(p.first == tuylatreli) break;
            v[i][p.second] = '+';
            st.erase(p);
            st.insert({p.first + 1, p.second});
        }
    }
    if(r) v = rev(v, n, m), swap(n, m);
    cout << calc(v, n, m) << endl;
    printVec(v, n, m);
}

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

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