# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
168748 | RafaelSus | Red-blue table (IZhO19_stones) | C++14 | 37 ms | 4160 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t-- > 0){
int n, m;
cin >> n >> m;
///////////////////OK
if (n == 1){
cout << m << '\n';
for (int i = 0; i < m; i++){
cout << "-";
}
cout << '\n';
continue;
}else if (m == 1){
cout << n << '\n';
for (int i = 0; i < n; i++){
cout << "+\n";
}
continue;
}//////////////////OK
if (n >= m){
//vector <vector <char>> g(n, vector <char>(m, '-'));
int g[n + 10][m + 10];
for (int i = 0; i < n; i++){
g[i][0] = 1;
g[i][m - 1] = 1;
}
int x = (m - 2) / 2;
vector <int> vec(m, 0);
int mx = 0;
for (int i = 0; i < x; i++){
vec[i * 2] = 1;
mx = i * 2;
}
int low = 0, high = mx;
for (int i = 0; i < n; i++){
for (int j = 1; j < m - 1; j++){
if (vec[j - 1] == 1)g[i][j] = 1;
else g[i][j] = 0;
}
vector <int> used(m);
//for (auto x : vec) cout << x << ' ';
//cout << '\n';
if (m % 2 == 0 && i == n - 2)continue;
for (int j = 0; j <= m - 2; j++){
if (vec[j] == 1 && !used[j]){
vec[j] = 0;
if (j + 1 < m - 2){
vec[j + 1] = 1;
used[j + 1] = 1;
}else{
vec[0] = 1;
used[0] = 1;
}
}
}
}
//////////////////////
//CHECK///////////////
//////////////////////
int answ = 0;
for (int i = 0; i < n; i++){
int h = 0;
for (int j = 0; j < m; j++){
if (g[i][j] == 1)h++;
}
if (h > (m - h))answ++;
}
for (int i = 0; i < m; i++){
int h = 0;
for (int j = 0; j < n; j++){
if (g[j][i] == 0)h++;
}
if (h > (n - h))answ++;
}
cout << answ << '\n';
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
if (g[i][j] == 1)cout << "+";
else cout << "-";
//cout << g[i][j];
}
cout << '\n';
}
}
else{
//vector <vector <char>> g(n, vector <char>(m, '-'));
int g[n + 10][m + 10];
for (int i = 0; i < m; i++){
g[0][i] = 0;
g[n - 1][i] = 0;
}
int x = (n - 2) / 2;
vector <int> vec(n, 0);
int mx = 0;
for (int i = 0; i < x; i++){
vec[i * 2] = 1;
mx = i * 2;
}
int low = 0, high = mx;
for (int i = 0; i < m; i++){
for (int j = 1; j < n - 1; j++){
if (vec[j - 1] == 1)g[j][i] = 0;
else g[j][i] = 1;
}
vector <int> used(n);
//for (auto x : vec) cout << x << ' ';
//cout << '\n';
if (n % 2 == 0 && i == m - 2)continue;
for (int j = 0; j <= n - 2; j++){
if (vec[j] == 1 && !used[j]){
vec[j] = 0;
if (j + 1 < n - 2){
vec[j + 1] = 1;
used[j + 1] = 1;
}else{
vec[0] = 1;
used[0] = 1;
}
}
}
}
//////////////////////
//CHECK///////////////
//////////////////////
int answ = 0;
for (int i = 0; i < n; i++){
int h = 0;
for (int j = 0; j < m; j++){
if (g[i][j] == 1)h++;
}
if (h > (m - h))answ++;
}
for (int i = 0; i < m; i++){
int h = 0;
for (int j = 0; j < n; j++){
if (g[j][i] == 0)h++;
}
if (h > (n - h))answ++;
}
cout << answ << '\n';
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
if (g[i][j] == 1) cout << "+";
else cout << "-";
//cout << g[i][j];
}
cout << '\n';
}
}
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |