# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76342 | kig9981 | 조화행렬 (KOI18_matrix) | C++17 | 3795 ms | 787456 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>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#else
#define TEST(n) ((void)0)
#endif
using namespace std;
struct SegTree
{
int l, r, v;
SegTree() : l(0), r(0), v(0) {}
};
int M, N, cnt = 1 << 19;
vector<int> X, Y;
vector<tuple<int, int, int>> V;
SegTree tree[61200000];
void add_tree2(int y, int v, int bit, int s = 1, int e = N)
{
int m = (s + e) >> 1;
if (s == e) {
tree[bit].v = v;
return;
}
if (y <= m) {
if (tree[bit].l == 0) {
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... |