# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
490190 | ismoilov | Red-blue table (IZhO19_stones) | C++14 | 24 ms | 2252 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;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long int ll;
void S()
{
int n, m;
cin >> n >> m;
bool swaped = 0;
char red = '+', blue = '-';
if(n < m)
swap(n, m), swaped = 1, swap(red, blue);
char a[n][m];
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
a[i][j] = red;
int ans = n, cnt = 0;
for(int k = 0; k < (m-1)/2; k ++){
for(int i = 0; i < n; i ++){
a[i][ans-n] = blue;
cnt ++;
// cout << cnt << " ";
if(cnt == (n/2)+1)
ans ++, cnt = 0;//, cout << cnt << " ", cnt = 0;
}
}
cout << ans << "\n";
if(!swaped){
for(int i = 0; i < n; i ++){
for(int j = 0; j < m; j ++)
# | 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... |