# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1183780 | asdfghjk | Red-blue table (IZhO19_stones) | C++20 | 2096 ms | 580 KiB |
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define con continue
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ld;
const ll N = 1000 + 5;
const ll inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int a[N][N];
void solve(){
int n,m;cin >> n >> m;
int mx = 0,id = 0;
for(int mask = 0;mask < (1 << (n + m));mask++){
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
int ord = (i * m) + j;
a[i][j] = ((mask >> ord) & 1);
}
}
// 0=red,1=blue
int sum = 0;
for(int i = 0;i < n;i++){
int amo = 0;
for(int j = 0;j < m;j++){
if(a[i][j] == 0)amo++;
}
if(amo > m - amo){
sum++;
}
}
for(int i = 0;i < m;i++){
int amo = 0;
for(int j = 0;j < n;j++){
if(a[j][i] == 1)amo++;
}
if(amo > n - amo)sum++;
}
if(mx < sum){
mx = sum;
id = mask;
}
}
cout << mx << '\n';
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
int ord = (i * m) + j;
if(((id >> ord) & 1) == 1){
cout << '-';
}
else cout << '+';
}
cout << '\n';
}
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;cin >> t;
while(t--){
solve();
}
}
컴파일 시 표준 에러 (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... |