oj.uz

답안 #683652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683652 2023-01-19T04:49:04 Z dostigator Red-blue table (IZhO19_stones) C++17
27 / 100
 21 ms 1336 KB 
//izho gold
#include <bits/stdc++.h>

using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define vt vector
#define endl '\n'
#define Y second
#define X first
typedef long long ll;
typedef long double ld;
const ll mod=1e9+7;
const ll INF=1e18;
const int inf=1e9;
const int N=2e5+505;
const int M=1e3+10;
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};

int n,m;

void solve(){
	cin>>n>>m;
	if(min(n,m)<=3){
		if(n<=m){
			if(n==1){
				cout<<m<<endl;
				for(int i=1; i<=m; ++i)cout<<'-';
				cout<<endl;
				return;
			}if(n==2){
				cout<<m<<endl;
				for(int i=1; i<=m; ++i)cout<<'-';
				cout<<endl;
				for(int i=1; i<=m; ++i)cout<<'-';
				cout<<endl;
				return;
			}if(n==3){
				cout<<m+1<<endl;
				for(int i=1; i<=m; ++i)cout<<'-';
				cout<<endl;
				for(int i=1; i<=m; ++i)cout<<'+';
				cout<<endl;
				for(int i=1; i<=m; ++i)cout<<'-';
				cout<<endl;
				return;
			}
		}else{
			if(m==1){
				cout<<n<<endl;
				for(int i=1; i<=n; ++i)cout<<"+\n";
				return;
			}if(m==2){
				cout<<n<<endl;
				for(int i=1; i<=n; ++i)cout<<"++\n";
				return;
			}if(m==3){
				cout<<n+1<<endl;
				for(int i=1; i<=n; ++i)cout<<"+-+\n";
				return;
			}
		}
	}if(n*m<=16){
		vt<pair<int,int>>lst;
		char matrix[20][20];
		for(int mask=0; mask<(1<<(n*m)); ++mask){
			int x=1,y=1;
			for(int i=0; i<n*m; ++i){
				if(mask&(1<<i)){
					matrix[x][y]='+';
				}else matrix[x][y]='-';
				++y;
				if(y>m){
					++x;
					y=1;
				}
			}
			int cnt=0;
			for(int i=1; i<=n; ++i){
				int heh=0;
				for(int j=1; j<=m; ++j)heh+=(matrix[i][j]=='+');
				if(heh>m-heh)++cnt;
			}for(int j=1; j<=m; ++j){
				int heh=0;
				for(int i=1; i<=n; ++i)heh+=(matrix[i][j]=='-');
				if(heh>n-heh)++cnt;
			}lst.pb({cnt,mask});
		}sort(all(lst));
		int mask=lst.back().Y;
		cout<<lst.back().X<<endl;
		int x=1,y=1;
		for(int i=0; i<n*m; ++i){
			if(mask&(1<<i)){
				matrix[x][y]='+';
			}else matrix[x][y]='-';
			++y;
			if(y>m){
				++x;
				y=1;
			}
		}
		for(int i=1; i<=n; ++i){
			for(int j=1; j<=m; ++j){
				cout<<matrix[i][j];
			}cout<<endl;
		}return;
	}
}

int main(){
	//srand(time(0));
	//freopen("hotel.in","r",stdin);
	//freopen("hotel.out","w",stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tt=1,lolol=0;
	cin>>tt;
	while(tt--) {
		//cout<<"Case "<<++lolol<<": ";
		solve();
	}
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:117:11: warning: unused variable 'lolol' [-Wunused-variable]
  117 |  int tt=1,lolol=0;
      |           ^~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 984 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 984 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 21 ms 1336 KB Wrong answer
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 324 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 856 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 10 ms 984 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 21 ms 1336 KB Wrong answer
5 Halted 0 ms 0 KB -