# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147261 | ipaljak | Konj (COCI19_konj) | C++14 | 78 ms | 760 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 TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
typedef long long llint;
const int MOD = 1e9 + 7;
const int MAXN = 605;
const int dr[] = {0, -1, 0, 1};
const int ds[] = {1, 0, -1, 0};
int n, D = 600;
char grid[MAXN][MAXN];
void draw(int a, int b, int c, int d) {
for (int i = min(a, c); i <= max(a, c); ++i)
for (int j = min(b, d); j <= max(b, d); ++j)
grid[i][j] = '*';
}
void print() {
int minr = D, maxr = 0, mins = D, maxs = 0;
for (int i = 0; i <= D; ++i) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |