제출 #1280858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280858		fateless	Red-blue table (IZhO19_stones)	C++20	17 / 100	2095 ms	340 KiB

stones

// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")

#include <bits/stdc++.h> 
using namespace std;

#define speedup cin.tie(0)->sync_with_stdio(0)
#define bitcount(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define Tp template<class T>
#define pb emplace_back
Tp using vc=vector<T>;
using ld=long double;
using ll=long long;

inline void solve() {
    bool rev = 0; 
    int n, m; cin >> n >> m;
    if(n < m) swap(n, m), rev = 1;

    int res = 0;
    vc<int> v(n), av(n);
    auto gen = [&](auto&self, int id)->void{
        if(id == n) { int ans = 0;
            for(int i = 0; i < n; i++) {
                int bit = bitcount(v[i]);
                if(rev && (bit << 1) < m) ans++;
                if(!rev && (bit << 1) > m) ans++; 
            }
            for(int bit = 0; bit < m; bit++) {
                int sum = 0;
                for(int i = 0; i < n; i++)
                    if((v[i] >> bit) & 1) sum++;
                
                if(rev && (sum << 1) > n) ans++;
                if(!rev && (sum << 1) < n) ans++;
            } if(res < ans) {
                res = ans;
                av = v;
            } return;
        } for(int mask = 0; mask < (1 << m); mask++) {
            v[id] = mask;
            self(self, id + 1);
        }
    }; gen(gen, 0);
    cout << res << '\n';
    if(rev) {
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if((av[j] >> i) & 1) cout << "+";
                else cout << "-";
            }
            cout << '\n';
        }
    } else {
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if((av[i] >> j) & 1) cout << "+";
                else cout << "-";
            } cout << '\n';
        }
    }
}

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

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