# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960922 | danikoynov | Cultivation (JOI17_cultivation) | C++14 | 1156 ms | 604 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 endl '\n'
using namespace std;
typedef long long ll;
const int maxn = 310, maxc = 42;
int n, r, c;
int used[2 * maxc][2 * maxc];
int x[maxn], y[maxn];
void solve()
{
cin >> r >> c;
cin >> n;
for (int i = 1; i <= n; i ++)
cin >> x[i] >> y[i];
int ans = r + c - 2;
for (int h = 1; h <= r; h ++)
for (int w = 1; w <= c; w ++)
{
for (int i = 0; i < 2 * maxc; i ++)
for (int j = 0; j < 2 * maxc; j ++)
used[i][j] = 0;
for (int i = 1; i <= n; i ++)
{
for (int dx = x[i]; dx < x[i] + h; dx ++)
# | 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... |