oj.uz

Submission #209931

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

const int maxn = 1000;
int n, m;
int a[maxn][maxn];
queue<pi> q;
bool f;

void answer(){
	cin >> n >> m;
	
	if(n < m){
		swap(n, m);
		f = 1;
	}else f = 0;
	
	for(int i = 0; i < n; i++){
		if((m - 1) / 2) q.push({i, (m - 1) / 2});
	}
	
	int ret = 0;
	memset(a, 0, sizeof(a));
	for(int i = n / 2; !q.empty(); i--){
		pi p = q.front();
		q.pop();
		
		a[p.f][ret] = 1;
		if(--p.s) q.push(p);
		
		if(!i){
			ret++;
			i = 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]) ^ f ? '-' : '+');
		}
		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 7 ms 4216 KB Output is correct
2 Correct 9 ms 4216 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 4216 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4216 KB Output is correct
2 Correct 9 ms 4216 KB Output is correct
3 Correct 44 ms 4216 KB Output is correct
4 Correct 69 ms 4324 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 5256 KB Output is correct
2 Correct 34 ms 5240 KB Output is correct
3 Correct 31 ms 5112 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 5240 KB Output is correct
2 Correct 32 ms 5112 KB Output is correct
3 Correct 31 ms 4984 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4216 KB Output is correct
2 Correct 9 ms 4216 KB Output is correct
3 Correct 44 ms 4216 KB Output is correct
4 Correct 69 ms 4324 KB Output is correct
5 Correct 96 ms 5256 KB Output is correct
6 Correct 34 ms 5240 KB Output is correct
7 Correct 31 ms 5112 KB Output is correct
8 Correct 54 ms 5240 KB Output is correct
9 Correct 32 ms 5112 KB Output is correct
10 Correct 31 ms 4984 KB Output is correct
11 Correct 124 ms 4472 KB Output is correct
12 Correct 30 ms 4984 KB Output is correct
13 Correct 32 ms 5112 KB Output is correct
14 Correct 27 ms 4856 KB Output is correct
15 Correct 36 ms 5240 KB Output is correct
16 Correct 29 ms 4984 KB Output is correct
17 Correct 17 ms 4600 KB Output is correct