Submission #956442

#	Time	Username	Problem	Language	Result	Execution time	Memory
956442		Darren0724	Red-blue table (IZhO19_stones)	C++17	10 / 100	21 ms	1652 KiB

stones

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
void solve(){
    int n,m;cin>>n>>m;
    int flag=(n>m);
    if(flag)swap(n,m);
    vector<vector<int>> v(n,vector<int>(m));
    int ans=0;
    if(n==1){
        for(int i=0;i<m;i++){
            v[0][i]=1;
        }
        ans=m;
    }
    else if(n==2){
        ans=m;
        for(int i=0;i<m;i++){
            v[0][i]=1;
            v[1][i]=1;
        }
    }
    else if(n==3){
        ans=m+1;
        for(int i=0;i<m;i++){
            v[0][i]=1;
            v[1][i]=1;
        }
    }
    cout<<ans<<endl;
    if(!flag){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cout<<(v[i][j]?'-':'+');
            }
            cout<<endl;
        }
    }
    else{
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                cout<<(v[j][i]?'+':'-');
            }
            cout<<endl;
        }
    }
}
int32_t main() {
    LCBorz;
    int t;cin>>t;
    while(t--){
        solve();
    }
    
    return 0;
}

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