# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
681546 | Matteo_Verz | Red-blue table (IZhO19_stones) | C++17 | 33 ms | 1236 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;
auto solve(int x, int y) {
char ch, replacech;
if (x >= y) {
ch = '+';
replacech = '-';
} else {
ch = '-';
replacech = '+';
}
vector <vector <char>> a(x, vector <char>(y, ch));
int ans;
if (x >= y) {
ans = x;
for (int j = 0; j < (y - 1) / 2; j++) {
for (int i = 0; i < x / 2 + 1; i++)
a[i][j] = replacech;
ans++;
}
} else {
ans = y;
vector <int> freq(y);
int pos = 0, line = 0;
while (true) {
if (freq[(pos + y / 2) % y] < (x - 1) / 2) {
for (int i = pos; i <= pos + y / 2; i++) {
# | 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... |