oj.uz

Submission #209947

# Submission time Handle Problem Language Result Execution time Memory
209947 2020-03-16T04:01:53 Z super_j6 Red-blue table (IZhO19_stones) C++14
100 / 100
 34 ms 5240 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second

void answer(){
	int n, m;
	cin >> n >> m;
	
	bool f = 0;
	if(n < m){
		swap(n, m);
		f = 1;
	}
	
	int ret = 0;
	int a[n][m];
	memset(a, 0, sizeof(a));
	for(int i = 0, c = n / 2; i < (m - 1) / 2; i++)
	for(int j = 0; j < n; j++, c--){
		a[j][ret] = 1;
		if(!c){
			ret++;
			c = n / 2 + 1;
		}
	}
	ret += n;
	
	if(f) swap(n, m);
	cout << ret << endl;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cout << ((f ? !a[j][i] : a[i][j]) ? '-' : '+');
		}
		cout << endl;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t;
	cin >> t;
	
	for(int i = 0; i < t; i++) answer();

	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 400 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1400 KB Output is correct
2 Correct 29 ms 3832 KB Output is correct
3 Correct 30 ms 3960 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1400 KB Output is correct
2 Correct 27 ms 3192 KB Output is correct
3 Correct 26 ms 2424 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 400 KB Output is correct
5 Correct 34 ms 1400 KB Output is correct
6 Correct 29 ms 3832 KB Output is correct
7 Correct 30 ms 3960 KB Output is correct
8 Correct 31 ms 1400 KB Output is correct
9 Correct 27 ms 3192 KB Output is correct
10 Correct 26 ms 2424 KB Output is correct
11 Correct 15 ms 504 KB Output is correct
12 Correct 27 ms 2808 KB Output is correct
13 Correct 26 ms 2424 KB Output is correct
14 Correct 22 ms 1656 KB Output is correct
15 Correct 32 ms 5240 KB Output is correct
16 Correct 26 ms 3960 KB Output is correct
17 Correct 13 ms 1912 KB Output is correct