oj.uz

답안 #154293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154293 2019-09-20T10:48:31 Z nvmdava Red-blue table (IZhO19_stones) C++17
27 / 100
 29 ms 1400 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second

#define N 1200005
#define MOD 1000000007
#define INF 0x3f3f3f3f

void go(){
	int n, m;
	cin>>n>>m;
	int r1 = n + (m - 1) / 2;
	int r2 = m + (n - 1) / 2;

	if(r1 < r2){
		cout<<r2<<'\n';
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(i > (n - 1) / 2) cout<<'-';
				else cout<<'+';
			}
			cout<<'\n';
		}
	} else {
		cout<<r1<<'\n';
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(j <= (m - 1) / 2) cout<<'-';
				else cout<<'+';
			}
			cout<<'\n';
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	
	int t;
	cin>>t;
	while(t--){
		go();
	}	
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 31.0

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