# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286836 | oolimry | Red-blue table (IZhO19_stones) | C++14 | 30 ms | 4352 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 all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
using namespace std;
typedef long long lint;
typedef pair<int,int> ii;
pair<int, vector<string> > solve(int rows, int cols){
vector<string> res;
for(int r = 0;r < rows;r++){
res.push_back("");
for(int c = 0;c < cols;c++){
res.back() += '-';
}
}
int ans = cols;
vector<int> F;
F.assign(cols, 0);
int c = 0;
int needcol = (cols / 2) + 1;
int maxrow = ((rows-1) / 2);
int row = 0;
int take = 0;
while(true){
if(F[c] == maxrow) break;
res[row][c] = '+';
# | 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... |