# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143524 | imeimi2000 | Rectangles (IOI19_rect) | C++17 | 4256 ms | 373552 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 "rect.h"
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef long long llong;
const short inf = 1e4;
int n, m;
short L[2501][2501];
short R[2501][2501];
short U[2501][2501];
short D[2501][2501];
short Lm[2501][2501];
short Rm[2501][2501];
short Um[2501][2501];
short Dm[2501][2501];
struct idxtree {
const static int sz = 1 << 12;
short seg[sz << 1];
void init(vector<short> v) {
for (int i = 1; i <= v.size(); ++i) seg[i + sz] = v[i - 1];
for (int i = sz; i--; ) seg[i] = min(seg[i << 1], seg[i << 1 | 1]);
}
short query(int x, int y) {
x += sz;
y += sz;
short ret = inf;
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... |
# | 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... |