# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544856 | MilosMilutinovic | Red-blue table (IZhO19_stones) | C++14 | 2077 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
int n,m;
void solve(){
scanf("%d%d",&n,&m);
int ans=0,tx=0,ty=0;
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
vector<int> row(n+1),col(m+1);
for(int x=1;x<=n;x++)for(int y=1;y<=m;y++){
int b=((x<=i&&y<=j)?-1:1);
row[x]+=b; col[y]+=b;
}
int tans=0;
for(int x=1;x<=n;x++)if(row[x]>0)tans++;
for(int y=1;y<=m;y++)if(col[y]<0)tans++;
if(tans>ans)ans=tans,tx=i,ty=j;
}
printf("%d\n",ans);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)printf("%c",(i<=tx&&j<=ty?'-':'+'));
printf("\n");
}
}
int main(){
int T;
scanf("%d",&T);
while(T--)solve();
return 0;
}
Compilation message (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... |