제출 #499457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499457		yahyobekabdunazarov	Red-blue table (IZhO19_stones)	C++17	27 / 100	21 ms	1280 KiB

stones

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(){
    int n, m;
    cin >> n >> m;
    if(n>m){
        cout << n+floor((m-1)/2) << "\n";
        for(int i = 0; i < n; i++){
          for(int j = 0; j < m; j++){
            if(j>m/2){
                cout << "-";
            }  
            else{
                cout << "+";
            }
          }
          cout << "\n";
        }
    }
    else if(n<m){
        cout << m+floor((n-1)/2) << "\n";
        for(int i = 0; i < n; i++){
          for(int j = 0; j < m; j++){
            if(i>n/2){
                cout << "+";
            }  
            else{
                cout << "-";
            }
          }
          cout << "\n";
        }
    }
    else{
        cout << n+floor((m-1)/2) << "\n";
        for(int i = 0; i < n; i++){
          for(int j = 0; j < m; j++){
            if(j>m/2){
                cout << "-";
            }  
            else{
                cout << "+";
            }
          }
          cout << "\n";
        }
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

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