# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366554 | Tuk1352 | Bitaro the Brave (JOI19_ho_t1) | C++11 | 884 ms | 88556 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()
{
int n, m, p;
cin >> n >> m;
char C[n][m];
int H[n][m], R[n][m];
for (int i = 0; i < n; i++)
{
for (int y = 0; y < m; y++)
{
cin >> C[i][y];
H[i][y] = 0;
R[i][y] = 0;
}
}
for (int i = 0; i < n; i++)
{
for (int y = m-1; y >= 0; y--)
{
if (y == m-1)
{
R[i][y] = 0;
}
else
{
R[i][y] = R[i][y+1];
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... |