제출 #146468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
146468		achibasadzishvili	Red-blue table (IZhO19_stones)	C++14	100 / 100	82 ms	2424 KiB

stones

#include<bits/stdc++.h>
#define ll int
#define f first
#define s second
#define pb push_back
using namespace std;
ll n,m,ind,ned1,ned2,ans,indx,indy;
char a[1005][1005];
int main(){
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    
    while(t--){
        cin >> n >> m;
        ned1 = (m + 2) / 2;
        ned2 = (n + 2) / 2;
        ans = 0;
        for(int i=0; i<=n; i++){
            int l=0,r=m,mid;
            ind = 0;
            while(r >= l){
                mid = (l + r) / 2;
                if(i * (mid - ned1 + (m - mid)) >= mid * (ned2 - (n - i))){
                    l = mid + 1;
                    ind = mid;
                }
                else {
                    r = mid - 1;
                }
            }
            if(i + ind > ans){
                ans = i + ind;
                indx = i;
                indy = ind;
            }
        }
        cout << ans << endl;;
        for(int i=indx+1; i<=n; i++)
            for(int j=1; j<=m; j++)
                a[i][j] = '-';
        for(int j=indy + 1; j<=m; j++)
            for(int i=1; i<=n; i++)
                a[i][j] = '+';
        int k = indy - ned1 + (m - indy),p;
        if(k <= 0){
            for(int i=1; i<=indx; i++)
                for(int j=1; j<=indy; j++)
                    a[i][j] ='+';
        }
        else {
            int l = 1;
            for(int i=1; i<=indx; i++)
                for(int j=1; j<=indy; j++)
                    a[i][j] = '+';
            for(int i=1; i<=indx; i++){
                p = k;
                while(p--){
                    a[i][l] = '-';
                    l++;
                    if(l == indy + 1)
                        l = 1;
                }
            }
        }
        for(int i=1; i<=n; i++){
            for(int j=1; j<=m; j++)
                cout << a[i][j];
            cout << endl;
        }
    }
    
    
    
    return 0;
}

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