oj.uz

답안 #167945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167945 2019-12-11T01:50:29 Z YottaByte Red-blue table (IZhO19_stones) C++14
0 / 100
 2000 ms 376 KB 
#include <iostream>

using namespace std;

#define ll long long
#define sz(x) (int)x.size()
#define pii pair < int, int >
#define endl "\n"
#define METH ios::sync_with_stdio(0); cin.tie(0);
#define BEGIN cout << "BEGIN" << endl;
#define END cout << "END" << endl;

const int mod = 1e9 + 7;										/// ANOTHER HASH MOD: 228228227
const int prime = 29;											/// ANOTHER HASH PRIME: 997
const int INF = ((long long) 0xCAFEBABE - 1e9 - 4e8);

int n, m;

inline void purify() {
}

inline void precalc() {
}

inline void read() {
	scanf("%d %d", &n, &m);
}

inline int check(int mask) {
	int res = 0;
	for (int i = 0; i < n; i++) {
		int cnta = 0;
		for (int j = 0; j < m; j++) {
			if (mask >> (j + i * m) & 1) {
				cnta++;
			}
		}

		if (cnta > m / 2) {
			res++;
		}
	}

	for (int i = 0; i < m; i++) {
		int cntb = 0;
		for (int j = 0; j < n; j += m) {
			if (!(mask >> (j + i) & 1)) {
				cntb++;
			}
		}

		if (cntb > n / 2) {
			res++;
		}
	}

	return res;
}

void out(int mask) {
	for (int i = 0; i < n * m; i++) {
		if (mask >> i & 1) {
			cout << '+';
		} else {
			cout << '-';
		}
		if ((i + 1) % m == 0) {
			cout << endl;
		}
	}
}

inline void solve() {
	int ansab = 0, ans = -1;
	for (int i = 0; i < (1 << (n * m)); i++) {
		if (ansab < check(i)) {
			ansab = check(i);
			ans = i;
		}
	}

	cout << ansab << endl;
	out(ans);
}

int main() {
	int t;
	scanf("%d", &t);

	//precalc();
	while (t--) {
		//purify();
		read();
		solve();
	}
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:88:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &t);
  ~~~~~^~~~~~~~~~
stones.cpp: In function 'void read()':
stones.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 256 KB Time limit exceeded

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2070 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB in the table A+B is not equal to 3
2 Halted 0 ms 0 KB -