# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67335 | h0ngjun7 | 조화행렬 (KOI18_matrix) | C++17 | 4043 ms | 471032 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;
const int MAXN = 200005;
int N, M;
int A[4][MAXN], P[MAXN], X[4][MAXN], XN[4];
int C[4][MAXN];
int D[MAXN], ans;
struct SEGX {
int l, r, p;
} segx[MAXN*18]; int segxn = 1;
struct SEGY {
int l, r, w;
} segy[MAXN*18*18]; int segyn;
void updy(int cur, int s, int e, int y, int z) {
if (s == e) {
segy[cur].w = z;
return;
}
int m = (s+e)/2;
if (y <= m) {
if (segy[cur].l == 0) segy[cur].l = ++segyn;
updy(segy[cur].l, s, m, y, z);
} else {
if (segy[cur].r == 0) segy[cur].r = ++segyn;
updy(segy[cur].r, m+1, e, y, z);
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... |