제출 #1156373

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

stones

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
const int N=1e6+5;
const int M=998244353;
const int LOG = 20;
int n , m , k , c , t=1 , q=1 , x , y , p[N];
int sg[LOG][N];
vector<int>a(N),b(N);
void makesg(){
	for (int i=0;i<N;i++){
		sg[0][i]=b[i];
	}
	for (int j=1;j<LOG;j++){
		for (int i=(int)pow(2,j)-1;i<N;i++){
			sg[j][i]=max(sg[j-1][i],sg[j-1][i-(int)pow(2,j-1)]);
		}
	}
}
int lr(int l,int r){
	int x=log2(r-l+1);
	return max(sg[x][r],sg[x][l+(int)pow(2,x)-1]);
}
void solve()
{
	cin >> n >> m;
	string s;
	if (n<=m){
		for (int i=0;i<m;i++){
			s+='+';
		}
		vector<string>a(n,s);
		x=n/2+1;
		for (int j=0;j<m;j++){
			for (int i=0;i<x;i++){
				a[i][j]='-';
			}
		}
		cout << m+n-x << endl;
		for (string p:a){
			cout << p << endl;
		}
	}
	else{
		for (int i=0;i<m;i++){
			s+='-';
		}
		vector<string>a(n,s);
		x=m/2+1;
		for (int i=0;i<n;i++){
			for (int j=0;j<x;j++){
				a[i][j]='+';
			}
		}
		cout << n+m-x << endl;
		for (string p:a){
			cout << p << endl;
		}
	}

}
signed main()
{

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed<<setprecision(9);
    // int t=1;
    cin >> t;
    for (int _=1;_<=t;_++){
    	solve();
    	q++;
    }
}

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