oj.uz

답안 #344425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
344425 2021-01-05T19:03:57 Z YJU Red-blue table (IZhO19_stones) C++14
27 / 100
 35 ms 1388 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e6+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll t,n,m;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>t;
	while(t--){
		cin>>n>>m;
		cout<<(max(n-(n+2)/2+m,m-(m+2)/2+n))<<"\n";
		if(n-(n+2)/2+m>=m-(m+2)/2+n){
			REP1(i,n)REP1(j,m){
				cout<<(i>(n+2)/2?('+'):('-'));
				if(j==m)cout<<'\n';
			}
		}else{
			REP1(i,n)REP1(j,m){
				cout<<(j>(m+2)/2?'-':'+');
				if(j==m)cout<<'\n';
			}
		}
		cout<<'\n';
	}
	return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Incorrect 2 ms 364 KB Wrong answer in test 5 29: 31 < 32

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 1388 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 1388 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Incorrect 2 ms 364 KB Wrong answer in test 5 29: 31 < 32