# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
490791 | Ziyoda | Red-blue table (IZhO19_stones) | C++14 | 138 ms | 3268 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>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int t;
cin >> t;
while(t--){
int n, m, n1, m1;
cin >> n >> m;
n1 = n; m1 = m;//bool swa=0;
if(n1>m1)
swap(n1, m1);
int e = (n1-1)/2, mn = 0, mns = m1, h = m1/2+1, s=0;
string a[n1];
map<int, int> mpc;
map<int, int> mpr; int mxx=0;
for(int i=0; i<n1; i++){
int mx = mxx, h1=h;
for(int j=0; j<m1; j++){
if(mpc[j]<e){
if(h1!=0){
if((m1-j)==h1 || mpc[j]<mx)
a[i]+='+', h1--,mpc[j]++,mpr[i]++;
else
a[i]+='-'; }
else{
a[i]+='-';
}
}
else{
a[i]+='-';
}
mxx=max(mxx, mpc[j]);
}
}
for(int i=0; i<n; i++)
if(mpr[i]==h)
s++;
cout << s+m1 << "\n";
if(n==n1)
for(int i=0; i<n; i++)
cout << a[i] << "\n";
else{
for(int i=0; i<m1; i++){
for(int j=0; j<n1; j++)
if(a[j][i]=='-')
cout << '+';
else
cout << '-';
cout << "\n";
}
}
}
}
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... |