Submission #683711

#	Time	Username	Problem	Language	Result	Execution time	Memory
683711		NintsiChkhaidze	Red-blue table (IZhO19_stones)	C++14	0 / 100	30 ms	1828 KiB

stones

#include <bits/stdc++.h>
#define ll long long
#define s second
#define pb push_back
#define f first
#define left (h<<1),l,((l+r)>>1)
#define right ((h<<1)|1),((l+r)>>1) + 1,r
#define pii pair<int,int>
// #define int ll // ? 
using namespace std;

const int N = 1005,mod = 1000000007; // ?
multiset <int> st;
int a[N][N],y[N],x[N],f[N];
int ans,n,m;

void solve(){
    st.clear();

    if (m >= n){
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                a[i][j] = 0;
        //column-ebs ar vapucheb
        ans = m; int k = (m + 1)/2;

        for (int j = 1; j <= m; j++) y[j] = n/2;
        for (int i = 1; i <= n; i++){
            int cnt = 0;
            for (int j = 1; j <= m; j++) f[j] = 0;
            for (int j = 1; j <= m; j++){
                if (y[j]) {
                    --y[j];
                    f[j] = 1;
                    cnt++;
                }
                if (cnt == k) {
                    ++ans;
                    break;
                }
            }
            if (cnt < k) break;

            for (int j = 1; j <= m; j++)
                if (f[j]) a[i][j] = 1;
        }
        return;
    }
    //n > m
    //row-ebs ar vapucheb
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            a[i][j] = 1;

    ans = n; int k = (n + 1)/2;
    for (int i = 1; i <= n; i++) x[i] = m/2;

    for (int j = 1; j <= m; j++){
        int cnt=0;
        for (int i = 1; i <= n; i++) f[i] = 0;
        for (int i = 1; i <= n; i++){
            if (x[i]){
                --x[i];
                f[i] = 1;
                ++cnt;
            }
            if (cnt == k) {
                ++ans;
                break;
            }
        }
        if (cnt < k) break;

        for (int i = 1; i <= n; i++){
            if (f[i]) a[i][j] = 0;
        }
    }
}
signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

    int T;
    cin>>T;

    while (T--){
        cin>>n>>m;
        solve();
        cout<<ans<<endl;
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                if (a[i][j]) cout<<"+";
                else cout<<"-";
            }
            cout<<"\n";
        }
        
    }
}

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