# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372970 | luciocf | Examination (JOI19_examination) | C++14 | 3082 ms | 265060 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>
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
const int maxn = 2e5+10;
struct BIT2D
{
unordered_map<int, int> bit[maxn];
void upd(int x, int y, int v)
{
for (int i = x; i < maxn; i += (i&-i))
for (int j = y; j < maxn; j += (j&-j))
bit[i][j] += v;
}
int soma(int x, int y)
{
int ans = 0;
for (int i = x; i > 0; i -= (i&-i))
for (int j = y; j > 0; j -= (j&-j))
ans += bit[i][j];
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... |