oj.uz

Submission #681756

# Submission time Handle Problem Language Result Execution time Memory
681756 2023-01-14T07:07:26 Z SnoT Red-blue table (IZhO19_stones) C++14
43 / 100
 50 ms 1332 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ssort sort(s.begin(),s.end());
#define sreverse reverse(s.begin(),s.end());
#define sclear s.clear();
#define ssize s.size();
#define ld long double
#define F first
#define S second
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define sq(a) (a)*(a)
/*void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}*/
ll a,b,c,e,d,f,k,g,h,r,i,j,x,y,z,m,n,l,t,p,s,u,sum,ans,mod=1e18;
char arr[200][200];
int main(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>a;
    for(i=1;i<=a;i++)
    {
    	r=0;
    	cin>>n>>m;
    	if(n==1&&m==1){
    		cout<<1<<endl<<'+'<<endl; continue;
		}
		if(n>m){
			swap(n,m); r=1; //swapped
			
	}
	    for(j=1;j<=n;j++){
		    for(k=1;k<=m;k++){
			    if(r) arr[j][k]='+';
			    else arr[j][k]='-';
		}
	}
	l=min(n,(n/2-!(n%2))*m/(m/2+1));
	cout<<m+l<<endl; 
	for(j=1,h=1;j<= l ;j++){
		for(k=1;k<=m/2+1;k++,h++)
		{
			if(h>m) h=1;
			if(r) arr[j][h]='-';
			else  arr[j][h]='+';

		}
	}
	if(!r){
		
	for(j=1;j<=n;j++)
	{
		for(k=1;k<=m;k++)
		{
			cout<<arr[j][k];
		}
		cout<<endl;
	}
	}
	else{
	
	for(j=1;j<=m;j++)
	{
		for(k=1;k<=n;k++)
		{
			cout<<arr[k][j];
		}
		cout<<endl;
	}
}
}
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 212 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 212 KB Output is correct
4 Correct 10 ms 356 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1332 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1312 KB Output is correct
2 Runtime error 2 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 212 KB Output is correct
4 Correct 10 ms 356 KB Output is correct
5 Correct 50 ms 1332 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -