제출 #1191710

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

stones

#include <iostream>

using namespace std;

char v[1001][1001];

void solve(){
    int n,m,i,j,rasp,stg=0,fol,col,lin;
    cin>>n>>m;
    if(n<m){
        swap(n,m);
        stg=1;
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            v[i][j]='+';
        }
    }
    rasp=n;fol=0;col=lin=1;
    for(i=1;i<=n*((m-1)/2);i++){
        v[lin][col]='-';
        fol++;
        if(fol>=(n-(n-1)/2)){
            fol=0;col++;rasp++;
        }
        lin=lin%n+1;
    }
    cout<<rasp<<"\n";
    if(!stg){
        for(i=1;i<=n;i++){
            for(j=1;j<=m;j++){
                cout<<v[i][j];
            }
            cout<<"\n";
        }
   }else{
        for(j=1;j<=m;j++){
            for(i=1;i<=n;i++){
                if(v[i][j]=='+') cout<<"-";
                else cout<<"+";
            }
            cout<<"\n";
        }
    }
}

int main()
{
    int t;
    cin>>t;
    while(t){
        solve();
        t--;
    }
    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