제출 #1179980

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179980		al95ireyiz	Red-blue table (IZhO19_stones)	C++20	100 / 100	302 ms	17000 KiB

stones

// It's the evening of another day. And the end of mine...
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp> \
#include<ext/pb_ds/tree_policy.hpp> \
using namespace __gnu_pbds; \
template<class T> \
using Tree=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statisticslmode_update>;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
string sp=" ";
#define F ୨୧
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define mkp make_pair
#define qll queue<ll>
#define dqll deque<ll>
#define mll map<ll,ll>
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define mne min_element
#define mxe max_element
#define rs(x)resize(x)
#define vpll vector<pll>
#define vvll vector<vll>
#define pq priority_queue
#define len(x)(ll)x.size()
#define lcm(x,y)x/__gcd(x,y)*y
#define all(x)x.begin(),x.end()
#define umll unordered_map<ll,ll>
#define lg2(x)(63ll-__builtin_clzll(x))
#define precision(x)fixed<<setprecision(x)
#define popcnt(x)(ll)__builtin_popcountll(x)
template<typename t1,typename t2>istream&operator>>(istream&is,pair<t1,t2>&x){return is>>x.fr>>x.sc;}
template<typename t1,typename t2>ostream&operator<<(ostream&os,pair<t1,t2>&x){return os<<x.fr<<' '<<x.sc;}
template<typename t1>istream&operator>>(istream&is,vector<t1>&vc){for(t1&j:vc)is>>j;return is;}
template<typename t1>ostream&operator<<(ostream&os,vector<t1>&vc){for(t1&j:vc)os<<j<<sp;return os;}
// #define ll int_fast32_t
// #define ll int_fast64_t
// #pragma GCC optimize("O2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
const ll INF=1e9;
const ll INFL=1e18;
const ll MOD=1e9+7;
// const ll MOD=998244353;
const ll maxn=2e5+5;
ll n,m,k=0;
inline void prc(){}
void _(ll&tt){
    cin>>n>>m;
    auto f = [&](ll h, ll w) -> pair<ll, vvll>{
        vvll v(h, vll(w));
        vll say(h), say2(w, h);
        ll i=0, j=0, tmp=0;
        while(i<h){
            if(*mxe(all(say2)) == h/2 + 1) break;
            if(say2[j] == h/2 + 1){ j++, j%=w; continue;}
            v[i][j] = 1;
            say[i] ++, say2[j] --;
            tmp ++, j++, j%=w;
            if(tmp == w/2 + 1) i++, tmp = 0;
        }
        ll cv = 0;
        for(ll i=0;i<h;i++) cv += (say[i] > w/2);
        for(ll i=0;i<w;i++) cv += (say2[i] > h/2);
        return {cv, v};
    };
    if(n <= m){
        auto [cv, v] = f(n, m);
        cout<<cv<<'\n';
        for(ll i=0;i<n;i++){
            for(ll j=0;j<m;j++) cout<<(v[i][j] == 0 ? '-' : '+');
            cout<<'\n';
        }
    }
    else{
        auto [cv, v] = f(m, n);
        cout<<cv<<'\n';
        for(ll i=0;i<n;i++){
            for(ll j=0;j<m;j++) cout<<(v[j][i] == 1 ? '-' : '+');
            cout<<'\n';
        }
    }
}
signed main(){
    clock_t testcaseruntime=clock();
    cin.tie(0)->sync_with_stdio(0);
    prc();
    ll t=1;
    cin>>t;
    for(ll tt=1;tt<=t;tt++){
        // cout<<"Case "<<tt<<": ";
        _(tt);
    }
    cerr<<"\n\033[1;31mTime: \033[1;30m"<<(double)(clock()-testcaseruntime)/CLOCKS_PER_SEC<<"\033[1;32m seconds"<<'\n';
}

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