# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
267149 | johutha | Rectangles (IOI19_rect) | C++17 | 5098 ms | 606032 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 <vector>
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
struct fenw
{
int n;
vector<int> table;
int query(int k)
{
int res = 0;
for (; k; k -= (k & (-k))) res += table[k];
return res;
}
void update(int k, int v)
{
k++;
for (; k <= n; k += (k & (-k))) table[k] += v;
}
fenw(int in) : n(in), table(vector<int>(n + 1)) {}
};
# | 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... |