Submission #448629

#	Time	Username	Problem	Language	Result	Execution time	Memory
448629		zaneyu	Red-blue table (IZhO19_stones)	C++14	0 / 100	38 ms	1788 KiB

stones

/*input
2
1 3
3 3
*/
#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;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=1e3+5;
const ll maxlg=__lg(maxn)+2; 
int arr[maxn][maxn];
void solve(){
    int n,m;
    cin>>n>>m;
    bool f=0;
    if(n<m){
        f=1;
        swap(n,m);
    }
    REP(i,n) REP(j,m) arr[i][j]=0;
    int cur=n/2;
    int ans=0;
    REP(i,(m-1)/2){
        REP(j,n){
            arr[j][ans]=1;
            if(!cur){
                ++ans;
                cur=n/2+1;
            }
            --cur;
        }
    }
    cout<<ans+n<<'\n';
    if(f) swap(n,m);
    REP(i,n){
        REP(j,m){
            cout<<((f?arr[j][i]:arr[i][j])?'+':'-');
        }
        cout<<'\n';
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    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